Lines Matching defs:nTerm
87348 int nTerm;
87360 nTerm = 1;
87362 nTerm = pList->nExpr;
87363 for(i=0; i<nTerm; i++){
87373 if( nTerm==1
110758 int nTerm; /* Number of terms */
111033 pWC->nTerm = 0;
111065 for(i=pWC->nTerm-1, a=pWC->a; i>=0; i--, a++){
111103 if( pWC->nTerm>=pWC->nSlot ){
111114 memcpy(pWC->a, pOld, sizeof(pWC->a[0])*pWC->nTerm);
111120 pTerm = &pWC->a[idx = pWC->nTerm++];
111347 for(pTerm=pWC->a+k; k<pWC->nTerm; k++, pTerm++){
111516 for(i=pWC->nTerm-1; i>=0; i--){
111767 assert( pOrWc->nTerm>=2 );
111774 for(i=pOrWc->nTerm-1, pOrTerm=pOrWc->a; i>=0 && indexable; i--, pOrTerm++){
111795 for(j=0, pAndTerm=pAndWC->a; j<pAndWC->nTerm; j++, pAndTerm++){
111865 for(i=pOrWc->nTerm-1; i>=0; i--, pOrTerm++){
111934 for(i=pOrWc->nTerm-1, pOrTerm=pOrWc->a; i>=0; i--, pOrTerm++){
112504 pWCEnd = &pWC->a[pWC->nTerm];
112633 int nTerm;
112643 for(i=nTerm=0, pTerm=pWC->a; i<pWC->nTerm; i++, pTerm++){
112651 nTerm++;
112673 + (sizeof(*pIdxCons) + sizeof(*pUsage))*nTerm
112686 pIdxOrderBy = (struct sqlite3_index_orderby*)&pIdxCons[nTerm];
112688 *(int*)&pIdxInfo->nConstraint = nTerm;
112695 for(i=j=0, pTerm=pWC->a; i<pWC->nTerm; i++, pTerm++){
114394 if( pWC->nTerm>1 ){
114396 for(iTerm=0; iTerm<pWC->nTerm; iTerm++){
114418 for(ii=0; ii<pOrWc->nTerm; ii++){
114444 int iSet = ((ii==pOrWc->nTerm-1)?-1:ii);
114570 for(pTerm=pWC->a, j=pWC->nTerm; j>0; j--, pTerm++){
114598 for(pTerm=pWC->a, j=pWC->nTerm; j>0; j--, pTerm++){
114631 for(pTerm=pWC->a, j=0; j<pWC->nTerm; j++, pTerm++){
115112 for(i=pWC->nTerm, pTerm=pWC->a; i>0; i--, pTerm++){
115452 for(i=0, pTerm=pWC->a; i<pWC->nTerm; i++, pTerm++){
115567 WhereTerm *pWCEnd = pWC->a + pWC->nTerm;
115787 || j>=pWC->nTerm
115796 testcase( j==pWC->nTerm-1 );
115867 pWCEnd = pWC->a + pWC->nTerm;
115878 WhereTerm * const pOrWCEnd = &pOrWC->a[pOrWC->nTerm];
115894 tempWC.nTerm = 1;
116949 for(ii=0; ii<sWLB.pWC->nTerm; ii++){
117025 for(i=0; i<sWLB.pWC->nTerm; i++){
117111 pEnd = sWLB.pWC->a + sWLB.pWC->nTerm;
126082 ** varint nTerm; (length of first term)
126083 ** char pTerm[nTerm]; (content of first term)
126130 ** varint nTerm; (length of first term)
126131 ** char pTerm[nTerm]; (content of first term)
127025 int nTerm;
127048 int nTerm; /* Size of zTerm in bytes */
128548 ** passed in zTerm/nTerm.
128554 ** that heads a sub-tree that may contain a term for which zTerm/nTerm is
128561 int nTerm, /* Size of term zTerm in bytes */
128636 cmp = memcmp(zTerm, zBuffer, (nBuffer>nTerm ? nTerm : nBuffer));
128637 if( piFirst && (cmp<0 || (cmp==0 && nBuffer>nTerm)) ){
128661 ** interior node of a b-tree segment. The zTerm buffer (size nTerm bytes)
128683 int nTerm, /* Size of term zTerm in bytes */
128695 rc = fts3ScanInteriorNode(zTerm, nTerm, zNode, nNode, piLeaf, piLeaf2);
128705 rc = fts3SelectLeaf(p, zTerm, nTerm, zBlob, nBlob, piLeaf, 0);
128716 rc = fts3SelectLeaf(p, zTerm, nTerm, zBlob, nBlob, piLeaf, piLeaf2);
129580 int nTerm, /* Size of zTerm in bytes */
129597 rc = sqlite3Fts3SegReaderPending(p, iIndex, zTerm, nTerm, isPrefix, &pSeg);
129622 rc = fts3SelectLeaf(p, zTerm, nTerm, zRoot, nRoot, &iStartBlock, pi);
129654 int nTerm, /* Size of zTerm in bytes */
129670 p, iLangid, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr
129676 ** passed as the 4th argument also scan the doclist for term zTerm/nTerm.
129684 int nTerm, /* Number of bytes in zTerm */
129688 iLangid, 0, FTS3_SEGCURSOR_ALL, zTerm, nTerm, 0, 0,pCsr
129693 ** Open an Fts3MultiSegReader to scan the doclist for term zTerm/nTerm. Or,
129695 ** zTerm/nTerm is a prefix. If successful, return SQLITE_OK and write
129708 int nTerm, /* Size of zTerm in bytes */
129723 if( p->aIndex[i].nPrefix==nTerm ){
129726 i, FTS3_SEGCURSOR_ALL, zTerm, nTerm, 0, 0, pSegcsr
129733 if( p->aIndex[i].nPrefix==nTerm+1 ){
129736 i, FTS3_SEGCURSOR_ALL, zTerm, nTerm, 1, 0, pSegcsr
129740 p, pCsr->iLangid, zTerm, nTerm, pSegcsr
129749 0, FTS3_SEGCURSOR_ALL, zTerm, nTerm, isPrefix, 0, pSegcsr
129792 filter.nTerm = pTok->n;
132923 int n = (pCsr->nStop<pCsr->csr.nTerm) ? pCsr->nStop : pCsr->csr.nTerm;
132925 if( mc<0 || (mc==0 && pCsr->csr.nTerm>pCsr->nStop) ){
133053 pCsr->filter.nTerm = sqlite3_value_bytes(apVal[0]);
133077 pCsr->filter.zTerm, pCsr->filter.nTerm, 0, isScan, &pCsr->csr
133108 sqlite3_result_text(pCtx, p->csr.zTerm, p->csr.nTerm, SQLITE_TRANSIENT);
136858 int nTerm; /* Number of bytes in current term */
136889 int nTerm; /* Number of bytes in zTerm */
136922 int nTerm; /* Number of bytes in zTerm */
138024 pReader->nTerm = fts3HashKeysize(pElem);
138084 pReader->nTerm = nPrefix+nSuffix;
138364 int nTerm, /* Size of buffer zTerm */
138382 if( nTerm==0 || (nKey>=nTerm && 0==memcmp(zKey, zTerm, nTerm)) ){
138417 pE = fts3HashFindElem(pHash, zTerm, nTerm);
138459 int rc2 = pLhs->nTerm - pRhs->nTerm;
138461 rc = memcmp(pLhs->zTerm, pRhs->zTerm, pLhs->nTerm);
138463 rc = memcmp(pLhs->zTerm, pRhs->zTerm, pRhs->nTerm);
138516 ** points to with the term specified by arguments zTerm and nTerm.
138519 ** -ve if the pSeg term is less than zTerm/nTerm, 0 if the two terms are
138520 ** equal, or +ve if the pSeg term is greater than zTerm/nTerm.
138525 int nTerm /* Size of term zTerm in bytes */
138529 if( pSeg->nTerm>nTerm ){
138530 res = memcmp(pSeg->zTerm, zTerm, nTerm);
138532 res = memcmp(pSeg->zTerm, zTerm, pSeg->nTerm);
138535 res = pSeg->nTerm-nTerm;
138680 int isCopyTerm, /* True if zTerm/nTerm is transient */
138682 int nTerm /* Size of term in bytes */
138697 nPrefix = fts3PrefixCompress(pTree->zTerm, pTree->nTerm, zTerm, nTerm);
138698 nSuffix = nTerm-nPrefix;
138729 if( pTree->nMalloc<nTerm ){
138730 char *zNew = sqlite3_realloc(pTree->zMalloc, nTerm*2);
138734 pTree->nMalloc = nTerm*2;
138738 memcpy(pTree->zTerm, zTerm, nTerm);
138739 pTree->nTerm = nTerm;
138742 pTree->nTerm = nTerm;
138766 rc = fts3NodeAddTerm(p, &pParent, isCopyTerm, zTerm, nTerm);
138778 rc = fts3NodeAddTerm(p, &pNew, isCopyTerm, zTerm, nTerm);
138888 int nTerm, /* Size of term in bytes */
138925 nPrefix = fts3PrefixCompress(pWriter->zTerm, pWriter->nTerm, zTerm, nTerm);
138926 nSuffix = nTerm-nPrefix;
138950 ** leaf node (zTerm/nTerm).
138955 assert( nPrefix<nTerm );
138960 pWriter->nTerm = 0;
138963 nSuffix = nTerm;
138965 sqlite3Fts3VarintLen(nTerm) + /* varint containing suffix size */
138966 nTerm + /* Term suffix */
139000 if( nTerm>pWriter->nMalloc ){
139001 char *zNew = sqlite3_realloc(pWriter->zMalloc, nTerm*2);
139005 pWriter->nMalloc = nTerm*2;
139010 memcpy(pWriter->zTerm, zTerm, nTerm);
139014 pWriter->nTerm = nTerm;
139394 int nTerm /* Length of zTerm in bytes */
139411 }while( zTerm && (res = fts3SegReaderTermCmp(pSeg, zTerm, nTerm))<0 );
139428 return fts3SegReaderStart(p, pCsr, pFilter->zTerm, pFilter->nTerm);
139436 int nTerm /* Number of bytes in zTerm */
139446 assert( zTerm && nTerm>0 );
139448 /* Advance each segment iterator until it points to the term zTerm/nTerm. */
139449 rc = fts3SegReaderStart(p, pCsr, zTerm, nTerm);
139452 /* Determine how many of the segments actually point to zTerm/nTerm. */
139455 if( !pSeg->aNode || fts3SegReaderTermCmp(pSeg, zTerm, nTerm) ){
139490 assert( pCsr->nTerm==0 );
139551 pCsr->nTerm = apSegment[0]->nTerm;
139555 ** to does not share a suffix with pFilter->zTerm/nTerm, then all
139562 if( pCsr->nTerm<pFilter->nTerm
139563 || (!isPrefix && pCsr->nTerm>pFilter->nTerm)
139564 || memcmp(pCsr->zTerm, pFilter->zTerm, pFilter->nTerm)
139573 && apSegment[nMerge]->nTerm==pCsr->nTerm
139574 && 0==memcmp(pCsr->zTerm, apSegment[nMerge]->zTerm, pCsr->nTerm)
139913 csr.zTerm, csr.nTerm, csr.aDoclist, csr.nDoclist);
140461 ** node is finished and written to disk. The key (zTerm/nTerm) is guaranteed
140473 int nTerm /* Bytes at zTerm */
140478 assert( nTerm>0 );
140491 nPrefix = fts3PrefixCompress(pNode->key.a, pNode->key.n, zTerm, nTerm);
140492 nSuffix = nTerm - nPrefix;
140510 blobGrowBuffer(&pNode->key, nTerm, &rc);
140520 memcpy(pNode->key.a, zTerm, nTerm);
140521 pNode->key.n = nTerm;
140554 ** The term to be appended is passed via arguments zTerm/nTerm. For a
140561 ** copy of zTerm/nTerm.
140574 int nTerm, /* Size of zTerm in bytes */
140588 blobGrowBuffer(pPrev, nTerm, &rc);
140591 nPrefix = fts3PrefixCompress(pPrev->a, pPrev->n, zTerm, nTerm);
140592 nSuffix = nTerm - nPrefix;
140593 memcpy(pPrev->a, zTerm, nTerm);
140594 pPrev->n = nTerm;
140626 int nTerm = pCsr->nTerm;
140632 int nSuffix; /* Size of suffix (nTerm - nPrefix) */
140636 nPrefix = fts3PrefixCompress(pLeaf->key.a, pLeaf->key.n, zTerm, nTerm);
140637 nSuffix = nTerm - nPrefix;
140657 ** leaf node (zTerm/nTerm).
140671 nSuffix = nTerm;
140685 &pLeaf->block, &pLeaf->key, zTerm, nTerm, aDoclist, nDoclist
141190 ** all terms that are greater than or equal to zTerm/nTerm (for leaf nodes)
141191 ** or greater than zTerm/nTerm (for internal nodes) from aNode/nNode.
141198 int nTerm, /* Size of zTerm in bytes */
141217 int res = fts3TermCmp(reader.term.a, reader.term.n, zTerm, nTerm);
141240 ** Remove all terms smaller than zTerm/nTerm from segment iIdx in absolute
141253 int nTerm /* Number of bytes in buffer zTerm */
141272 rc = fts3TruncateNode(aRoot, nRoot, &root, zTerm, nTerm, &iBlock);
141285 rc = fts3TruncateNode(aBlock, nBlock, &block, zTerm, nTerm, &iBlock);
141365 ** so that it contains no keys smaller than zTerm/nTerm. */
141367 int nTerm = pSeg->nTerm;
141368 rc = fts3TruncateSegment(p, iAbsLevel, pSeg->iIdx, zTerm, nTerm);
141589 int nKey = pCsr->nTerm;
141731 int nTerm, /* Size of zTerm in bytes */
141745 for(i=0; i<nTerm; i++) ret += (ret<<3) + zTerm[i];
141810 csr.zTerm, csr.nTerm, iLangid, iIndex, iDocid,
143676 int nTerm; /* Number of tokens in phrase */
143677 int iTerm; /* For looping through nTerm phrase terms */
143684 nTerm = pExpr->pPhrase->nToken;
143690 for(iTerm=0; iTerm<nTerm; iTerm++){
143692 pT->iOff = nTerm-iTerm-1;
