Lines Matching refs:nTerm
100481 int nTerm; /* Number of terms */
100613 pWC->nTerm = 0;
100646 for(i=pWC->nTerm-1, a=pWC->a; i>=0; i--, a++){
100684 if( pWC->nTerm>=pWC->nSlot ){
100695 memcpy(pWC->a, pOld, sizeof(pWC->a[0])*pWC->nTerm);
100701 pTerm = &pWC->a[idx = pWC->nTerm++];
100932 for(pTerm=pWC->a, k=pWC->nTerm; k; k--, pTerm++){
100980 for(i=pWC->nTerm-1; i>=0; i--){
101229 assert( pOrWc->nTerm>=2 );
101236 for(i=pOrWc->nTerm-1, pOrTerm=pOrWc->a; i>=0 && indexable; i--, pOrTerm++){
101257 for(j=0, pAndTerm=pAndWC->a; j<pAndWC->nTerm; j++, pAndTerm++){
101327 for(i=pOrWc->nTerm-1; i>=0; i--, pOrTerm++){
101398 for(i=pOrWc->nTerm-1, pOrTerm=pOrWc->a; i>=0; i--, pOrTerm++){
101942 int nTerm; /* Number of ORDER BY terms */
101950 nTerm = pOrderBy->nExpr;
101951 assert( nTerm>0 );
101966 for(i=j=0, pTerm=pOrderBy->a; j<nTerm && i<=pIdx->nColumn; i++){
102035 j = nTerm;
102040 if( j>=nTerm ){
102146 WhereTerm * const pWCEnd = &pWC->a[pWC->nTerm]; /* End of pWC->a[] */
102162 WhereTerm * const pOrWCEnd = &pOrWC->a[pOrWC->nTerm];
102183 tempWC.nTerm = 1;
102295 pWCEnd = &pWC->a[pWC->nTerm];
102356 pWCEnd = &pWC->a[pWC->nTerm];
102479 int nTerm;
102491 for(i=nTerm=0, pTerm=pWC->a; i<pWC->nTerm; i++, pTerm++){
102498 nTerm++;
102519 + (sizeof(*pIdxCons) + sizeof(*pUsage))*nTerm
102533 pIdxOrderBy = (struct sqlite3_index_orderby*)&pIdxCons[nTerm];
102535 *(int*)&pIdxInfo->nConstraint = nTerm;
102542 for(i=j=0, pTerm=pWC->a; i<pWC->nTerm; i++, pTerm++){
103580 for(pTerm=pWC->a, k=pWC->nTerm; nRow>2 && k; k--, pTerm++){
104656 for(ii=0; ii<pOrWc->nTerm; ii++){
104669 int iSet = ((ii==pOrWc->nTerm-1)?-1:ii);
104721 for(pTerm=pWC->a, j=pWC->nTerm; j>0; j--, pTerm++){
104749 for(pTerm=pWC->a, j=0; j<pWC->nTerm; j++, pTerm++){
113557 ** varint nTerm; (length of first term)
113558 ** char pTerm[nTerm]; (content of first term)
113605 ** varint nTerm; (length of first term)
113606 ** char pTerm[nTerm]; (content of first term)
114432 int nTerm;
114455 int nTerm; /* Size of zTerm in bytes */
115575 ** passed in zTerm/nTerm.
115581 ** that heads a sub-tree that may contain a term for which zTerm/nTerm is
115588 int nTerm, /* Size of term zTerm in bytes */
115662 cmp = memcmp(zTerm, zBuffer, (nBuffer>nTerm ? nTerm : nBuffer));
115663 if( piFirst && (cmp<0 || (cmp==0 && nBuffer>nTerm)) ){
115687 ** interior node of a b-tree segment. The zTerm buffer (size nTerm bytes)
115709 int nTerm, /* Size of term zTerm in bytes */
115721 rc = fts3ScanInteriorNode(zTerm, nTerm, zNode, nNode, piLeaf, piLeaf2);
115731 rc = fts3SelectLeaf(p, zTerm, nTerm, zBlob, nBlob, piLeaf, 0);
115742 rc = fts3SelectLeaf(p, zTerm, nTerm, zBlob, nBlob, piLeaf, piLeaf2);
116561 int nTerm, /* Size of zTerm in bytes */
116578 rc = sqlite3Fts3SegReaderPending(p, iIndex, zTerm, nTerm, isPrefix, &pSeg);
116603 rc = fts3SelectLeaf(p, zTerm, nTerm, zRoot, nRoot, &iStartBlock, pi);
116632 int nTerm, /* Size of zTerm in bytes */
116653 p, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr
116659 ** passed as the 4th argument also scan the doclist for term zTerm/nTerm.
116666 int nTerm, /* Number of bytes in zTerm */
116669 return fts3SegReaderCursor(p, 0, FTS3_SEGCURSOR_ALL, zTerm, nTerm, 0, 0,pCsr);
116673 ** Open an Fts3MultiSegReader to scan the doclist for term zTerm/nTerm. Or,
116675 ** zTerm/nTerm is a prefix. If successful, return SQLITE_OK and write
116688 int nTerm, /* Size of zTerm in bytes */
116703 if( p->aIndex[i].nPrefix==nTerm ){
116706 p, i, FTS3_SEGCURSOR_ALL, zTerm, nTerm, 0, 0, pSegcsr);
116712 if( p->aIndex[i].nPrefix==nTerm+1 ){
116715 p, i, FTS3_SEGCURSOR_ALL, zTerm, nTerm, 1, 0, pSegcsr
116718 rc = fts3SegReaderCursorAddZero(p, zTerm, nTerm, pSegcsr);
116726 p, 0, FTS3_SEGCURSOR_ALL, zTerm, nTerm, isPrefix, 0, pSegcsr
116768 filter.nTerm = pTok->n;
119322 int n = (pCsr->nStop<pCsr->csr.nTerm) ? pCsr->nStop : pCsr->csr.nTerm;
119324 if( mc<0 || (mc==0 && pCsr->csr.nTerm>pCsr->nStop) ){
119430 pCsr->filter.nTerm = sqlite3_value_bytes(apVal[0]);
119442 pCsr->filter.zTerm, pCsr->filter.nTerm, 0, isScan, &pCsr->csr
119472 sqlite3_result_text(pContext, p->csr.zTerm, p->csr.nTerm, SQLITE_TRANSIENT);
122390 int nTerm; /* Number of bytes in current term */
122421 int nTerm; /* Number of bytes in zTerm */
122453 int nTerm; /* Number of bytes in zTerm */
123359 pReader->nTerm = fts3HashKeysize(pElem);
123424 pReader->nTerm = nPrefix+nSuffix;
123706 int nTerm, /* Size of buffer zTerm */
123724 if( nTerm==0 || (nKey>=nTerm && 0==memcmp(zKey, zTerm, nTerm)) ){
123754 Fts3HashElem *pE = fts3HashFindElem(pHash, zTerm, nTerm);
123796 int rc2 = pLhs->nTerm - pRhs->nTerm;
123798 rc = memcmp(pLhs->zTerm, pRhs->zTerm, pLhs->nTerm);
123800 rc = memcmp(pLhs->zTerm, pRhs->zTerm, pRhs->nTerm);
123853 ** points to with the term specified by arguments zTerm and nTerm.
123856 ** -ve if the pSeg term is less than zTerm/nTerm, 0 if the two terms are
123857 ** equal, or +ve if the pSeg term is greater than zTerm/nTerm.
123862 int nTerm /* Size of term zTerm in bytes */
123866 if( pSeg->nTerm>nTerm ){
123867 res = memcmp(pSeg->zTerm, zTerm, nTerm);
123869 res = memcmp(pSeg->zTerm, zTerm, pSeg->nTerm);
123872 res = pSeg->nTerm-nTerm;
123989 int isCopyTerm, /* True if zTerm/nTerm is transient */
123991 int nTerm /* Size of term in bytes */
124006 nPrefix = fts3PrefixCompress(pTree->zTerm, pTree->nTerm, zTerm, nTerm);
124007 nSuffix = nTerm-nPrefix;
124038 if( pTree->nMalloc<nTerm ){
124039 char *zNew = sqlite3_realloc(pTree->zMalloc, nTerm*2);
124043 pTree->nMalloc = nTerm*2;
124047 memcpy(pTree->zTerm, zTerm, nTerm);
124048 pTree->nTerm = nTerm;
124051 pTree->nTerm = nTerm;
124075 rc = fts3NodeAddTerm(p, &pParent, isCopyTerm, zTerm, nTerm);
124087 rc = fts3NodeAddTerm(p, &pNew, isCopyTerm, zTerm, nTerm);
124197 int nTerm, /* Size of term in bytes */
124234 nPrefix = fts3PrefixCompress(pWriter->zTerm, pWriter->nTerm, zTerm, nTerm);
124235 nSuffix = nTerm-nPrefix;
124258 ** leaf node (zTerm/nTerm).
124263 assert( nPrefix<nTerm );
124268 pWriter->nTerm = 0;
124271 nSuffix = nTerm;
124273 sqlite3Fts3VarintLen(nTerm) + /* varint containing suffix size */
124274 nTerm + /* Term suffix */
124305 if( nTerm>pWriter->nMalloc ){
124306 char *zNew = sqlite3_realloc(pWriter->zMalloc, nTerm*2);
124310 pWriter->nMalloc = nTerm*2;
124315 memcpy(pWriter->zTerm, zTerm, nTerm);
124319 pWriter->nTerm = nTerm;
124626 int nTerm /* Length of zTerm in bytes */
124642 }while( zTerm && fts3SegReaderTermCmp(pSeg, zTerm, nTerm)<0 );
124655 return fts3SegReaderStart(p, pCsr, pFilter->zTerm, pFilter->nTerm);
124663 int nTerm /* Number of bytes in zTerm */
124673 assert( zTerm && nTerm>0 );
124675 /* Advance each segment iterator until it points to the term zTerm/nTerm. */
124676 rc = fts3SegReaderStart(p, pCsr, zTerm, nTerm);
124679 /* Determine how many of the segments actually point to zTerm/nTerm. */
124682 if( !pSeg->aNode || fts3SegReaderTermCmp(pSeg, zTerm, nTerm) ){
124717 assert( pCsr->nTerm==0 );
124772 pCsr->nTerm = apSegment[0]->nTerm;
124776 ** to does not share a suffix with pFilter->zTerm/nTerm, then all
124783 if( pCsr->nTerm<pFilter->nTerm
124784 || (!isPrefix && pCsr->nTerm>pFilter->nTerm)
124785 || memcmp(pCsr->zTerm, pFilter->zTerm, pFilter->nTerm)
124794 && apSegment[nMerge]->nTerm==pCsr->nTerm
124795 && 0==memcmp(pCsr->zTerm, apSegment[nMerge]->zTerm, pCsr->nTerm)
124976 csr.zTerm, csr.nTerm, csr.aDoclist, csr.nDoclist);
126824 int nTerm; /* Number of tokens in phrase */
126825 int iTerm; /* For looping through nTerm phrase terms */
126831 nTerm = pExpr->pPhrase->nToken;
126837 for(iTerm=0; iTerm<nTerm; iTerm++){
126839 pT->iOff = nTerm-iTerm-1;