Lines Matching refs:nRight
60818 int nRight = *pnRight;
60821 assert( nLeft>0 && nRight>0 );
60822 while( iRight<nRight || iLeft<nLeft ){
60827 && (iRight>=nRight || aContent[aLeft[iLeft]]<aContent[aRight[iRight]])
60839 assert( iRight>=nRight || aContent[aRight[iRight]]>dbpage );
98633 int nLeft, nRight;
98638 nRight = sqlite3ExprVectorSize(pExpr->x.pList->a[0].pExpr);
98639 if( nRight==nLeft ){
98640 nRight = sqlite3ExprVectorSize(pExpr->x.pList->a[1].pExpr);
98644 nRight = sqlite3ExprVectorSize(pExpr->pRight);
98646 if( nLeft!=nRight ){
168613 int nRight, /* Maximum difference in token positions */
168626 fts3PoslistPhraseMerge(&pTmp1, nRight, 0, 0, pp1, pp2);
170379 int nRight;
170386 nRight = nList;
170390 nRight = p->doclist.nAll;
170397 pTab->bDescIdx, nDiff, pLeft, nLeft, &pRight, &nRight
170401 p->doclist.nAll = nRight;
182817 int nRight; /* Tokens to the right of last highlight */
182821 for(nRight=0; !(hlmask & ((u64)1 << (nSnippet-1-nRight))); nRight++);
182822 assert( (nSnippet-1-nRight)<=63 && (nSnippet-1-nRight)>=0 );
182823 nDesired = (nLeft-nRight)/2;
189617 int nRight = nIdx-nLeft;
189622 SortByDistance(aRight, nRight, aDistance, aSpare);
189627 while( iLeft<nLeft || iRight<nRight ){
189631 }else if( iRight==nRight ){
189686 int nRight = nIdx-nLeft;
189691 SortByDimension(pRtree, aRight, nRight, iDim, aCell, aSpare);
189695 while( iLeft<nLeft || iRight<nRight ){
189700 if( (iLeft!=nLeft) && ((iRight==nRight)
194093 int nRight,
194098 res = ucol_strcoll(p, (UChar *)zLeft, nLeft/2, (UChar *)zRight, nRight/2);
206727 int nRight /* Number of bytes in rhs input */,
206740 rc = sqlite3changegroup_add(pGrp, nRight, pRight);
216168 const u8 *pRight, int nRight /* Right hand side of comparison */
216170 int nCmp = MIN(pLeft->n, nRight);
216172 return (res==0 ? (pLeft->n - nRight) : res);