Home
last modified time | relevance | path

Searched refs:iRight (Results 1 – 5 of 5) sorted by relevance

/sqlite-3.40.0/test/
H A Dmalloctraceviewer.tcl103 proc sort_tree_compare {iLeft iRight} { argument
108 set right [$O(tree) item $iRight -text]
113 set right [lindex [$O(tree) item $iRight -values] 0]
118 set right [lindex [$O(tree) item $iRight -values] 1]
/sqlite-3.40.0/ext/rtree/
H A Drtree.c2340 int iRight = 0; in SortByDistance() local
2353 while( iLeft<nLeft || iRight<nRight ){ in SortByDistance()
2355 aIdx[iLeft+iRight] = aRight[iRight]; in SortByDistance()
2356 iRight++; in SortByDistance()
2357 }else if( iRight==nRight ){ in SortByDistance()
2358 aIdx[iLeft+iRight] = aLeft[iLeft]; in SortByDistance()
2367 aIdx[iLeft+iRight] = aRight[iRight]; in SortByDistance()
2368 iRight++; in SortByDistance()
2409 int iRight = 0; in SortByDimension() local
2433 aIdx[iLeft+iRight] = aRight[iRight]; in SortByDimension()
[all …]
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_ckpt.c566 int iRight; in ckptLoadLevels() local
588 for(iRight=0; iRight<pLevel->nRight; iRight++){ in ckptLoadLevels()
589 ckptNewSegment(aIn, &iIn, &pLevel->aRhs[iRight]); in ckptLoadLevels()
H A Dlsm_tree.c910 u32 iRight; TreeNode *pRight; /* New right-hand sibling node */ in treeInsert() local
913 pRight = newTreeNode(pDb, &iRight, &rc); in treeInsert()
931 pRoot->aiChildPtr[2] = iRight; in treeInsert()
939 iLeft, pNode->aiKeyPtr[1], iRight, pCsr->aiCell[pCsr->iNode] in treeInsert()
1038 u32 iRight; in treeInsertLeaf() local
1039 pRight = newTreeLeaf(pDb, &iRight, &rc); in treeInsertLeaf()
1051 rc = treeInsert(pDb, pCsr, iNew, pLeaf->aiKeyPtr[1], iRight, in treeInsertLeaf()
/sqlite-3.40.0/src/
H A Dwal.c1652 int iRight = 0; /* Current index in aRight */ in walMerge() local
1658 while( iRight<nRight || iLeft<nLeft ){ in walMerge()
1663 && (iRight>=nRight || aContent[aLeft[iLeft]]<aContent[aRight[iRight]]) in walMerge()
1667 logpage = aRight[iRight++]; in walMerge()
1675 assert( iRight>=nRight || aContent[aRight[iRight]]>dbpage ); in walMerge()