Lines Matching refs:nTerm
128372 int nTerm; local
128384 nTerm = 1;
128386 nTerm = pList->nExpr;
128387 for(i=0; i<nTerm; i++){
128401 if( nTerm==1
163646 int nTerm; /* Number of terms */ member
163984 int nTerm, /* Number of terms */ argument
163991 assert( nTerm>=1 );
163994 if( nTerm>1 ) sqlite3_str_append(pStr, "(", 1);
163995 for(i=0; i<nTerm; i++){
163999 if( nTerm>1 ) sqlite3_str_append(pStr, ")", 1);
164003 if( nTerm>1 ) sqlite3_str_append(pStr, "(", 1);
164004 for(i=0; i<nTerm; i++){
164008 if( nTerm>1 ) sqlite3_str_append(pStr, ")", 1);
165304 for(i=0, pTerm=pWC->a; i<pWC->nTerm; i++, pTerm++){
166316 if( pWC->nTerm>1 ){
166318 for(iTerm=0; iTerm<pWC->nTerm; iTerm++){
166347 for(ii=0; ii<pOrWc->nTerm; ii++){
166385 int iSet = ((ii==pOrWc->nTerm-1)?-1:ii);
166555 for(pTerm=pWC->a, j=pWC->nTerm; j>0; j--, pTerm++){
166614 pWC->nTerm-j, pTerm, iLoop));
166618 sqlite3WhereTermPrint(pTerm, pWC->nTerm-j);
166648 sqlite3WhereTermPrint(pTerm, pWC->nTerm-j);
166828 for(k=0; k<pWC->nTerm; k++){
166958 if( pWC->nTerm>=pWC->nSlot ){
166969 memcpy(pWC->a, pOld, sizeof(pWC->a[0])*pWC->nTerm);
166972 pTerm = &pWC->a[idx = pWC->nTerm++];
166973 if( (wtFlags & TERM_VIRTUAL)==0 ) pWC->nBase = pWC->nTerm;
167427 if( N<pTerm->u.pAndInfo->wc.nTerm ){
167619 assert( pOrWc->nTerm>=2 );
167626 for(i=pOrWc->nTerm-1, pOrTerm=pOrWc->a; i>=0 && indexable; i--, pOrTerm++){
167648 for(j=0, pAndTerm=pAndWC->a; j<pAndWC->nTerm; j++, pAndTerm++){
167691 if( indexable && pOrWc->nTerm==2 ){
167739 for(i=pOrWc->nTerm-1; i>=0; i--, pOrTerm++){
167814 for(i=pOrWc->nTerm-1, pOrTerm=pOrWc->a; i>=0; i--, pOrTerm++){
168039 assert( pWC->nTerm > idxTerm );
168579 for(ii=0; ii<pWC->nTerm; ii++){
168645 pWC->nTerm = 0;
168658 assert( pWC->nTerm>=pWC->nBase );
168659 if( pWC->nTerm>0 ){
168661 WhereTerm *aLast = &pWC->a[pWC->nTerm-1];
168665 for(i=pWC->nBase; i<pWC->nTerm; i++){
168784 for(i=pWC->nTerm-1; i>=0; i--){
169211 for(pTerm=pWC->a+k; k<pWC->nTerm; k++, pTerm++){
169877 pWCEnd = &pWC->a[pWC->nTerm];
170180 pWCEnd = &pWInfo->sWC.a[pWInfo->sWC.nTerm];
170246 if( iTerm<p->nTerm ) return &p->a[iTerm];
170247 iTerm -= p->nTerm;
170265 int nTerm; local
170289 for(p=pWC, nTerm=0; p; p=p->pOuter){
170290 for(i=0, pTerm=p->a; i<p->nTerm; i++, pTerm++){
170310 nTerm++;
170376 + (sizeof(*pIdxCons) + sizeof(*pUsage))*nTerm
170378 + SZ_HIDDENINDEXINFO(nTerm) );
170384 pIdxCons = (struct sqlite3_index_constraint*)&pHidden->aRhs[nTerm];
170385 pIdxOrderBy = (struct sqlite3_index_orderby*)&pIdxCons[nTerm];
170408 int nLast = i+p->nTerm;;
170454 assert( j==nTerm );
171271 for(i=0; i<pWC->nTerm; i++){
172288 assert( (pTop-(pTerm->pWC->a))<pTerm->pWC->nTerm );
172560 for(i=0, pTerm=pWC->a; i<pWC->nTerm; i++, pTerm++){
172922 WhereTerm *pWCEnd = pWC->a + pWC->nTerm;
173105 for(ii=0; ii<pWC2->nTerm; ii++){
173290 testcase( j==pWC->nTerm-1 );
173672 pWCEnd = pWC->a + pWC->nTerm;
173686 WhereTerm * const pOrWCEnd = &pOrWC->a[pOrWC->nTerm];
173702 tempWC.nTerm = 1;
173712 (int)(pOrTerm-pOrWC->a), pTerm, sSubBuild.pWC->nTerm));
175411 pEnd = pWInfo->sWC.a + pWInfo->sWC.nTerm;
194097 int nTerm; member
194120 int nTerm; /* Size of zTerm in bytes */ member
195816 int nTerm, /* Size of term zTerm in bytes */ argument
195896 cmp = memcmp(zTerm, zBuffer, (nBuffer>nTerm ? nTerm : nBuffer));
195897 if( piFirst && (cmp<0 || (cmp==0 && nBuffer>nTerm)) ){
195943 int nTerm, /* Size of term zTerm in bytes */ argument
195958 rc = fts3ScanInteriorNode(zTerm, nTerm, zNode, nNode, piLeaf, piLeaf2);
195969 rc = fts3SelectLeaf(p, zTerm, nTerm, zBlob, nBlob, piLeaf, 0);
195985 rc = fts3SelectLeaf(p, zTerm, nTerm, zBlob, nBlob, piLeaf, piLeaf2);
196913 int nTerm, /* Size of zTerm in bytes */ argument
196930 rc = sqlite3Fts3SegReaderPending(p, iIndex, zTerm, nTerm, isPrefix||isScan, &pSeg);
196955 rc = fts3SelectLeaf(p, zTerm, nTerm, zRoot, nRoot, &iStartBlock, pi);
196987 int nTerm, /* Size of zTerm in bytes */ argument
197003 p, iLangid, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr
197017 int nTerm, /* Number of bytes in zTerm */ argument
197021 iLangid, 0, FTS3_SEGCURSOR_ALL, zTerm, nTerm, 0, 0,pCsr
197041 int nTerm, /* Size of zTerm in bytes */ argument
197056 if( p->aIndex[i].nPrefix==nTerm ){
197059 i, FTS3_SEGCURSOR_ALL, zTerm, nTerm, 0, 0, pSegcsr
197066 if( p->aIndex[i].nPrefix==nTerm+1 ){
197069 i, FTS3_SEGCURSOR_ALL, zTerm, nTerm, 1, 0, pSegcsr
197073 p, pCsr->iLangid, zTerm, nTerm, pSegcsr
197082 0, FTS3_SEGCURSOR_ALL, zTerm, nTerm, isPrefix, 0, pSegcsr
197125 filter.nTerm = pTok->n;
200439 int n = (pCsr->nStop<pCsr->csr.nTerm) ? pCsr->nStop : pCsr->csr.nTerm;
200441 if( mc<0 || (mc==0 && pCsr->csr.nTerm>pCsr->nStop) ){
200575 pCsr->filter.nTerm = (int)strlen(pCsr->filter.zTerm);
200598 pCsr->filter.zTerm, pCsr->filter.nTerm, 0, isScan, &pCsr->csr
200629 sqlite3_result_text(pCtx, p->csr.zTerm, p->csr.nTerm, SQLITE_TRANSIENT);
204458 int nTerm; /* Number of bytes in current term */ member
204489 int nTerm; /* Number of bytes in zTerm */ member
204522 int nTerm; /* Number of bytes in zTerm */ member
205660 int nTerm = fts3HashKeysize(pElem); local
205661 if( (nTerm+1)>pReader->nTermAlloc ){
205663 pReader->zTerm = (char*)sqlite3_malloc64(((i64)nTerm+1)*2);
205665 pReader->nTermAlloc = (nTerm+1)*2;
205667 memcpy(pReader->zTerm, fts3HashKey(pElem), nTerm);
205668 pReader->zTerm[nTerm] = '\0';
205669 pReader->nTerm = nTerm;
205717 || nPrefix>pReader->nTerm
205739 pReader->nTerm = nPrefix+nSuffix;
206028 int nTerm, /* Size of buffer zTerm */ argument
206046 if( nTerm==0 || (nKey>=nTerm && 0==memcmp(zKey, zTerm, nTerm)) ){
206081 pE = fts3HashFindElem(pHash, zTerm, nTerm);
206124 int rc2 = pLhs->nTerm - pRhs->nTerm;
206126 rc = memcmp(pLhs->zTerm, pRhs->zTerm, pLhs->nTerm);
206128 rc = memcmp(pLhs->zTerm, pRhs->zTerm, pRhs->nTerm);
206190 int nTerm /* Size of term zTerm in bytes */ argument
206194 if( pSeg->nTerm>nTerm ){
206195 res = memcmp(pSeg->zTerm, zTerm, nTerm);
206197 res = memcmp(pSeg->zTerm, zTerm, pSeg->nTerm);
206200 res = pSeg->nTerm-nTerm;
206349 int nTerm /* Size of term in bytes */ argument
206364 nPrefix = fts3PrefixCompress(pTree->zTerm, pTree->nTerm, zTerm, nTerm);
206365 nSuffix = nTerm-nPrefix;
206401 if( pTree->nMalloc<nTerm ){
206402 char *zNew = sqlite3_realloc64(pTree->zMalloc, (i64)nTerm*2);
206406 pTree->nMalloc = nTerm*2;
206410 memcpy(pTree->zTerm, zTerm, nTerm);
206411 pTree->nTerm = nTerm;
206414 pTree->nTerm = nTerm;
206438 rc = fts3NodeAddTerm(p, &pParent, isCopyTerm, zTerm, nTerm);
206450 rc = fts3NodeAddTerm(p, &pNew, isCopyTerm, zTerm, nTerm);
206560 int nTerm, /* Size of term in bytes */ argument
206597 nPrefix = fts3PrefixCompress(pWriter->zTerm, pWriter->nTerm, zTerm, nTerm);
206598 nSuffix = nTerm-nPrefix;
206633 assert( nPrefix<nTerm );
206638 pWriter->nTerm = 0;
206641 nSuffix = nTerm;
206643 sqlite3Fts3VarintLen(nTerm) + /* varint containing suffix size */
206644 nTerm + /* Term suffix */
206680 if( nTerm>pWriter->nMalloc ){
206681 char *zNew = sqlite3_realloc64(pWriter->zMalloc, (i64)nTerm*2);
206685 pWriter->nMalloc = nTerm*2;
206690 assert( nTerm>0 );
206691 memcpy(pWriter->zTerm, zTerm, nTerm);
206695 pWriter->nTerm = nTerm;
207078 int nTerm /* Length of zTerm in bytes */ argument
207095 }while( zTerm && (res = fts3SegReaderTermCmp(pSeg, zTerm, nTerm))<0 );
207112 return fts3SegReaderStart(p, pCsr, pFilter->zTerm, pFilter->nTerm);
207120 int nTerm /* Number of bytes in zTerm */ argument
207130 assert( zTerm && nTerm>0 );
207133 rc = fts3SegReaderStart(p, pCsr, zTerm, nTerm);
207139 if( !pSeg->aNode || fts3SegReaderTermCmp(pSeg, zTerm, nTerm) ){
207174 assert( pCsr->nTerm==0 );
207248 pCsr->nTerm = apSegment[0]->nTerm;
207259 if( pCsr->nTerm<pFilter->nTerm
207260 || (!isPrefix && pCsr->nTerm>pFilter->nTerm)
207261 || memcmp(pCsr->zTerm, pFilter->zTerm, pFilter->nTerm)
207270 && apSegment[nMerge]->nTerm==pCsr->nTerm
207271 && 0==memcmp(pCsr->zTerm, apSegment[nMerge]->zTerm, pCsr->nTerm)
207615 csr.zTerm, csr.nTerm, csr.aDoclist, csr.nDoclist);
208189 int nTerm /* Bytes at zTerm */ argument
208194 assert( nTerm>0 );
208207 nPrefix = fts3PrefixCompress(pNode->key.a, pNode->key.n, zTerm, nTerm);
208208 nSuffix = nTerm - nPrefix;
208227 blobGrowBuffer(&pNode->key, nTerm, &rc);
208234 assert( nPrefix+nSuffix<=nTerm );
208239 memcpy(pNode->key.a, zTerm, nTerm);
208240 pNode->key.n = nTerm;
208293 int nTerm, /* Size of zTerm in bytes */ argument
208307 blobGrowBuffer(pPrev, nTerm, &rc);
208312 nPrefix = fts3PrefixCompress(pPrev->a, pPrev->n, zTerm, nTerm);
208313 nSuffix = nTerm - nPrefix;
208315 memcpy(pPrev->a, zTerm, nTerm);
208316 pPrev->n = nTerm;
208348 int nTerm = pCsr->nTerm; local
208358 nPrefix = fts3PrefixCompress(pLeaf->key.a, pLeaf->key.n, zTerm, nTerm);
208359 nSuffix = nTerm - nPrefix;
208398 nSuffix = nTerm;
208412 &pLeaf->block, &pLeaf->key, zTerm, nTerm, aDoclist, nDoclist
208949 int nTerm, /* Size of zTerm in bytes */ argument
208971 int res = fts3TermCmp(reader.term.a, reader.term.n, zTerm, nTerm);
209007 int nTerm /* Number of bytes in buffer zTerm */ argument
209026 rc = fts3TruncateNode(aRoot, nRoot, &root, zTerm, nTerm, &iBlock);
209039 rc = fts3TruncateNode(aBlock, nBlock, &block, zTerm, nTerm, &iBlock);
209122 int nTerm = pSeg->nTerm; local
209123 rc = fts3TruncateSegment(p, iAbsLevel, pSeg->iIdx, zTerm, nTerm);
209369 int nKey = pCsr->nTerm;
209516 int nTerm, /* Size of zTerm in bytes */ argument
209530 for(i=0; i<nTerm; i++) ret += (ret<<3) + zTerm[i];
209599 csr.zTerm, csr.nTerm, iLangid, iIndex, iDocid,
211727 int nTerm; /* Number of tokens in phrase */ local
211735 nTerm = pExpr->pPhrase->nToken;
211741 for(iTerm=0; iTerm<nTerm; iTerm++){
211743 pT->iOff = nTerm-iTerm-1;
242548 int nTerm
242789 const char *pTerm, int nTerm, /* Query term */
242796 const char *pTerm, int nTerm /* Query prefix */
245736 int nTerm; member
245754 const char *pTerm, int nTerm, argument
245768 for(i=nTerm-1; i>=0; i--){
245776 && pEntry->nTerm==nTerm
245777 && memcmp(pEntry->pTerm, pTerm, nTerm)==0
245785 pEntry = sqlite3Fts5MallocZero(&rc, sizeof(Fts5TermsetEntry) + nTerm);
245788 pEntry->nTerm = nTerm;
245790 memcpy(pEntry->pTerm, pTerm, nTerm);
247065 int nTerm; /* Number of entries in aTerm[] */ member
247561 if( pPhrase->nTerm>ArraySize(aStatic) ){
247562 sqlite3_int64 nByte = sizeof(Fts5PoslistReader) * pPhrase->nTerm;
247566 memset(aIter, 0, sizeof(Fts5PoslistReader) * pPhrase->nTerm);
247569 for(i=0; i<pPhrase->nTerm; i++){
247596 for(i=0; i<pPhrase->nTerm; i++){
247615 for(i=0; i<pPhrase->nTerm; i++){
247622 for(i=0; i<pPhrase->nTerm; i++){
247734 iMin = iMax - pNear->apPhrase[i]->nTerm - pNear->nNear;
247867 if( pPhrase->nTerm>1 || pPhrase->aTerm[0].pSynonym
247907 if( pPhrase->nTerm==0 ){
247912 for(j=0; j<pPhrase->nTerm; j++){
248048 || pNear->apPhrase[0]->nTerm>1
248067 for(j=0; j<pPhrase->nTerm; j++){
248182 assert( pNode->pNear->nPhrase==1 && pPhrase->nTerm==1 );
248566 for(i=0; i<pPhrase->nTerm; i++){
248589 if( pPhrase && pPhrase->nTerm ){
248645 if( pPhrase->nTerm==0 ){
248650 }else if( pLast->nTerm==0 ){
248691 if( pPhrase && pPhrase->nTerm>0 && (tflags & FTS5_TOKEN_COLOCATED) ){
248705 pSyn->pSynonym = pPhrase->aTerm[pPhrase->nTerm-1].pSynonym;
248706 pPhrase->aTerm[pPhrase->nTerm-1].pSynonym = pSyn;
248710 if( pPhrase==0 || (pPhrase->nTerm % SZALLOC)==0 ){
248712 int nNew = SZALLOC + (pPhrase ? pPhrase->nTerm : 0);
248722 pNew->nTerm = nNew - SZALLOC;
248727 pTerm = &pPhrase->aTerm[pPhrase->nTerm++];
248829 }else if( sCtx.pPhrase->nTerm ){
248830 sCtx.pPhrase->aTerm[sCtx.pPhrase->nTerm-1].bPrefix = (u8)bPrefix;
248884 if( pOrig->nTerm ){
248887 for(i=0; rc==SQLITE_OK && i<pOrig->nTerm; i++){
248916 if( pOrig->nTerm==1
249191 if( pNear->nPhrase==1 && pNear->apPhrase[0]->nTerm==1
249253 int nTerm = pNear->apPhrase[0]->nTerm; local
249261 nByte = SZ_FTS5EXPRNODE(nTerm+1);
249265 pRet->nChild = nTerm;
249269 for(ii=0; ii<nTerm; ii++){
249280 pPhrase->nTerm = 1;
249328 && pNear->apPhrase[0]->nTerm>1
249351 if( pNear->apPhrase[iPhrase]->nTerm==0 ){
249360 || pPhrase->nTerm>1
249361 || (pPhrase->nTerm>0 && pPhrase->aTerm[0].bFirst)
249562 for(iTerm=0; zRet && iTerm<pPhrase->nTerm; iTerm++){
249641 for(iTerm=0; iTerm<pPhrase->nTerm; iTerm++){
249891 return pExpr->apExprPhrase[iPhrase]->nTerm;
249936 assert( pExpr->apExprPhrase[i]->nTerm<=1 );
250168 if( iToken<0 || iToken>=pPhrase->nTerm ){
250198 if( iToken<0 || iToken>=pPhrase->nTerm ){
250676 const char *pTerm, int nTerm, /* Query prefix, if any */ argument
250694 || (pIter->nKey>=nTerm && 0==memcmp(fts5EntryKey(pIter), pTerm, nTerm))
250723 const char *pTerm, int nTerm, /* Query term */ argument
250727 unsigned int iHash = fts5HashKey(pHash->nSlot, (const u8*)pTerm, nTerm);
250733 if( nTerm==p->nKey && memcmp(zKey, pTerm, nTerm)==0 ) break;
250737 int nHashPre = sizeof(Fts5HashEntry) + nTerm;
250759 const char *pTerm, int nTerm /* Query prefix */ argument
250761 return fts5HashEntrySort(p, pTerm, nTerm, &p->pScan);
250805 int nTerm = p->nKey; local
250808 *pnTerm = nTerm;
250809 *ppDoclist = (const u8*)&zKey[nTerm];
250810 *pnDoclist = p->nData - (sizeof(Fts5HashEntry) + nTerm);
253073 int nTerm = 0; local
253076 sqlite3Fts5HashScanEntry(p->pHash, &zTerm, &nTerm, &pList, &nList);
253082 sqlite3Fts5BufferSet(&p->rc,&pIter->term, nTerm, (u8*)zTerm);
253148 int nTerm = 0; local
253153 sqlite3Fts5HashScanEntry(p->pHash, &zTerm, &nTerm, &pList, &nList);
253163 sqlite3Fts5BufferSet(&p->rc, &pIter->term, nTerm, (u8*)zTerm);
253367 const u8 *pTerm, int nTerm /* Term to search for */ argument
253406 nCmp = (u32)MIN(nNew, nTerm-nMatch);
253412 if( (u32)nTerm==nMatch ){
253514 const u8 *pTerm, int nTerm, /* Term to seek to */ argument
253525 assert( pTerm && nTerm );
253534 sqlite3_bind_blob(pIdxSelect, 2, pTerm, nTerm, SQLITE_STATIC);
253552 fts5LeafSeek(p, bGe, pIter, pTerm, nTerm);
253585 || fts5BufferCompareBlob(&pIter->term, pTerm, nTerm)==0 /* 3 */
253586 || (bGe && fts5BufferCompareBlob(&pIter->term, pTerm, nTerm)>0) /* 4 */
253614 const char *pTerm, int nTerm, argument
253626 sqlite3_bind_blob(pSel, 2, pTerm, nTerm, SQLITE_STATIC);
253658 fts5BufferCompareBlob(&pIter->term, (const u8*)pTerm, nTerm)>0
253673 const u8 *pTerm, int nTerm, /* Term to seek to */ argument
253688 p->rc = sqlite3Fts5HashScanInit(p->pHash, (const char*)pTerm, nTerm);
253706 (const char*)pTerm, nTerm, (void**)&pLeaf, &nList
253712 n = nTerm;
254762 const u8 *pTerm, int nTerm, /* Term to seek to (or NULL/0) */ argument
254773 assert( (pTerm==0 && nTerm==0) || iLevel<0 );
254804 fts5SegIterHashInit(p, pTerm, nTerm, flags, pIter);
254813 fts5SegIterSeekInit(p, pTerm, nTerm, flags, pSeg, pIter);
255131 int nTerm, const u8 *pTerm /* First term on new page */ argument
255135 fts5BufferSet(&p->rc, &pWriter->btterm, nTerm, pTerm);
255283 int nTerm, const u8 *pTerm argument
255288 int nMin = MIN(pPage->term.n, nTerm);
255295 if( (pPage->buf.n + pPgidx->n + nTerm + 2)>=p->pConfig->pgsz ){
255300 fts5BufferGrow(&p->rc, &pPage->buf, nTerm+FTS5_DATA_PADDING);
255329 int n = nTerm;
255344 fts5BufferAppendVarint(&p->rc, &pPage->buf, nTerm - nPrefix);
255345 fts5BufferAppendBlob(&p->rc, &pPage->buf, nTerm - nPrefix, &pTerm[nPrefix]);
255348 fts5BufferSet(&p->rc, &pPage->term, nTerm, pTerm);
255658 int nTerm; local
255661 pTerm = fts5MultiIterTerm(pIter, &nTerm);
255662 if( nTerm!=term.n || fts5Memcmp(pTerm, term.p, nTerm) ){
255666 fts5BufferSet(&p->rc, &term, nTerm, pTerm);
255675 fts5WriteAppendTerm(p, &writer, nTerm, pTerm);
256368 int nTerm, argument
256392 fts5MultiIterNew(p, pStruct, f, 0, (const u8*)zTerm, nTerm, -1, 0, &pIter);
256459 int nTerm; /* Size of zTerm in bytes */ local
256464 sqlite3Fts5HashScanEntry(pHash, &zTerm, &nTerm, &pDoclist, &nDoclist);
256466 fts5WriteAppendTerm(p, &writer, nTerm, (const u8*)zTerm);
256494 && !fts5FlushSecureDelete(p, pStruct, zTerm, nTerm, iRowid)
256505 && !fts5FlushSecureDelete(p, pStruct, zTerm, nTerm, iRowid)
256515 fts5WriteAppendTerm(p, &writer, nTerm, (const u8*)zTerm);
258999 int nTerm argument
259006 for(i=0; i<nTerm; i++) ret += (ret<<3) + pTerm[i];
259154 int nTerm = pPrev->n-1; /* Size of zTerm in bytes */ local
259162 rc = fts5QueryCksum(p, iIdx, zTerm, nTerm, flags, &ck1);
259165 rc = fts5QueryCksum(p, iIdx, zTerm, nTerm, f, &ck2);
259182 if( p->nPendingData==0 && 0==fts5TestUtf8(zTerm, nTerm) ){
259186 rc = fts5QueryCksum(p, iIdx, zTerm, nTerm, f, &ck2);
259192 rc = fts5QueryCksum(p, iIdx, zTerm, nTerm, f, &ck2);
259352 int nTerm; /* Size of term on leaf in bytes */ local
259360 iOff += fts5GetVarint32(&pLeaf->p[iOff], nTerm);
259361 if( iOff+nTerm>pLeaf->szLeaf ){
259364 res = fts5Memcmp(&pLeaf->p[iOff], zIdxTerm, MIN(nTerm, nIdxTerm));
259365 if( res==0 ) res = nTerm - nIdxTerm;
260538 int nTerm; /* Size of phrase in terms */ member
268876 int nTerm; local
268877 zTerm = sqlite3Fts5IterTerm(pCsr->pIter, &nTerm);
268879 int nCmp = MIN(nTerm, pCsr->nLeTerm);
268881 if( bCmp<0 || (bCmp==0 && pCsr->nLeTerm<nTerm) ){
268886 sqlite3Fts5BufferSet(&rc, &pCsr->term, nTerm, (const u8*)zTerm);
268948 int nTerm; local
268950 zTerm = sqlite3Fts5IterTerm(pCsr->pIter, &nTerm);
268951 assert( nTerm>=0 );
268953 int nCmp = MIN(nTerm, pCsr->nLeTerm);
268955 if( bCmp<0 || (bCmp==0 && pCsr->nLeTerm<nTerm) ){
268961 sqlite3Fts5BufferSet(&rc, &pCsr->term, nTerm, (const u8*)zTerm);
269037 zTerm = sqlite3Fts5IterTerm(pCsr->pIter, &nTerm);
269038 if( nTerm!=pCsr->term.n
269039 || (nTerm>0 && memcmp(zTerm, pCsr->term.p, nTerm))
269076 int nTerm = 0; local
269092 nTerm = sqlite3_value_bytes(pEq);
269097 nTerm = sqlite3_value_bytes(pGe);
269114 rc = sqlite3Fts5IndexQuery(pIndex, zTerm, nTerm, f, 0, &pCsr->pIter);