Lines Matching refs:nLeft
48893 int nLeft, /* IN: Elements in array *paLeft */
48904 assert( nLeft>0 && nRight>0 );
48905 while( iRight<nRight || iLeft<nLeft ){
48909 if( (iLeft<nLeft)
48919 if( iLeft<nLeft && aContent[aLeft[iLeft]]==dbpage ) iLeft++;
48921 assert( iLeft>=nLeft || aContent[aLeft[iLeft]]>dbpage );
129121 int nLeft, /* Maximum difference in token positions */
129137 fts3PoslistPhraseMerge(&pTmp2, nLeft, 1, 0, pp2, pp1);
129350 char *aLeft, int nLeft, /* Left doclist */
129356 char *pEnd1 = &aLeft[nLeft];
130808 int nLeft;
130814 nLeft = p->doclist.nAll;
130822 nLeft = nList;
130826 fts3DoclistPhraseMerge(pTab->bDescIdx, nDiff, pLeft, nLeft, pRight,&nRight);
142942 int nLeft; /* Tokens to the left of first highlight */
142946 for(nLeft=0; !(hlmask & ((u64)1 << nLeft)); nLeft++);
142948 nDesired = (nLeft-nRight)/2;
146658 int nLeft = nIdx/2;
146659 int nRight = nIdx-nLeft;
146661 int *aRight = &aIdx[nLeft];
146663 SortByDistance(aLeft, nLeft, aDistance, aSpare);
146666 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
146669 while( iLeft<nLeft || iRight<nRight ){
146670 if( iLeft==nLeft ){
146727 int nLeft = nIdx/2;
146728 int nRight = nIdx-nLeft;
146730 int *aRight = &aIdx[nLeft];
146732 SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare);
146735 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
146737 while( iLeft<nLeft || iRight<nRight ){
146742 if( (iLeft!=nLeft) && ((iRight==nRight)
146813 int nLeft;
146816 nLeft=RTREE_MINCELLS(pRtree);
146817 nLeft<=(nCell-RTREE_MINCELLS(pRtree));
146818 nLeft++
146829 if( kk<nLeft ){
146839 if( (nLeft==RTREE_MINCELLS(pRtree))
146843 iBestLeft = nLeft;
148528 int nLeft,
148535 res = ucol_strcoll(p, (UChar *)zLeft, nLeft/2, (UChar *)zRight, nRight/2);
