Searched refs:sorted (Results 1 – 25 of 25) sorted by relevance
19 Once the buffer has grown to its threshold, keys are sorted and written to21 allocation the sorter module makes. After keys are sorted and flushed out to31 Once sorted buffers of keys have been flushed to disk, they are read back
1088 stp = lemp->sorted[i]; in FindLinks()1097 stp = lemp->sorted[i]; in FindLinks()1163 stp = lemp->sorted[i]; in FindActions()1199 stp = lemp->sorted[i]; in FindActions()3431 stp = lemp->sorted[i]; in ReportOutput()4520 stp = lemp->sorted[i]; in ReportTable()4683 stp = lemp->sorted[i]; in ReportTable()4708 stp = lemp->sorted[i]; in ReportTable()4727 stp = lemp->sorted[i]; in ReportTable()4998 stp = lemp->sorted[i]; in CompressTables()[all …]
43 # of the b-tree are (in sorted order):49 # Records are inserted in sorted order.
43 # the output should appear in sorted order. If random() is evaluated
31 # Return a sorted list of all files with the base name of $basename.
73 # The output is sorted manually in this case.222 # The output is sorted manually in this case.357 # The output is sorted manually in this case.
56 # the results should be in sorted order already
24 # is sorted in [lsort] order before it is returned.
185 # t2 root IN [10,12] (sorted)
114 # table created by [populate_table] proc above. Rows are sorted in order
240 # sorted by value. The return value is the list produced by evaluating
322 # Check that "ORDER BY term ASC" and equivalents are sorted by the
404 # LIMIT clause are sorted according to the ORDER BY. The first M rows,
840 # sorted in the correct order (REPLACE last) so that constraint processing
549 # are sorted according to the ORDER BY and the first N updated.
1665 # EVIDENCE-OF: R-44988-41064 Rows are first sorted based on the results1683 # are sorted in ascending (smaller values first) order by default.1850 # The following tests verify that values of different types are sorted
1915 # EVIDENCE-OF: R-11847-09179 1 if the index-column is sorted in reverse
762 # Check that the rows inserted into the table, sorted in ascending rowid
19048 sorted sort
484 unsigned sorted :1; /* True if really sorted (not just grouped) */ member
4706 return pWInfo->sorted; in sqlite3WhereIsSorted()5151 assert( pWInfo->sorted==0 ); in wherePathSolver()5153 pWInfo->sorted = 1; in wherePathSolver()
2073 ** to be sorted exceeds the page size times the minimum of the2096 ** sorted records. However, if SQLite determines based on the declared type2099 ** is stored in each sorted record and the required column values loaded2100 ** from the database as records are returned in sorted order. The default9643 ** virtual table outputs all rows in sorted order, then it is always safe for9648 ** that the query planner does not need the rows to be returned in sorted order9667 ** rows to be sorted.)^ ^The virtual table implementation is free to omit
159 are sorted according to the collation sequence indicated by the
101 # the root node the only entry in a priority queue sorted by rScore.
9532 sorted sort sorting sort