Lines Matching refs:nRight
60834 int nRight = *pnRight;
60837 assert( nLeft>0 && nRight>0 );
60838 while( iRight<nRight || iLeft<nLeft ){
60843 && (iRight>=nRight || aContent[aLeft[iLeft]]<aContent[aRight[iRight]])
60855 assert( iRight>=nRight || aContent[aRight[iRight]]>dbpage );
98649 int nLeft, nRight;
98654 nRight = sqlite3ExprVectorSize(pExpr->x.pList->a[0].pExpr);
98655 if( nRight==nLeft ){
98656 nRight = sqlite3ExprVectorSize(pExpr->x.pList->a[1].pExpr);
98660 nRight = sqlite3ExprVectorSize(pExpr->pRight);
98662 if( nLeft!=nRight ){
168629 int nRight, /* Maximum difference in token positions */
168642 fts3PoslistPhraseMerge(&pTmp1, nRight, 0, 0, pp1, pp2);
170407 int nRight;
170414 nRight = nList;
170418 nRight = p->doclist.nAll;
170425 pTab->bDescIdx, nDiff, pLeft, nLeft, &pRight, &nRight
170429 p->doclist.nAll = nRight;
182845 int nRight; /* Tokens to the right of last highlight */
182849 for(nRight=0; !(hlmask & ((u64)1 << (nSnippet-1-nRight))); nRight++);
182850 assert( (nSnippet-1-nRight)<=63 && (nSnippet-1-nRight)>=0 );
182851 nDesired = (nLeft-nRight)/2;
189645 int nRight = nIdx-nLeft;
189650 SortByDistance(aRight, nRight, aDistance, aSpare);
189655 while( iLeft<nLeft || iRight<nRight ){
189659 }else if( iRight==nRight ){
189714 int nRight = nIdx-nLeft;
189719 SortByDimension(pRtree, aRight, nRight, iDim, aCell, aSpare);
189723 while( iLeft<nLeft || iRight<nRight ){
189728 if( (iLeft!=nLeft) && ((iRight==nRight)
194121 int nRight,
194126 res = ucol_strcoll(p, (UChar *)zLeft, nLeft/2, (UChar *)zRight, nRight/2);
206755 int nRight /* Number of bytes in rhs input */,
206768 rc = sqlite3changegroup_add(pGrp, nRight, pRight);
216196 const u8 *pRight, int nRight /* Right hand side of comparison */
216198 int nCmp = MIN(pLeft->n, nRight);
216200 return (res==0 ? (pLeft->n - nRight) : res);