Home
last modified time | relevance | path

Searched refs:sort (Results 1 – 25 of 62) sorted by relevance

123

/sqlite-3.40.0/test/
H A Dsort.test18 set testprefix sort
27 do_test sort-1.0 {
48 do_test sort-1.1 {
57 do_test sort-1.2 {
60 do_test sort-1.3a {
66 do_test sort-1.4 {
69 do_test sort-1.5 {
72 do_test sort-1.6 {
75 do_test sort-1.7 {
78 do_test sort-1.8 {
[all …]
H A Dwhere7.test27 lappend r scan [db status step] sort [db status sort]
32 return "$r scan [db status step] sort [db status sort]"
66 } {2 3 scan 0 sort 1}
128 } {3 scan 4 sort 0}
133 } {3 scan 4 sort 0}
142 } {scan 0 sort 1}
150 } {5 scan 0 sort 1}
158 } {5 scan 0 sort 1}
166 } {5 scan 0 sort 1}
175 } {scan 0 sort 1}
[all …]
H A Dcollate9.test24 db collate "reverse sort" reverse_sort
36 if {$::sqlite_sort_count} {set x sort} {set x nosort}
71 } {two three one sort}
105 SELECT y FROM xy ORDER BY y COLLATE "reverse sort"
116 CREATE INDEX xy_i2 ON xy(y COLLATE "reverse sort");
123 } {one three two sort}
126 SELECT y FROM xy ORDER BY y COLLATE "reverse sort"
133 } {one three two sort}
143 REINDEX "reverse sort"
162 REINDEX "reverse sort"
[all …]
H A Dboundary4.tcl72 proc sort {inlist} { procedure
149 foreach r [sort $all_rowid] {
163 foreach a [sort $all_a] {
179 foreach x [sort $all_x] {
197 foreach r [sort $all_rowid] {
211 foreach a [sort $all_a] {
227 foreach x [sort $all_x] {
260 foreach a [sort $all_a] {
276 foreach x [sort $all_x] {
309 foreach a [sort $all_a] {
[all …]
H A Dboundary2.tcl73 proc sort {inlist} { procedure
192 foreach rx [sort $rset] {
203 foreach rx [reverse [sort $rset]] {
218 foreach x [sort $xset] {
237 foreach rx [sort $rset] {
248 foreach rx [reverse [sort $rset]] {
266 foreach rx [sort $rset] {
348 foreach rx [sort $rset] {
374 foreach x [sort $xset] {
393 foreach rx [sort $rset] {
[all …]
H A Dbetween.test56 if {$::sqlite_sort_count} {set x sort} {set x nosort}
75 } {5 2 36 38 6 2 49 51 sort t1 i1w}
80 } {5 2 36 38 6 2 49 51 sort t1 *}
85 } {5 2 36 38 6 2 49 51 sort t1 i1w}
90 } {5 2 36 38 6 2 49 51 sort t1 *}
95 } {5 2 36 38 6 2 49 51 sort t1 i1w}
100 } {5 2 36 38 6 2 49 51 sort t1 *}
105 } {5 2 36 38 6 2 49 51 sort t1 *}
110 } {4 2 25 27 sort t1 i1zyx}
115 } {4 2 25 27 sort t1 i1zyx}
[all …]
H A Dwhere9.test28 lappend r scan [db status step] sort [db status sort]
275 } {92 scan 0 sort 0}
282 } {92 scan 0 sort 0}
289 } {scan 0 sort 0}
322 } {9999 scan 0 sort 1}
497 } {scan 0 sort 0}
515 } {scan 98 sort 0}
554 } {scan 0 sort 0}
878 } {80 scan 0 sort 1}
888 } {83 scan 0 sort 1}
[all …]
H A Dboundary1.tcl73 proc sort {inlist} { procedure
191 foreach rx [sort $rset] {
202 foreach rx [reverse [sort $rset]] {
217 foreach x [sort $xset] {
236 foreach rx [sort $rset] {
247 foreach rx [reverse [sort $rset]] {
265 foreach rx [sort $rset] {
276 foreach rx [reverse [sort $rset]] {
H A Dcollate4.test89 } {{} A B a b sort}
98 } {{} a A b B sort}
119 } {{} B a sort}
128 } {{} a B sort}
150 } {{} B a sort}
159 } {{} a B sort}
175 } {{} a A b B sort}
178 } {{} a A b B sort}
184 } {{} A B a b sort}
251 } {{} B a sort}
[all …]
H A Dtkt-b75a9ca6b0.test38 set sort {USE TEMP B-TREE FOR ORDER BY}
45 {1 3 2 2 3 1} {$idxscan*$sort}
48 {3 1 2 2 1 3} {$idxscan*$sort}
57 {1 3 2 2 3 1} {$tblscan*$grpsort*$sort}
60 {1 3 2 2 3 1} {$idxscan*$sort}
69 {1 3 2 2 3 1} {$idxscan*$sort}
H A Dboundary3.tcl72 proc sort {inlist} { procedure
210 foreach rx [sort $rset] {
223 foreach rx [reverse [sort $rset]] {
240 foreach x [sort $xset] {
261 foreach rx [sort $rset] {
274 foreach rx [reverse [sort $rset]] {
H A Dwhere2.test62 if {[db status sort]} {set x sort} {set x nosort}
74 if {$::sqlite_sort_count} {set x sort} {set x nosort}
119 } {85 6 7396 7402 sort t1 i1xy}
185 } {99 6 10000 10006 100 6 10201 10207 sort t1 i1zyx}
192 } {99 6 10000 10006 sort t1 i1zyx}
199 } {99 6 10000 10006 sort t1 i1zyx}
249 } {99 6 10000 10006 sort t1 i1xy}
344 } [list 1 0 4 4 2 1 9 10 sort a i1w b $::idx]
351 } [list 1 0 4 4 2 1 9 10 sort a i1w b $::idx]
507 } {3 4 sort}
[all …]
H A Dtkt3824.test25 if {[db status sort]} {
26 concat $result sort
45 } {-10 1 5 9 123 sort}
50 } {-10 1 5 9 123 sort}
65 } {5 9 sort}
70 } {5 9 sort}
H A Dtkt-2a5629202f.test19 # opcode was executed. If an OP_Sort did occur, then "sort" is appended
27 if {[db status sort]} {set x sort} {set x nosort}
70 } {sort}
74 } {sort}
H A Dtkt3757.test25 lappend r scan [db status step] sort [db status sort]
58 } {1 2 three scan 0 sort 0}
H A Dlike.test354 } {abc abcd sort t1 *}
366 } {abc abcd sort t1 *}
688 lappend r scan [db status step] sort [db status sort]
694 } {xyz scan 0 sort 0}
699 } {xyz scan 19 sort 0}
911 } {abc abcd ABC ABCD sort {} t11b}
927 } {abc abcd ABC ABCD sort {} t11bnc}
933 } {abc abcd ABC ABCD sort {} t11bnc}
939 } {abc abcd sort {} t11bb}
945 } {abc abcd sort {} t11bb}
[all …]
H A Ddescidx1.test101 # opcode was executed. If an OP_Sort did occur, then "sort" is appended
110 if {$::sqlite_sort_count} {set x sort} {set x nosort}
258 } {0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 1111 sort}
283 } {011 010 001 000 111 110 101 100 sort}
288 } {000 001 010 011 100 101 110 111 sort}
293 } {110 111 100 101 010 011 000 001 sort}
H A Dorderby6.test12 # focus of this file is testing that the block-sort optimization.
37 # Run various ORDER BY queries that can benefit from block-sort.
38 # Compare the output to the same output using a full-sort enforced
54 # LIMIT and OFFSET clauses on block-sort queries.
85 # alignments with block-sort boundaries.
H A Dwhere.test533 if {[db status sort]} {set x sort} {set x nosort}
691 } {1 0 2 1 3 1 sort}
1061 } {1 one 4 four sort}
1066 } {4 four 1 one sort}
1127 } {1 one 4 four sort}
1132 } {4 four 1 one sort}
1201 } {4/1 4/4 1/1 1/4 sort}
1206 } {4/1 4/4 1/1 1/4 sort}
1216 } {4/4 4/1 1/4 1/1 sort}
1221 } {4/4 4/1 1/4 1/1 sort}
[all …]
H A Dskipscan1.test48 do_execsql_test skipscan1-1.2sort {
60 do_execsql_test skipscan1-1.3sort {
72 do_execsql_test skipscan1-1.4sort {
84 do_execsql_test skipscan1-1.5sort {
96 do_execsql_test skipscan1-1.6sort {
110 do_execsql_test skipscan1-1.7sort {
159 do_execsql_test skipscan1-2.2sort {
185 do_execsql_test skipscan1-3.2sort {
H A Dselect9.test340 # opcode it appends "sort"
345 if {$::sqlite_sort_count} {set x sort} {set x nosort}
354 # can use indexes to run without doing a in-memory sort operation.
365 } {1 2 3 4 5 6 7 8 9 10 sort}
372 } {1 1 2 2 3 sort}
394 } {1 2 3 4 5 6 7 8 9 10 sort}
401 } {1 2 3 4 5 sort}
409 } {1 2 3 4 5 sort}
H A Ddescidx2.test114 # opcode was executed. If an OP_Sort did occur, then "sort" is appended
123 if {$::sqlite_sort_count} {set x sort} {set x nosort}
H A DorderbyA.test50 # can use the same sort order as the ORDER BY. $nomatch is the number
135 # ORDER BY can never piggyback on the GROUP BY sort if it uses
/sqlite-3.40.0/tool/
H A Dsymbols.sh16 nm sqlite3.o | grep ' [TD] ' | sort -k 3
28 nm sqlite3.o | grep ' U ' | sort -k 3
36 nm sqlite3.o | grep ' U ' | sort -k 3
/sqlite-3.40.0/ext/rtree/
H A DrtreeE.test68 # This causes the 200s to sort before the 100s and the 0s to sort before

123