Lines Matching refs:nRight

69346   int nRight = *pnRight;  local
69349 assert( nLeft>0 && nRight>0 );
69350 while( iRight<nRight || iLeft<nLeft ){
69355 && (iRight>=nRight || aContent[aLeft[iLeft]]<aContent[aRight[iRight]])
69367 assert( iRight>=nRight || aContent[aRight[iRight]]>dbpage );
111927 int nLeft, nRight; local
111933 nRight = sqlite3ExprVectorSize(pExpr->x.pList->a[0].pExpr);
111934 if( nRight==nLeft ){
111935 nRight = sqlite3ExprVectorSize(pExpr->x.pList->a[1].pExpr);
111939 nRight = sqlite3ExprVectorSize(pExpr->pRight);
111941 if( nLeft!=nRight ){
196392 int nRight, /* Maximum difference in token positions */ argument
196405 fts3PoslistPhraseMerge(&pTmp1, nRight, 0, 0, pp1, pp2);
198230 int nRight; local
198237 nRight = nList;
198241 nRight = p->doclist.nAll;
198248 pTab->bDescIdx, nDiff, pLeft, nLeft, &pRight, &nRight
198252 p->doclist.nAll = nRight;
210831 int nRight; /* Tokens to the right of last highlight */ local
210835 for(nRight=0; !(hlmask & ((u64)1 << (nSnippet-1-nRight))); nRight++);
210836 assert( (nSnippet-1-nRight)<=63 && (nSnippet-1-nRight)>=0 );
210837 nDesired = (nLeft-nRight)/2;
215555 u32 nRight, /* Size of the right label in bytes */ argument
215579 if( nRight==0 ){
215584 int sz = sqlite3Utf8ReadLimited((u8*)zRight, nRight, &cRight);
215586 nRight -= sz;
215589 nRight--;
215592 u32 n = jsonUnescapeOneChar(zRight, nRight, &cRight);
215594 assert( n<=nRight );
215595 nRight -= n;
215611 u32 nRight, /* Size of the right label in bytes */ argument
215617 if( nLeft!=nRight ) return 0;
215621 zRight, nRight, rawRight);
220884 int nRight = nIdx-nLeft; local
220889 SortByDimension(pRtree, aRight, nRight, iDim, aCell, aSpare);
220893 while( iLeft<nLeft || iRight<nRight ){
220898 if( (iLeft!=nLeft) && ((iRight==nRight)
225243 int nRight, argument
225248 res = ucol_strcoll(p, (UChar *)zLeft, nLeft/2, (UChar *)zRight, nRight/2);
240545 int nRight /* Number of bytes in rhs input */, argument
240558 rc = sqlite3changegroup_add(pGrp, nRight, pRight);
251609 const u8 *pRight, int nRight /* Right hand side of comparison */ argument
251611 int nCmp = MIN(pLeft->n, nRight);
251613 return (res==0 ? (pLeft->n - nRight) : res);