Lines Matching refs:nRight
51703 int nRight = *pnRight;
51706 assert( nLeft>0 && nRight>0 );
51707 while( iRight<nRight || iLeft<nLeft ){
51712 && (iRight>=nRight || aContent[aLeft[iLeft]]<aContent[aRight[iRight]])
51724 assert( iRight>=nRight || aContent[aRight[iRight]]>dbpage );
138169 int nRight, /* Maximum difference in token positions */
138182 fts3PoslistPhraseMerge(&pTmp1, nRight, 0, 0, pp1, pp2);
139906 int nRight;
139913 nRight = nList;
139917 nRight = p->doclist.nAll;
139924 pTab->bDescIdx, nDiff, pLeft, nLeft, &pRight, &nRight
139928 p->doclist.nAll = nRight;
152224 int nRight; /* Tokens to the right of last highlight */
152228 for(nRight=0; !(hlmask & ((u64)1 << (nSnippet-1-nRight))); nRight++);
152229 nDesired = (nLeft-nRight)/2;
156033 int nRight = nIdx-nLeft;
156038 SortByDistance(aRight, nRight, aDistance, aSpare);
156043 while( iLeft<nLeft || iRight<nRight ){
156047 }else if( iRight==nRight ){
156102 int nRight = nIdx-nLeft;
156107 SortByDimension(pRtree, aRight, nRight, iDim, aCell, aSpare);
156111 while( iLeft<nLeft || iRight<nRight ){
156116 if( (iLeft!=nLeft) && ((iRight==nRight)
157937 int nRight,
157942 res = ucol_strcoll(p, (UChar *)zLeft, nLeft/2, (UChar *)zRight, nRight/2);
173046 ** Compare the contents of the pLeft buffer with the pRight/nRight blob.
173056 const u8 *pRight, int nRight /* Right hand side of comparison */
173058 int nCmp = MIN(pLeft->n, nRight);
173060 return (res==0 ? (pLeft->n - nRight) : res);
173082 const u8 *pRight, int nRight
173084 int nCmp = MIN(nLeft, nRight);
173086 return (res==0 ? (nLeft - nRight) : res);
