Lines Matching refs:nLeft

51695   int nLeft,                      /* IN: Elements in array *paLeft */
51706   assert( nLeft>0 && nRight>0 );
51707   while( iRight<nRight || iLeft<nLeft ){
51711     if( (iLeft<nLeft) 
51721     if( iLeft<nLeft && aContent[aLeft[iLeft]]==dbpage ) iLeft++;
51723     assert( iLeft>=nLeft || aContent[aLeft[iLeft]]>dbpage );
138170   int nLeft,                      /* Maximum difference in token positions */
138186   fts3PoslistPhraseMerge(&pTmp2, nLeft, 1, 0, pp2, pp1);
138399   char *aLeft, int nLeft,         /* Left doclist */
138406   char *pEnd1 = &aLeft[nLeft];
139905     int nLeft;
139911       nLeft = p->doclist.nAll;
139919       nLeft = nList;
139924         pTab->bDescIdx, nDiff, pLeft, nLeft, &pRight, &nRight
152223     int nLeft;                    /* Tokens to the left of first highlight */
152227     for(nLeft=0; !(hlmask & ((u64)1 << nLeft)); nLeft++);
152229     nDesired = (nLeft-nRight)/2;
156032     int nLeft = nIdx/2;
156033     int nRight = nIdx-nLeft;
156035     int *aRight = &aIdx[nLeft];
156037     SortByDistance(aLeft, nLeft, aDistance, aSpare);
156040     memcpy(aSpare, aLeft, sizeof(int)*nLeft);
156043     while( iLeft<nLeft || iRight<nRight ){
156044       if( iLeft==nLeft ){
156101     int nLeft = nIdx/2;
156102     int nRight = nIdx-nLeft;
156104     int *aRight = &aIdx[nLeft];
156106     SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare);
156109     memcpy(aSpare, aLeft, sizeof(int)*nLeft);
156111     while( iLeft<nLeft || iRight<nRight ){
156116       if( (iLeft!=nLeft) && ((iRight==nRight)
156187     int nLeft;
156190       nLeft=RTREE_MINCELLS(pRtree); 
156191       nLeft<=(nCell-RTREE_MINCELLS(pRtree)); 
156192       nLeft++
156203         if( kk<nLeft ){
156213       if( (nLeft==RTREE_MINCELLS(pRtree))
156217         iBestLeft = nLeft;
157935   int nLeft,
157942   res = ucol_strcoll(p, (UChar *)zLeft, nLeft/2, (UChar *)zRight, nRight/2);
173081   const u8 *pLeft, int nLeft, 
173084   int nCmp = MIN(nLeft, nRight);
173086   return (res==0 ? (nLeft - nRight) : res);