Lines Matching defs:pendingTerms
2047 ** pendingTerms stores the data, and is only valid when nPendingData
2048 ** is >=0 (nPendingData<0 means pendingTerms has not been
2055 fts2Hash pendingTerms;
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.
4222 ** to pendingTerms.
4235 ** pendingTerms for old terms not in the new data, add insert doclists
4236 ** to pendingTerms for terms in the new data.
6202 /* If pendingTerms has data, free it. */
6206 for(e=fts2HashFirst(&v->pendingTerms); e; e=fts2HashNext(e)){
6209 fts2HashClear(&v->pendingTerms);
6215 /* If pendingTerms has data, flush it to a level-zero segment, and
6220 int rc = writeZeroSegment(v, &v->pendingTerms);
6227 /* If pendingTerms is "too big", or docid is out of order, flush it.
6228 ** Regardless, be certain that pendingTerms is initialized for use.
6242 fts2HashInit(&v->pendingTerms, FTS2_HASH_STRING, 1);
