Lines Matching defs:nTerm
87368 int nTerm;
87380 nTerm = 1;
87382 nTerm = pList->nExpr;
87383 for(i=0; i<nTerm; i++){
87393 if( nTerm==1
110778 int nTerm; /* Number of terms */
111053 pWC->nTerm = 0;
111085 for(i=pWC->nTerm-1, a=pWC->a; i>=0; i--, a++){
111123 if( pWC->nTerm>=pWC->nSlot ){
111134 memcpy(pWC->a, pOld, sizeof(pWC->a[0])*pWC->nTerm);
111140 pTerm = &pWC->a[idx = pWC->nTerm++];
111367 for(pTerm=pWC->a+k; k<pWC->nTerm; k++, pTerm++){
111536 for(i=pWC->nTerm-1; i>=0; i--){
111787 assert( pOrWc->nTerm>=2 );
111794 for(i=pOrWc->nTerm-1, pOrTerm=pOrWc->a; i>=0 && indexable; i--, pOrTerm++){
111815 for(j=0, pAndTerm=pAndWC->a; j<pAndWC->nTerm; j++, pAndTerm++){
111885 for(i=pOrWc->nTerm-1; i>=0; i--, pOrTerm++){
111954 for(i=pOrWc->nTerm-1, pOrTerm=pOrWc->a; i>=0; i--, pOrTerm++){
112524 pWCEnd = &pWC->a[pWC->nTerm];
112653 int nTerm;
112663 for(i=nTerm=0, pTerm=pWC->a; i<pWC->nTerm; i++, pTerm++){
112671 nTerm++;
112693 + (sizeof(*pIdxCons) + sizeof(*pUsage))*nTerm
112706 pIdxOrderBy = (struct sqlite3_index_orderby*)&pIdxCons[nTerm];
112708 *(int*)&pIdxInfo->nConstraint = nTerm;
112715 for(i=j=0, pTerm=pWC->a; i<pWC->nTerm; i++, pTerm++){
114414 if( pWC->nTerm>1 ){
114416 for(iTerm=0; iTerm<pWC->nTerm; iTerm++){
114438 for(ii=0; ii<pOrWc->nTerm; ii++){
114464 int iSet = ((ii==pOrWc->nTerm-1)?-1:ii);
114590 for(pTerm=pWC->a, j=pWC->nTerm; j>0; j--, pTerm++){
114618 for(pTerm=pWC->a, j=pWC->nTerm; j>0; j--, pTerm++){
114651 for(pTerm=pWC->a, j=0; j<pWC->nTerm; j++, pTerm++){
115132 for(i=pWC->nTerm, pTerm=pWC->a; i>0; i--, pTerm++){
115472 for(i=0, pTerm=pWC->a; i<pWC->nTerm; i++, pTerm++){
115587 WhereTerm *pWCEnd = pWC->a + pWC->nTerm;
115807 || j>=pWC->nTerm
115816 testcase( j==pWC->nTerm-1 );
115887 pWCEnd = pWC->a + pWC->nTerm;
115898 WhereTerm * const pOrWCEnd = &pOrWC->a[pOrWC->nTerm];
115914 tempWC.nTerm = 1;
116969 for(ii=0; ii<sWLB.pWC->nTerm; ii++){
117045 for(i=0; i<sWLB.pWC->nTerm; i++){
117131 pEnd = sWLB.pWC->a + sWLB.pWC->nTerm;
126102 ** varint nTerm; (length of first term)
126103 ** char pTerm[nTerm]; (content of first term)
126150 ** varint nTerm; (length of first term)
126151 ** char pTerm[nTerm]; (content of first term)
127045 int nTerm;
127068 int nTerm; /* Size of zTerm in bytes */
128568 ** passed in zTerm/nTerm.
128574 ** that heads a sub-tree that may contain a term for which zTerm/nTerm is
128581 int nTerm, /* Size of term zTerm in bytes */
128656 cmp = memcmp(zTerm, zBuffer, (nBuffer>nTerm ? nTerm : nBuffer));
128657 if( piFirst && (cmp<0 || (cmp==0 && nBuffer>nTerm)) ){
128681 ** interior node of a b-tree segment. The zTerm buffer (size nTerm bytes)
128703 int nTerm, /* Size of term zTerm in bytes */
128715 rc = fts3ScanInteriorNode(zTerm, nTerm, zNode, nNode, piLeaf, piLeaf2);
128725 rc = fts3SelectLeaf(p, zTerm, nTerm, zBlob, nBlob, piLeaf, 0);
128736 rc = fts3SelectLeaf(p, zTerm, nTerm, zBlob, nBlob, piLeaf, piLeaf2);
129600 int nTerm, /* Size of zTerm in bytes */
129617 rc = sqlite3Fts3SegReaderPending(p, iIndex, zTerm, nTerm, isPrefix, &pSeg);
129642 rc = fts3SelectLeaf(p, zTerm, nTerm, zRoot, nRoot, &iStartBlock, pi);
129674 int nTerm, /* Size of zTerm in bytes */
129690 p, iLangid, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr
129696 ** passed as the 4th argument also scan the doclist for term zTerm/nTerm.
129704 int nTerm, /* Number of bytes in zTerm */
129708 iLangid, 0, FTS3_SEGCURSOR_ALL, zTerm, nTerm, 0, 0,pCsr
129713 ** Open an Fts3MultiSegReader to scan the doclist for term zTerm/nTerm. Or,
129715 ** zTerm/nTerm is a prefix. If successful, return SQLITE_OK and write
129728 int nTerm, /* Size of zTerm in bytes */
129743 if( p->aIndex[i].nPrefix==nTerm ){
129746 i, FTS3_SEGCURSOR_ALL, zTerm, nTerm, 0, 0, pSegcsr
129753 if( p->aIndex[i].nPrefix==nTerm+1 ){
129756 i, FTS3_SEGCURSOR_ALL, zTerm, nTerm, 1, 0, pSegcsr
129760 p, pCsr->iLangid, zTerm, nTerm, pSegcsr
129769 0, FTS3_SEGCURSOR_ALL, zTerm, nTerm, isPrefix, 0, pSegcsr
129812 filter.nTerm = pTok->n;
132955 int n = (pCsr->nStop<pCsr->csr.nTerm) ? pCsr->nStop : pCsr->csr.nTerm;
132957 if( mc<0 || (mc==0 && pCsr->csr.nTerm>pCsr->nStop) ){
133085 pCsr->filter.nTerm = sqlite3_value_bytes(apVal[0]);
133109 pCsr->filter.zTerm, pCsr->filter.nTerm, 0, isScan, &pCsr->csr
133140 sqlite3_result_text(pCtx, p->csr.zTerm, p->csr.nTerm, SQLITE_TRANSIENT);
136890 int nTerm; /* Number of bytes in current term */
136921 int nTerm; /* Number of bytes in zTerm */
136954 int nTerm; /* Number of bytes in zTerm */
138056 pReader->nTerm = fts3HashKeysize(pElem);
138116 pReader->nTerm = nPrefix+nSuffix;
138396 int nTerm, /* Size of buffer zTerm */
138414 if( nTerm==0 || (nKey>=nTerm && 0==memcmp(zKey, zTerm, nTerm)) ){
138449 pE = fts3HashFindElem(pHash, zTerm, nTerm);
138491 int rc2 = pLhs->nTerm - pRhs->nTerm;
138493 rc = memcmp(pLhs->zTerm, pRhs->zTerm, pLhs->nTerm);
138495 rc = memcmp(pLhs->zTerm, pRhs->zTerm, pRhs->nTerm);
138548 ** points to with the term specified by arguments zTerm and nTerm.
138551 ** -ve if the pSeg term is less than zTerm/nTerm, 0 if the two terms are
138552 ** equal, or +ve if the pSeg term is greater than zTerm/nTerm.
138557 int nTerm /* Size of term zTerm in bytes */
138561 if( pSeg->nTerm>nTerm ){
138562 res = memcmp(pSeg->zTerm, zTerm, nTerm);
138564 res = memcmp(pSeg->zTerm, zTerm, pSeg->nTerm);
138567 res = pSeg->nTerm-nTerm;
138712 int isCopyTerm, /* True if zTerm/nTerm is transient */
138714 int nTerm /* Size of term in bytes */
138729 nPrefix = fts3PrefixCompress(pTree->zTerm, pTree->nTerm, zTerm, nTerm);
138730 nSuffix = nTerm-nPrefix;
138761 if( pTree->nMalloc<nTerm ){
138762 char *zNew = sqlite3_realloc(pTree->zMalloc, nTerm*2);
138766 pTree->nMalloc = nTerm*2;
138770 memcpy(pTree->zTerm, zTerm, nTerm);
138771 pTree->nTerm = nTerm;
138774 pTree->nTerm = nTerm;
138798 rc = fts3NodeAddTerm(p, &pParent, isCopyTerm, zTerm, nTerm);
138810 rc = fts3NodeAddTerm(p, &pNew, isCopyTerm, zTerm, nTerm);
138920 int nTerm, /* Size of term in bytes */
138957 nPrefix = fts3PrefixCompress(pWriter->zTerm, pWriter->nTerm, zTerm, nTerm);
138958 nSuffix = nTerm-nPrefix;
138982 ** leaf node (zTerm/nTerm).
138987 assert( nPrefix<nTerm );
138992 pWriter->nTerm = 0;
138995 nSuffix = nTerm;
138997 sqlite3Fts3VarintLen(nTerm) + /* varint containing suffix size */
138998 nTerm + /* Term suffix */
139032 if( nTerm>pWriter->nMalloc ){
139033 char *zNew = sqlite3_realloc(pWriter->zMalloc, nTerm*2);
139037 pWriter->nMalloc = nTerm*2;
139042 memcpy(pWriter->zTerm, zTerm, nTerm);
139046 pWriter->nTerm = nTerm;
139426 int nTerm /* Length of zTerm in bytes */
139443 }while( zTerm && (res = fts3SegReaderTermCmp(pSeg, zTerm, nTerm))<0 );
139460 return fts3SegReaderStart(p, pCsr, pFilter->zTerm, pFilter->nTerm);
139468 int nTerm /* Number of bytes in zTerm */
139478 assert( zTerm && nTerm>0 );
139480 /* Advance each segment iterator until it points to the term zTerm/nTerm. */
139481 rc = fts3SegReaderStart(p, pCsr, zTerm, nTerm);
139484 /* Determine how many of the segments actually point to zTerm/nTerm. */
139487 if( !pSeg->aNode || fts3SegReaderTermCmp(pSeg, zTerm, nTerm) ){
139522 assert( pCsr->nTerm==0 );
139583 pCsr->nTerm = apSegment[0]->nTerm;
139587 ** to does not share a suffix with pFilter->zTerm/nTerm, then all
139594 if( pCsr->nTerm<pFilter->nTerm
139595 || (!isPrefix && pCsr->nTerm>pFilter->nTerm)
139596 || memcmp(pCsr->zTerm, pFilter->zTerm, pFilter->nTerm)
139605 && apSegment[nMerge]->nTerm==pCsr->nTerm
139606 && 0==memcmp(pCsr->zTerm, apSegment[nMerge]->zTerm, pCsr->nTerm)
139945 csr.zTerm, csr.nTerm, csr.aDoclist, csr.nDoclist);
140493 ** node is finished and written to disk. The key (zTerm/nTerm) is guaranteed
140505 int nTerm /* Bytes at zTerm */
140510 assert( nTerm>0 );
140523 nPrefix = fts3PrefixCompress(pNode->key.a, pNode->key.n, zTerm, nTerm);
140524 nSuffix = nTerm - nPrefix;
140542 blobGrowBuffer(&pNode->key, nTerm, &rc);
140552 memcpy(pNode->key.a, zTerm, nTerm);
140553 pNode->key.n = nTerm;
140586 ** The term to be appended is passed via arguments zTerm/nTerm. For a
140593 ** copy of zTerm/nTerm.
140606 int nTerm, /* Size of zTerm in bytes */
140620 blobGrowBuffer(pPrev, nTerm, &rc);
140623 nPrefix = fts3PrefixCompress(pPrev->a, pPrev->n, zTerm, nTerm);
140624 nSuffix = nTerm - nPrefix;
140625 memcpy(pPrev->a, zTerm, nTerm);
140626 pPrev->n = nTerm;
140658 int nTerm = pCsr->nTerm;
140664 int nSuffix; /* Size of suffix (nTerm - nPrefix) */
140668 nPrefix = fts3PrefixCompress(pLeaf->key.a, pLeaf->key.n, zTerm, nTerm);
140669 nSuffix = nTerm - nPrefix;
140689 ** leaf node (zTerm/nTerm).
140703 nSuffix = nTerm;
140717 &pLeaf->block, &pLeaf->key, zTerm, nTerm, aDoclist, nDoclist
141222 ** all terms that are greater than or equal to zTerm/nTerm (for leaf nodes)
141223 ** or greater than zTerm/nTerm (for internal nodes) from aNode/nNode.
141230 int nTerm, /* Size of zTerm in bytes */
141249 int res = fts3TermCmp(reader.term.a, reader.term.n, zTerm, nTerm);
141272 ** Remove all terms smaller than zTerm/nTerm from segment iIdx in absolute
141285 int nTerm /* Number of bytes in buffer zTerm */
141304 rc = fts3TruncateNode(aRoot, nRoot, &root, zTerm, nTerm, &iBlock);
141317 rc = fts3TruncateNode(aBlock, nBlock, &block, zTerm, nTerm, &iBlock);
141397 ** so that it contains no keys smaller than zTerm/nTerm. */
141399 int nTerm = pSeg->nTerm;
141400 rc = fts3TruncateSegment(p, iAbsLevel, pSeg->iIdx, zTerm, nTerm);
141621 int nKey = pCsr->nTerm;
141763 int nTerm, /* Size of zTerm in bytes */
141777 for(i=0; i<nTerm; i++) ret += (ret<<3) + zTerm[i];
141842 csr.zTerm, csr.nTerm, iLangid, iIndex, iDocid,
143708 int nTerm; /* Number of tokens in phrase */
143709 int iTerm; /* For looping through nTerm phrase terms */
143716 nTerm = pExpr->pPhrase->nToken;
143722 for(iTerm=0; iTerm<nTerm; iTerm++){
143724 pT->iOff = nTerm-iTerm-1;