Home
last modified time | relevance | path

Searched refs:scan (Results 1 – 25 of 115) sorted by relevance

12345

/sqlite-3.40.0/test/
H A Dwhere7.test66 } {2 3 scan 0 sort 1}
71 } {2 3 scan 4 sort 0}
76 } {2 3 scan 4 sort 0}
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 Dwhere9.test275 } {92 scan 0 sort 0}
282 } {92 scan 0 sort 0}
289 } {scan 0 sort 0}
322 } {9999 scan 0 sort 1}
338 } {80 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 Dskipscan2.test12 # This file implements tests of the "skip-scan" query strategy.
15 # the skip-scan query strategy in the "optoverview.html" document.
59 # Without ANALYZE, a skip-scan is not used
69 # Now do an ANALYZE. A skip-scan can be used after ANALYZE.
74 -- of a skip-scan. So make a manual adjustment to the stat1 table
105 # skip-scan should not be used after an (unfudged) ANALYZE.
130 # skip-scan will be used after an (unfudged) ANALYZE.
174 # Now do an ANALYZE. A skip-scan can be used after ANALYZE.
188 # A skip-scan on a PK index of a WITHOUT ROWID table.
H A Dskipscan1.test12 # This file implements tests of the "skip-scan" query strategy.
190 # Ticket 520070ec7fbaac: Array overrun in the skip-scan optimization
212 # Make sure skip-scan cost computation in the query planner takes into
247 # The column used by the skip-scan needs to be sufficiently selective.
257 -- Only two distinct values for the skip-scan column. Skip-scan is not used.
263 -- Four distinct values for the skip-scan column. Skip-scan is used.
269 -- Two distinct values for the skip-scan column again. Skip-scan is not used.
325 # A skip-scan with a "column IN (SELECT ...)" on the second term of the
340 optimization_control db skip-scan 0
345 optimization_control db skip-scan 1
H A Dindex8.test12 # Test cases for ORDER BY and LIMIT on an index scan.
38 # Prior to the fix, the following EQP would show a table scan and a sort
39 # rather than an index scan.
47 # then we should (correctly) revert to using a table scan.
H A Dlike.test694 } {xyz scan 0 sort 0}
699 } {xyz scan 19 sort 0}
781 } {12 123 scan 5 like 6}
786 } {12 123 scan 5 like 6}
791 } {12 123 scan 5 like 6}
796 } {12 123 scan 5 like 6}
814 } {12 123 scan 5 like 6}
830 } {12 123 scan 5 like 6}
835 } {12 123 scan 5 like 6}
840 } {12 123 scan 5 like 6}
[all …]
H A Dskipscan3.test12 # This file implements tests of the "skip-scan" query strategy.
15 # "WHERE a=?1 AND c=?2" - verify that skip-scan can still be used.
30 # This version has long used skip-scan because of the "+a"
39 # This version (with "a" instead of "+a") should use skip-scan but
H A Dtkt3757.test21 # and the number of full-scan steps.
25 lappend r scan [db status step] sort [db status sort]
58 } {1 2 three scan 0 sort 0}
H A Dskipscan6.test12 # This file implements tests of the "skip-scan" query strategy. In
14 # is always preferred over the use of a skip-scan on some columns of
15 # the same index. Because of difficulties in scoring a skip-scan,
16 # the skip-scan can sometimes come out with a lower raw score when
18 # full index rather than the skip-scan.
185 # same reason. At one point though, it was mistakenly using a skip-scan.
H A Dfts3defer2.test24 set scan(littleEndian) i*
25 set scan(bigEndian) I*
26 binary scan $blob $scan($::tcl_platform(byteOrder)) r
H A Dskipscan5.test12 # This file implements tests of the "skip-scan" query strategy. In
14 # that uses the skip-scan approach.
67 # Test that range-query/skip-scan estimation works with text values.
120 # Test that range-query/skip-scan estimation works on columns that contain
H A Dcoveridxscan.test13 # for a full-table scan (under the theory that the index will be smaller
30 # covering index used for the scan, hence values are increasing
48 optimization_control db cover-idx-scan 0
H A Dfts3fault.test166 set scan(littleEndian) i*
167 set scan(bigEndian) I*
168 binary scan $blob $scan($::tcl_platform(byteOrder)) r
H A Dfts4aa.test75 set scan(littleEndian) i*
76 set scan(bigEndian) I*
77 binary scan $blob $scan($::tcl_platform(byteOrder)) r
H A Dfts3first.test32 set scan(littleEndian) i*
33 set scan(bigEndian) I*
34 binary scan $blob $scan($::tcl_platform(byteOrder)) r
H A Dcorrupt2.test185 binary scan $zCelloffset S iCelloffset
233 binary scan $zCelloffset S iCelloffset
238 binary scan $zCelloffset S iCelloffset
398 binary scan $zRightChild I iRightChild
416 binary scan $zCellOffset S iCellOffset
419 binary scan $zChild I iChild
437 binary scan $zRightChild I iRightChild
465 binary scan $zRightChild I iRightChild
H A Dminmax3.test59 # Linear scan.
88 # Linear scan of t1.
109 # Linear scan
125 # Linear scan
H A Dspeed2.test107 # a full table scan is required.
118 # table scan is required.
131 # a full table scan is required.
142 # table scan is required.
H A Dfts3query.test96 set scan(littleEndian) i*
97 set scan(bigEndian) I*
98 binary scan $blob $scan($::tcl_platform(byteOrder)) r
H A Denc.test29 binary scan $expect \c* expectvals
30 binary scan $got \c* gotvals
37 binary scan $utf16 \c* ints
/sqlite-3.40.0/ext/fts5/test/
H A Dfts5faultB.test26 set scan(littleEndian) i*
27 set scan(bigEndian) I*
28 binary scan $blob $scan($::tcl_platform(byteOrder)) r
H A Dfts5fault6.test160 set scan(littleEndian) i*
161 set scan(bigEndian) I*
162 binary scan $blob $scan($::tcl_platform(byteOrder)) r
H A Dfts5matchinfo.test22 set scan(littleEndian) i*
23 set scan(bigEndian) I*
24 binary scan $blob $scan($::tcl_platform(byteOrder)) r
284 # use the full-text index (i.e. lookup by rowid or full-table scan).
/sqlite-3.40.0/tool/
H A Dwarnings-clang.sh9 scan-build gcc -c -DHAVE_STDINT_H -DSQLITE_ENABLE_FTS4 -DSQLITE_ENABLE_RTREE \
12 scan-build gcc -c -I. -DSQLITE_ENABLE_STAT3 -DSQLITE_THREADSAFE=0 \
/sqlite-3.40.0/ext/repair/test/
H A Dcheckfreelist01.test37 binary scan $blob I* ints
44 binary scan $blob I* ints

12345