Lines Matching refs:nTerms
1912 int nTerms; /* Number of terms in the query */
3201 for(i = 0; i < q->nTerms; ++i){
3289 nTerm = pQuery->nTerms;
3336 if( p->q.nTerms==0 ) return;
3466 for(i=0; i<pCursor->q.nTerms; i++){
3670 ++q->nTerms;
3671 q->pTerms = sqlite3_realloc(q->pTerms, q->nTerms * sizeof(q->pTerms[0]));
3673 q->nTerms = 0;
3676 t = &q->pTerms[q->nTerms - 1];
3727 int firstIndex = pQuery->nTerms;
3750 if( !inPhrase && pQuery->nTerms>0 && nToken==2
3762 if( pQuery->nTerms>0 && nToken==1 && pSegment[iBegin]=='*' &&
3764 pQuery->pTerms[pQuery->nTerms-1].isPrefix = 1;
3771 pQuery->pTerms[pQuery->nTerms-1].isNot = 1;
3774 pQuery->pTerms[pQuery->nTerms-1].isPrefix = 1;
3776 pQuery->pTerms[pQuery->nTerms-1].iPhrase = nTerm;
3782 if( inPhrase && pQuery->nTerms>firstIndex ){
3783 pQuery->pTerms[firstIndex].nPhrase = pQuery->nTerms - firstIndex - 1;
3805 pQuery->nTerms = 0;
3876 if( pQuery->nTerms==0 ){
3884 for(i = 0; i<pQuery->nTerms; i=iNext){
3898 while( iNext<pQuery->nTerms && aTerm[iNext].isOr ){
3936 if( nNot==pQuery->nTerms ){
3942 for(i=0; i<pQuery->nTerms; i += aTerm[i].nPhrase + 1){
6762 int iTerm, nTerms, nResultBytes, iByte;
6770 nTerms = fts2HashCount(pTerms);
6771 assert( nTerms>0 );
6772 pData = sqlite3_malloc(nTerms*sizeof(TermData));
6778 assert( iTerm<nTerms );
6783 assert( iTerm==nTerms );
6785 assert( nResultBytes>0 ); /* nTerms>0, nResultsBytes must be, too. */
6792 if( nTerms>1 ) qsort(pData, nTerms, sizeof(*pData), termDataCmp);
6796 for(iTerm=0; iTerm<nTerms; ++iTerm){
6868 const int nTerms = fts2HashCount(&terms);
6869 if( nTerms>0 ){
