Home
last modified time | relevance | path

Searched refs:terms (Results 1 – 25 of 75) sorted by relevance

123

/sqlite-3.40.0/test/
H A Dfts3aux1.test81 DROP TABLE terms;
108 } {/*SCAN terms VIRTUAL TABLE INDEX 1:*/}
111 } {/*SCAN terms VIRTUAL TABLE INDEX 0:*/}
374 INSERT INTO terms VALUES(1,2,3);
375 } {1 {table terms may not be modified}}
377 DELETE FROM terms
378 } {1 {table terms may not be modified}}
417 `--SCAN terms VIRTUAL TABLE INDEX 1:
427 `--SCAN terms VIRTUAL TABLE INDEX 1:
436 |--SCAN terms VIRTUAL TABLE INDEX 0:
[all …]
H A Dfts3aux2.test27 CREATE VIRTUAL TABLE terms USING fts4aux(t1);
35 SELECT * FROM terms;
39 SELECT * FROM terms WHERE languageid='';
43 SELECT * FROM terms WHERE languageid=-1;
55 SELECT * FROM terms WHERE languageid=NULL;
60 FROM terms WHERE col = '*' AND languageid=1;
67 FROM terms WHERE languageid=1;
77 FROM terms WHERE languageid=1 AND term='zero'
83 FROM terms WHERE languageid='1' AND term='two'
99 FROM terms WHERE col = '*' AND languageid=2;
[all …]
H A Dfts3rnd.test22 # terms. Terms are selected from a vocabulary of $G(nVocab) terms.
110 # Return a document consisting of $nWord arbitrarily selected terms
333 # the database for the set of documents containing each of these terms
394 # A NEAR query with terms as the arguments:
399 set terms [list [random_term] [random_term]]
400 set match [join $terms " NEAR "]
403 } [simple_near $terms 10]
406 # A 3-way NEAR query with terms as the arguments.
409 set terms [list [random_term] [random_term] [random_term]]
411 set match [join $terms " NEAR/$nNear "]
[all …]
H A Dfts3c.test27 # Utility function to check for the expected terms in the segment
29 proc check_terms {test level index terms} {
31 do_test $test.terms [list fts3_terms t1 $where] $terms
33 proc check_terms_all {test terms} {
34 do_test $test.terms [list fts3_terms t1 1] $terms
H A Dfts3prefix.test25 # as the terms index.
40 DROP TABLE IF EXISTS temp.terms;
42 CREATE TEMP TABLE terms AS SELECT * FROM fts3check1;
50 $db eval { SELECT term, docid, col, pos FROM temp.terms } a {
69 execsql { DROP TABLE temp.terms }
100 CREATE VIRTUAL TABLE terms USING fts4term(t1);
109 SELECT term FROM terms;
125 INSERT INTO t1 VALUES('input a term, or series of terms, perhaps');
129 INSERT INTO t1 VALUES('terms considering the operators and groupings the');
H A Dfts2p.test106 # Utility function to check for the expected terms in the segment
108 proc check_terms {test level index terms} {
113 do_test $test.terms {
117 } [list $terms]
119 proc check_terms_all {test terms} {
120 do_test $test.terms {
124 } [list $terms]
H A Dfts3cov.test112 # terms in the pending-hash table. Specifically, while creating doclist
144 # If too much data accumulates in the pending-terms hash table, it is
175 # by inserting insert a document with some fairly large terms into a
178 # Test this handling of large terms in three contexts:
180 # 1. When flushing the pending-terms table.
192 # Test when flushing pending-terms table.
277 # pending-terms table must be flushed each time a document with a docid
281 # pending-terms table is flushed for this reason as part of a DELETE
325 # the pending-terms table is non-empty. This case involves some extra
327 # also from the pending-terms table.
H A Dfts2q.test43 # Utility function to check for the expected terms in the segment
45 proc check_terms {test level index terms} {
50 do_test $test.terms {
54 } [list $terms]
56 proc check_terms_all {test terms} {
57 do_test $test.terms {
61 } [list $terms]
H A Dfts3d.test26 # Utility function to check for the expected terms in the segment
28 proc check_terms {test level index terms} {
30 do_test $test.terms [list fts3_terms t1 $where] $terms
32 proc check_terms_all {test terms} {
33 do_test $test.terms [list fts3_terms t1 1] $terms
H A Dfts3fault2.test25 CREATE VIRTUAL TABLE terms USING fts4aux(t1);
43 execsql "SELECT * FROM terms"
52 execsql "SELECT * FROM terms WHERE term>'a' AND TERM < 'd'"
61 execsql "SELECT * FROM terms WHERE term='c'"
H A Dfts3comp1.test90 CREATE VIRTUAL TABLE terms USING fts4aux(t1);
91 SELECT term, documents, occurrences FROM terms WHERE col = '*';
98 SELECT term, documents, occurrences FROM terms WHERE col = '*';
H A DrowvalueA.test62 } {1 {IN(...) element has 3 terms - expected 2}}
70 } {1 {IN(...) element has 2 terms - expected 3}}
H A Dfts3_common.tcl356 set terms [list]
367 lappend terms $zTerm $doclist
371 return $terms
H A Dcursorhint.test148 # If there are any equality terms used in the constraint, then all terms
H A Dsqllimits1.test630 } {1 {too many terms in GROUP BY clause}}
635 } {1 {too many terms in ORDER BY clause}}
676 } {1 {too many terms in ORDER BY clause}}
686 } {1 {too many terms in ORDER BY clause}}
691 # limit is enforced. The limit refers to the number of terms in
924 } {1 {too many terms in compound SELECT}}
H A Dselect7.test135 # Verify that an error occurs if you have too many terms on a
153 } {1 {too many terms in compound SELECT}}
H A Dfts3an.test152 # Build a big document with lots of unique terms.
188 # Test a boundary condition: More than 2^16 terms that match a searched for
H A Dselect1.test320 #} {1 {ORDER BY terms must not be non-integer constants}}
325 #} {1 {ORDER BY terms must not be non-integer constants}}
330 #} {1 {ORDER BY terms must not be non-integer constants}}
335 #} {1 {ORDER BY terms must not be non-integer constants}}
340 #} {1 {ORDER BY terms must not be non-integer constants}}
345 #} {1 {ORDER BY terms must not be non-integer constants}}
H A Dfts2h.test7 # here is testing correct handling of excessively long terms.
H A Dorderby4.test14 # unique indices when only some prefix of the terms in the key are
H A DselectG.test13 # VALUE terms works and does not hit the SQLITE_LIMIT_COMPOUND_SELECT limit.
/sqlite-3.40.0/ext/fts1/
H A Dfulltext.c1311 HashInit(terms, HASH_STRING, 1); in build_terms()
1324 p = HashFind(terms, pToken, nTokenBytes); in build_terms()
1328 HashInsert(terms, pToken, nTokenBytes, p); in build_terms()
1389 Hash terms; /* maps term string -> PosList */ in index_insert() local
1401 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_insert()
1407 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_insert()
1411 HashClear(&terms); in index_insert()
1441 Hash terms; in index_delete() local
1451 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_delete()
1455 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_delete()
[all …]
H A Dfts1.c2995 p = fts1HashFind(terms, pToken, nTokenBytes); in buildTerms()
2999 fts1HashInsert(terms, pToken, nTokenBytes, p); in buildTerms()
3088 int rc = buildTerms(v, terms, iRowid, zText, i); in insertTerms()
3154 fts1Hash terms; /* maps term string -> PosList */ in fulltextUpdate() local
3160 fts1HashInit(&terms, FTS1_HASH_STRING, 1); in fulltextUpdate()
3163 rc = index_delete(v, sqlite3_value_int64(ppArg[0]), &terms); in fulltextUpdate()
3177 rc = index_update(v, rowid, &ppArg[2], &terms); in fulltextUpdate()
3186 rc = index_insert(v, ppArg[1], &ppArg[2], pRowid, &terms); in fulltextUpdate()
3191 for(e=fts1HashFirst(&terms); e; e=fts1HashNext(e)){ in fulltextUpdate()
3199 for(e=fts1HashFirst(&terms); e; e=fts1HashNext(e)){ in fulltextUpdate()
[all …]
/sqlite-3.40.0/ext/fts3/
H A DREADME.syntax32 list of terms (words) separated by white-space characters. To match a
34 terms. For example, the following query:
64 not matter which of the two terms occurs first in the document, only that
93 term 'sqlite' and at least one of the terms 'fantastic' or 'impressive',
100 it. In this case, the token matches all terms that begin with the characters
/sqlite-3.40.0/autoconf/
H A DINSTALL160 default for these options is expressed in terms of `${prefix}', so that
173 directory configuration variables that were expressed in terms of
175 but not in terms of `${prefix}', must each be overridden at install
189 when some directory options were not specified in terms of `${prefix}'

123