Home
last modified time | relevance | path

Searched refs:loop (Results 1 – 25 of 66) sorted by relevance

123

/sqlite-3.40.0/test/
H A DwhereF.test20 # if it is the outer loop, and a cost if it is the inner loop. As follows:
22 # t1(outer) - cost of scanning t1 as the outer loop.
23 # t1(inner) - cost of scanning t1 as the inner loop.
24 # t2(outer) - cost of scanning t2 as the outer loop.
25 # t2(inner) - cost of scanning t2 as the inner loop.
39 # In other words, when the best overall query plan has t2 as the outer loop,
40 # but when the outer loop is considered independent of the inner, t1 is the
130 # outer loop. The inner loop, on "t2", is an OR optimization. One pass
141 # the loop through the f2=$1 range of the t2(f2) index.
H A Dfunc5.test36 # evaluation loop whereas non-deterministic functions do not. counter1()
37 # is marked as non-deterministic and so is not factored out of the loop,
40 # out of the loop. counter2() has the same implementation as counter1(),
42 # only invoked once outside of the loop, it appears to return the same
H A Dwalcrash2.test34 # table falls into an infinite loop.
37 # only goes into an infinite loop if SQLite is compiled without SQLITE_DEBUG
39 # assert() before entering the infinite loop.
52 # infinite loop.
H A Dlimit2.test13 # and in particular, the optimizations in the inner loop that cause an
14 # early exit of the inner loop when the LIMIT is reached and the inner
15 # loop is emitting rows in ORDER BY order.
84 # Make sure the optimization is not applied if the inner loop can only
113 # Make sure the SELECT loop is ordered correctly for the direction of
171 # Infinite loop due to the ORDER BY LIMIT optimization.
H A Dcursorhint.test59 # Verify that when t1 is in the outer loop and t2 is in the inner loop,
H A Dsavepoint2.test131 # top of the for{} loop (everything having been rolled back by the
134 # of the for{} loop works on a different dataset.
H A Dwhere3.test228 # If the outer loop must be a full table scan, do not let ANALYZE trick
229 # the planner into use a table for the outer loop that might be indexable
230 # if held until an inner loop.
265 # the fewest number of output rows as the outer loop.
H A Dmem5.test49 # previously this was causing the memsys5Log() func to infinitely loop.
H A Dbigsort.test20 # loop if the product was also an integer multiple of 2^32, or
H A Dwalthread.test240 # transaction in a loop as fast as possible.
242 # There is also a single checkpointer thread. It runs the following loop:
313 # in a loop:
H A Dbackup_ioerr.test179 # a few things then skip to the next iteration of the loop.
242 # it is reported correctly and skip to the next iteration of the loop.
H A Din2.test41 # Each iteration of this loop builds a slightly different b-tree to
H A DcorruptJ.test44 # table. The clearDatabasePage() routine should not loop.
H A Dsort5.test78 # Each iteration of the following loop attempts to sort 10001 records
H A Dtkt2820.test81 # The INSERT statement within the loop should fail on a
H A Dmemdb.test174 # loop if that is not available in this build.
238 # loop if that is not available in this build.
H A Dcorrupt3.test69 # Make the overflow chain loop back on itself. See if the
H A DwhereJ.test332 # Ensure that the sorting cost does not swamp the loop costs and cause
333 # distinctions between individual loop costs to get lost, and hence for
617 # The following query should do a full table scan of cx in the outer loop.
618 # It is not correct to search table px using indx p_pt in the outer loop
619 # with cx in the middle loop. Test case from Bloomberg on 2014-09-05.
H A DmallocC.test52 # execute the SQL, then this test is finished. Break out of the loop.
H A Dlock6.test49 # Write the main loop for the child testfixture processes into file
H A Din6.test13 # than the left-most key is able to abort the IN-operator loop early
/sqlite-3.40.0/ext/rbu/
H A Drburesume.test39 # Each iteration of the following loop:
46 # The loop runs until $n is large enough that step (2) vacuums the entire
76 # Each iteration of this loop:
84 # The loop runs until $n is large enough that step (2) vacuums the entire
127 # Each iteration of this loop:
136 # The loop runs until $n is large enough that step (3) vacuums the entire
200 # Each iteration of this loop:
209 # The loop runs until $n is large enough that step (3) applies the entire
/sqlite-3.40.0/ext/rtree/
H A DrtreeC.test199 # First test a query with no ANALYZE data at all. The outer loop is
211 # contains very few rows. This causes it to move "rt" to the outer loop.
227 # Delete the ANALYZE data. "t1" should be the outer loop again.
243 # Table "t1" should remain the outer loop.
/sqlite-3.40.0/tool/
H A Dbuild-all-msvc.bat408 REM NOTE: This is the outer loop. There should be exactly one iteration per
420 REM NOTE: This is the second loop. There should be exactly one iteration.
421 REM This loop is necessary because the PlatformName environment
423 REM commands contained in the inner loop. If these commands were
424 REM directly contained in the outer loop, the PlatformName environment
469 REM NOTE: This is the inner loop. There are normally two iterations, one
610 REM iterations of this loop and/or previous runs of this batch
/sqlite-3.40.0/
H A Dltmain.sh6300 loop=$revision
6301 while test "$loop" -ne 0; do
6302 func_arith $revision - $loop
6304 func_arith $loop - 1
6305 loop=$func_arith_result
6327 loop=$age
6328 while test "$loop" -ne 0; do
6329 func_arith $current - $loop
6331 func_arith $loop - 1
6332 loop=$func_arith_result

123