Searched refs:search (Results 1 – 25 of 62) sorted by relevance
123
140 } {one search 2}289 } {A B search 6}292 } {3 7 search 4}296 } {A C search 6}299 } {3 11 search 5}302 } {1 3 search 4}306 } {1 9 search 6}316 } {5 9 search 3}319 } {8 12 search 2}322 } {12 8 search 2}[all …]
131 # Should get the same search results from FTS3149 # Should get the same search results when the page size is very large170 # Should get the same search results when an authorizer prevents
46 # Do an SQL statement. Append the search count to the end of the result.55 # and Next operators in the VDBE. By verifing that the search count is
14 # AND term that is beneficial to the search. Examples:
21 # Construct a full-text search table containing keywords which are the
125 # Do an SQL statement. Append the search count to the end of the result.
15 # NATURAL JOIN processing needs to search all tables to the left
50 # search any at all.
53 # Construct a full-text search table containing five keywords:
773 Tcl_HashSearch search; in test_memdebug_log_clear() local776 pEntry=Tcl_FirstHashEntry(&aMallocLog, &search); in test_memdebug_log_clear()778 pEntry=Tcl_NextHashEntry(&search) in test_memdebug_log_clear()826 Tcl_HashSearch search; in test_memdebug_log() local833 pEntry=Tcl_FirstHashEntry(&aMallocLog, &search); in test_memdebug_log()835 pEntry=Tcl_NextHashEntry(&search) in test_memdebug_log()
141 !window.location.search ) return false;142 else str = (''+window.location.search).substring(1);
1 This folder contains source code to the first full-text search
1 This folder contains source code to the second full-text search
75 # Exclude odd rowids on a depth-first search80 # Exclude odd rowids on a breadth-first search.
302 # depth-first search of the r-tree.304 # For a breadth first search, final test case would return "B L" only.
254 return new Worker(theJs + self.location.search);
364 importScripts('fiddle-module.js'+self.location.search);