Lines Matching full:linear
6849 ** by a linear search of the global list. For small tables, the
6851 ** in the table, it is faster to do a linear search than to manage
11931 ** linear search is adequate. No need for a binary search. */
32741 ** on both a Bitvec object and on a linear array of bits obtained from malloc.
32742 ** Opcode 5 works on the linear array only, not on the Bitvec.
32746 ** At the conclusion of the test the linear array is compared
32759 /* Allocate the Bitvec to be tested and a linear array of
32805 /* Test to make sure the linear array exactly matches the
43790 /* If expensive assert() statements are available, do a linear search
51530 ** of the table is a linear scan through the file. That
59948 ** a linear sequence of operations. Each operation has an opcode
99792 ** Since the cost of a linear scan through table t2 is the same
99793 ** as the cost of a linear scan through table t1, a simple greedy
108535 #define FTS3_FULLSCAN_SEARCH 0 /* Linear scan of %_content table */
109278 ** 3. Linear scan of %_content table.
120495 ** and then a linear search of an R-Tree node. This should be
120843 ** Implementation of the linear variant of the PickNext() function from
120861 ** Implementation of the linear variant of the PickSeeds() function from
