Lines Matching refs:nPrefix
163127 int nPrefix; /* Number of prior entries in the key */
164437 pIn->nPrefix = i;
164439 pIn->nPrefix = 0;
176207 if( pIn->nPrefix ){
176227 pIn->iBase, pIn->nPrefix);
192773 ** varint nPrefix; (length of prefix shared with previous term)
192819 ** varint nPrefix; (length of shared prefix with previous term)
193530 int nPrefix; /* Prefix length (0 for main terms index) */
194676 int nPrefix = 0;
194677 if( fts3GobbleInt(&p, &nPrefix) ) return SQLITE_ERROR;
194678 assert( nPrefix>=0 );
194679 if( nPrefix==0 ){
194683 aIndex[i].nPrefix = nPrefix;
195545 int nPrefix = 0; /* Size of term prefix */
195550 zCsr += fts3GetVarint32(zCsr, &nPrefix);
195551 if( nPrefix>nBuffer ){
195559 assert( nPrefix>=0 && nSuffix>=0 );
195560 if( nPrefix>zCsr-zNode || nSuffix>zEnd-zCsr || nSuffix==0 ){
195564 if( (i64)nPrefix+nSuffix>nAlloc ){
195566 nAlloc = ((i64)nPrefix+nSuffix) * 2;
195575 memcpy(&zBuffer[nPrefix], zCsr, nSuffix);
195576 nBuffer = nPrefix + nSuffix;
196739 if( p->aIndex[i].nPrefix==nTerm ){
196749 if( p->aIndex[i].nPrefix==nTerm+1 ){
204559 ** So, for a system with nPrefix prefix indexes configured, the block of
204561 ** iIndex starts at absolute level ((iLangid * (nPrefix+1) + iIndex) * 1024).
204851 if( nToken<pIndex->nPrefix ) continue;
204853 p, iCol, iPos, &pIndex->hPending, zToken, pIndex->nPrefix
205321 int nPrefix; /* Number of bytes in term prefix */
205394 pNext += fts3GetVarint32(pNext, &nPrefix);
205398 || nPrefix>pReader->nTerm
205403 /* Both nPrefix and nSuffix were read by fts3GetVarint32() and so are
205406 if( (i64)nPrefix+nSuffix>(i64)pReader->nTermAlloc ){
205407 i64 nNew = ((i64)nPrefix+nSuffix)*2;
205419 memcpy(&pReader->zTerm[nPrefix], pNext, nSuffix);
205420 pReader->nTerm = nPrefix+nSuffix;
206042 int nPrefix; /* Number of bytes of prefix compression */
206045 nPrefix = fts3PrefixCompress(pTree->zTerm, pTree->nTerm, zTerm, nTerm);
206046 nSuffix = nTerm-nPrefix;
206053 nReq += sqlite3Fts3VarintLen(nPrefix)+sqlite3Fts3VarintLen(nSuffix)+nSuffix;
206073 nData += sqlite3Fts3PutVarint(&pTree->aData[nData], nPrefix);
206077 memcpy(&pTree->aData[nData], &zTerm[nPrefix], nSuffix);
206245 int nPrefix; /* Size of term prefix in bytes */
206278 nPrefix = fts3PrefixCompress(pWriter->zTerm, pWriter->nTerm, zTerm, nTerm);
206279 nSuffix = nTerm-nPrefix;
206287 nReq = sqlite3Fts3VarintLen(nPrefix) + /* varint containing prefix size */
206314 assert( nPrefix<nTerm );
206315 rc = fts3NodeAddTerm(p, &pWriter->pTree, isCopyTerm, zTerm, nPrefix+1);
206321 nPrefix = 0;
206345 nData += sqlite3Fts3PutVarint(&pWriter->aData[nData], nPrefix);
206348 memcpy(&pWriter->aData[nData], &zTerm[nPrefix], nSuffix);
207784 int nPrefix = 0; /* Bytes to copy from previous term */
207795 p->iOff += fts3GetVarint32(&p->aNode[p->iOff], &nPrefix);
207799 if( nPrefix>p->term.n || nSuffix>p->nNode-p->iOff || nSuffix==0 ){
207802 blobGrowBuffer(&p->term, nPrefix+nSuffix, &rc);
207804 memcpy(&p->term.a[nPrefix], &p->aNode[p->iOff], nSuffix);
207805 p->term.n = nPrefix+nSuffix;
207876 int nPrefix;
207884 nPrefix = fts3PrefixCompress(pNode->key.a, pNode->key.n, zTerm, nTerm);
207885 nSuffix = nTerm - nPrefix;
207887 nSpace = sqlite3Fts3VarintLen(nPrefix);
207908 pBlk->n += sqlite3Fts3PutVarint(&pBlk->a[pBlk->n], nPrefix);
207911 assert( nPrefix+nSuffix<=nTerm );
207912 assert( nPrefix>=0 );
207913 memcpy(&pBlk->a[pBlk->n], &zTerm[nPrefix], nSuffix);
207976 int nPrefix; /* Size of term prefix in bytes */
207989 nPrefix = fts3PrefixCompress(pPrev->a, pPrev->n, zTerm, nTerm);
207990 nSuffix = nTerm - nPrefix;
207996 pNode->n += sqlite3Fts3PutVarint(&pNode->a[pNode->n], nPrefix);
207999 memcpy(&pNode->a[pNode->n], &zTerm[nPrefix], nSuffix);
208030 int nPrefix; /* Size of prefix shared with previous term */
208031 int nSuffix; /* Size of suffix (nTerm - nPrefix) */
208035 nPrefix = fts3PrefixCompress(pLeaf->key.a, pLeaf->key.n, zTerm, nTerm);
208036 nSuffix = nTerm - nPrefix;
208039 nSpace = sqlite3Fts3VarintLen(nPrefix);
208067 rc = fts3IncrmergePush(p, pWriter, zTerm, nPrefix+1);
209360 if( p->aIndex[i].nPrefix<=nToken ){
209362 zToken, p->aIndex[i].nPrefix, iLang, i, iDocid, iCol, iPos
241578 int nPrefix; /* Number of prefix indexes */
241579 int *aPrefix; /* Sizes in bytes of nPrefix prefix indexes */
245345 if( pConfig->nPrefix==FTS5_MAX_PREFIX_INDEXES ){
245364 pConfig->aPrefix[pConfig->nPrefix] = nPre;
245365 pConfig->nPrefix++;
245368 assert( pConfig->nPrefix<=FTS5_MAX_PREFIX_INDEXES );
252006 ** of the "nPrefix" field (if there was one - it is passed 0 if this is
254539 int nPrefix; /* Bytes of prefix compression for term */
254568 nPrefix = 0;
254592 nPrefix = fts5PrefixCompress(nMin, pPage->term.p, pTerm);
254593 fts5BufferAppendVarint(&p->rc, &pPage->buf, nPrefix);
254598 fts5BufferAppendVarint(&p->rc, &pPage->buf, nTerm - nPrefix);
254599 fts5BufferAppendBlob(&p->rc, &pPage->buf, nTerm - nPrefix, &pTerm[nPrefix]);
255480 u64 nPrefix = 0;
255490 iKeyOff += fts5GetVarint(&aPg[iKeyOff], &nPrefix);
255494 nPrefix = MIN(nPrefix, nPrefix2);
255495 nSuffix = (nPrefix2 + nSuffix2) - nPrefix;
255501 iOff += sqlite3Fts5PutVarint(&aPg[iOff], nPrefix);
255506 }else if( nPrefix2>nPrefix ){
255507 memcpy(&aPg[iOff], &pSeg->term.p[nPrefix], nPrefix2-nPrefix);
255508 iOff += (nPrefix2-nPrefix);
257065 for(i=0; i<pConfig->nPrefix && rc==SQLITE_OK; i++){
257497 ** greater than pConfig->nPrefix to indicate that the query will be
257508 iIdx = 1+pConfig->nPrefix;
257513 for(iIdx=1; iIdx<=pConfig->nPrefix; iIdx++){
257523 }else if( iIdx<=pConfig->nPrefix ){
264719 for(ii=0; rc==SQLITE_OK && ii<pCtx->pConfig->nPrefix; ii++){
Indexes created Tue Jun 23 00:25:03 UTC 2026