Searched refs:pendingTerms (Results 1 - 5 of 5) sorted by relevance
/external/chromium_org/third_party/sqlite/src/ext/fts3/ |
H A D | fts3Int.h | 35 ** Fts3Table.pendingTerms hash table. Normally, the hash table is 153 Fts3Hash pendingTerms; member in struct:Fts3Table
|
H A D | fts3_write.c | 567 pList = (PendingList *)fts3HashFind(&p->pendingTerms, zToken, nToken); 572 if( pList==fts3HashInsert(&p->pendingTerms, zToken, nToken, pList) ){ 576 assert( 0==fts3HashFind(&p->pendingTerms, zToken, nToken) ); 616 for(pElem=fts3HashFirst(&p->pendingTerms); pElem; pElem=fts3HashNext(pElem)){ 619 fts3HashClear(&p->pendingTerms); 626 ** pendingTerms hash table. 1231 ** a subset of the terms stored in the Fts3Table.pendingTerms array. 1249 for(pE=fts3HashFirst(&p->pendingTerms); pE; pE=fts3HashNext(pE)){ 1279 pE = fts3HashFindElem(&p->pendingTerms, zTerm, nTerm); 2284 ** Flush the contents of pendingTerms t [all...] |
H A D | fts3.c | 954 fts3HashInit(&p->pendingTerms, FTS3_HASH_STRING, 1); 2132 assert( isScan==0 || fts3HashCount(&p->pendingTerms)==0 );
|
/external/chromium_org/third_party/sqlite/src/ext/fts2/ |
H A D | fts2.c | 2047 ** pendingTerms stores the data, and is only valid when nPendingData 2048 ** is >=0 (nPendingData<0 means pendingTerms has not been 2055 fts2Hash pendingTerms; member in struct:fulltext_vtab 3857 /* TODO(shess) Instead of flushing pendingTerms, we could query for 4106 /* Add all terms in [zText] to pendingTerms table. If [iColumn] > 0, 4137 p = fts2HashFind(&v->pendingTerms, pToken, nTokenBytes); 4141 fts2HashInsert(&v->pendingTerms, pToken, nTokenBytes, p); 4167 /* Add doclists for all terms in [pValues] to pendingTerms table. */ 4180 ** pendingTerms. 4205 ** new row. Add doclists for terms to pendingTerms [all...] |
/external/chromium_org/third_party/sqlite/amalgamation/ |
H A D | sqlite3.c | 113133 Fts3Hash pendingTerms; member in struct:Fts3Table [all...] |
Completed in 2436 milliseconds