Home
last modified time | relevance | path

Searched refs:nRight (Results 1 – 15 of 15) sorted by relevance

/sqlite-3.40.0/ext/lsm1/
H A Dlsm_sorted.c2188 bComposite = (pLvl->nRight>0 && pCsr->nPtr>pLvl->nRight); in segmentCursorAdvance()
2359 int nRhs = pLvl->nRight; in multiCursorAddRhs()
2919 i += pLvl->nRight; in multiCursorEnd()
4498 pNew->nRight = nMerge; in sortedMergeSetup()
4901 pLvl->nRight += nFree; in mergeInsertFreelistSegments()
5704 pSeg = (pLvl->nRight==0 ? &pLvl->lhs : &pLvl->aRhs[pLvl->nRight-1]); in infoPageDump()
5895 int nRight = 0; in lsmSortedDumpStructure() local
5905 if( nRight ){ in lsmSortedDumpStructure()
5908 nRight++; in lsmSortedDumpStructure()
5921 if( i<nRight ){ in lsmSortedDumpStructure()
[all …]
H A Dlsm_ckpt.c330 ckptSetValue(p, iOut++, pLevel->nRight, pRc); in ckptExportLevel()
333 assert( (pLevel->nRight>0)==(pMerge!=0) ); in ckptExportLevel()
336 for(i=0; i<pLevel->nRight; i++){ in ckptExportLevel()
339 assert( pMerge->nInput==pLevel->nRight in ckptExportLevel()
340 || pMerge->nInput==pLevel->nRight+1 in ckptExportLevel()
575 pLevel->nRight = aIn[iIn++]; in ckptLoadLevels()
576 if( pLevel->nRight ){ in ckptLoadLevels()
577 int nByte = sizeof(Segment) * pLevel->nRight; in ckptLoadLevels()
593 if( pLevel->nRight>0 ){ in ckptLoadLevels()
1005 if( pLvl->nRight ){ in lsmCheckpointDeserialize()
[all …]
H A Dlsm_file.c1716 for(i=0; i<pLevel->nRight; i++){ in fsLevelEndsBetween()
2080 for(j=0; iRet && j<pLvl->nRight; j++){ in findAppendPoint()
2958 for(i=0; i<pLvl->nRight; i++){ in findSegment()
3277 checkBlocks(pFS, &pLevel->lhs, (pLevel->nRight!=0), nBlock, aUsed); in lsmFsIntegrityCheck()
3278 for(j=0; j<pLevel->nRight; j++){ in lsmFsIntegrityCheck()
H A DlsmInt.h420 int nRight; /* Size of apRight[] array */ member
H A Dlsm_main.c482 for(i=0; rc==LSM_OK && i<p->nRight; i++){ in lsmStructList()
/sqlite-3.40.0/ext/fts3/
H A Dfts3_snippet.c666 int nRight; /* Tokens to the right of last highlight */ in fts3SnippetShift() local
670 for(nRight=0; !(hlmask & ((u64)1 << (nSnippet-1-nRight))); nRight++); in fts3SnippetShift()
671 assert( (nSnippet-1-nRight)<=63 && (nSnippet-1-nRight)>=0 ); in fts3SnippetShift()
672 nDesired = (nLeft-nRight)/2; in fts3SnippetShift()
H A Dfts3.c2451 int nRight, /* Maximum difference in token positions */ in fts3PoslistNearMerge() argument
2464 fts3PoslistPhraseMerge(&pTmp1, nRight, 0, 0, pp1, pp2); in fts3PoslistNearMerge()
4234 int nRight; in fts3EvalPhraseMergeToken() local
4241 nRight = nList; in fts3EvalPhraseMergeToken()
4245 nRight = p->doclist.nAll; in fts3EvalPhraseMergeToken()
4252 pTab->bDescIdx, nDiff, pLeft, nLeft, &pRight, &nRight in fts3EvalPhraseMergeToken()
4256 p->doclist.nAll = nRight; in fts3EvalPhraseMergeToken()
/sqlite-3.40.0/ext/icu/
H A Dicu.c434 int nRight, in icuCollationColl() argument
439 res = ucol_strcoll(p, (UChar *)zLeft, nLeft/2, (UChar *)zRight, nRight/2); in icuCollationColl()
/sqlite-3.40.0/ext/fts2/
H A Dfts2.c1352 const char *pRight, int nRight, in docListUnion() argument
1359 if( nRight!=0) dataBufferAppend(pOut, pRight, nRight); in docListUnion()
1362 if( nRight==0 ){ in docListUnion()
1460 const char *pRight, int nRight, in docListPhraseMerge() argument
1467 if( nLeft==0 || nRight==0 ) return; in docListPhraseMerge()
1498 const char *pRight, int nRight, in docListAndMerge() argument
1533 const char *pRight, int nRight, in docListOrMerge() argument
1540 if( nRight!=0 ) dataBufferAppend(pOut, pRight, nRight); in docListOrMerge()
1543 if( nRight==0 ){ in docListOrMerge()
1583 const char *pRight, int nRight, in docListExceptMerge() argument
[all …]
/sqlite-3.40.0/src/
H A Dresolve.c1268 int nLeft, nRight; in resolveExprStep() local
1274 nRight = sqlite3ExprVectorSize(pExpr->x.pList->a[0].pExpr); in resolveExprStep()
1275 if( nRight==nLeft ){ in resolveExprStep()
1276 nRight = sqlite3ExprVectorSize(pExpr->x.pList->a[1].pExpr); in resolveExprStep()
1280 nRight = sqlite3ExprVectorSize(pExpr->pRight); in resolveExprStep()
1282 if( nLeft!=nRight ){ in resolveExprStep()
H A Dwal.c1654 int nRight = *pnRight; in walMerge() local
1657 assert( nLeft>0 && nRight>0 ); in walMerge()
1658 while( iRight<nRight || iLeft<nLeft ){ in walMerge()
1663 && (iRight>=nRight || aContent[aLeft[iLeft]]<aContent[aRight[iRight]]) in walMerge()
1675 assert( iRight>=nRight || aContent[aRight[iRight]]>dbpage ); in walMerge()
H A Dtest1.c1737 int nRight, in testCreateCollationCmp() argument
1746 Tcl_ListObjAppendElement(0, pScript, Tcl_NewStringObj((char *)zRight,nRight)); in testCreateCollationCmp()
/sqlite-3.40.0/ext/rtree/
H A Drtree.c2343 int nRight = nIdx-nLeft; in SortByDistance() local
2348 SortByDistance(aRight, nRight, aDistance, aSpare); in SortByDistance()
2353 while( iLeft<nLeft || iRight<nRight ){ in SortByDistance()
2357 }else if( iRight==nRight ){ in SortByDistance()
2412 int nRight = nIdx-nLeft; in SortByDimension() local
2417 SortByDimension(pRtree, aRight, nRight, iDim, aCell, aSpare); in SortByDimension()
2421 while( iLeft<nLeft || iRight<nRight ){ in SortByDimension()
2426 if( (iLeft!=nLeft) && ((iRight==nRight) in SortByDimension()
/sqlite-3.40.0/ext/fts5/
H A Dfts5_index.c585 const u8 *pRight, int nRight /* Right hand side of comparison */ in fts5BufferCompareBlob() argument
587 int nCmp = MIN(pLeft->n, nRight); in fts5BufferCompareBlob()
589 return (res==0 ? (pLeft->n - nRight) : res); in fts5BufferCompareBlob()
/sqlite-3.40.0/ext/session/
H A Dsqlite3session.c5388 int nRight /* Number of bytes in rhs input */, in sqlite3changeset_concat() argument
5401 rc = sqlite3changegroup_add(pGrp, nRight, pRight); in sqlite3changeset_concat()