Lines Matching refs:nRight

51721   int nRight = *pnRight;
51724   assert( nLeft>0 && nRight>0 );
51725   while( iRight<nRight || iLeft<nLeft ){
51730      && (iRight>=nRight || aContent[aLeft[iLeft]]<aContent[aRight[iRight]])
51742     assert( iRight>=nRight || aContent[aRight[iRight]]>dbpage );
138187   int nRight,                     /* Maximum difference in token positions */
138200   fts3PoslistPhraseMerge(&pTmp1, nRight, 0, 0, pp1, pp2);
139936     int nRight;
139943       nRight = nList;
139947       nRight = p->doclist.nAll;
139954         pTab->bDescIdx, nDiff, pLeft, nLeft, &pRight, &nRight
139958     p->doclist.nAll = nRight;
152254     int nRight;                   /* Tokens to the right of last highlight */
152258     for(nRight=0; !(hlmask & ((u64)1 << (nSnippet-1-nRight))); nRight++);
152259     nDesired = (nLeft-nRight)/2;
156063     int nRight = nIdx-nLeft;
156068     SortByDistance(aRight, nRight, aDistance, aSpare);
156073     while( iLeft<nLeft || iRight<nRight ){
156077       }else if( iRight==nRight ){
156132     int nRight = nIdx-nLeft;
156137     SortByDimension(pRtree, aRight, nRight, iDim, aCell, aSpare);
156141     while( iLeft<nLeft || iRight<nRight ){
156146       if( (iLeft!=nLeft) && ((iRight==nRight)
157967   int nRight,
157972   res = ucol_strcoll(p, (UChar *)zLeft, nLeft/2, (UChar *)zRight, nRight/2);
173086   const u8 *pRight, int nRight    /* Right hand side of comparison */
173088   int nCmp = MIN(pLeft->n, nRight);
173090   return (res==0 ? (pLeft->n - nRight) : res);
173112   const u8 *pRight, int nRight
173114   int nCmp = MIN(nLeft, nRight);
173116   return (res==0 ? (nLeft - nRight) : res);