Lines Matching refs:nLeft
48873 int nLeft, /* IN: Elements in array *paLeft */
48884 assert( nLeft>0 && nRight>0 );
48885 while( iRight<nRight || iLeft<nLeft ){
48889 if( (iLeft<nLeft)
48899 if( iLeft<nLeft && aContent[aLeft[iLeft]]==dbpage ) iLeft++;
48901 assert( iLeft>=nLeft || aContent[aLeft[iLeft]]>dbpage );
129101 int nLeft, /* Maximum difference in token positions */
129117 fts3PoslistPhraseMerge(&pTmp2, nLeft, 1, 0, pp2, pp1);
129330 char *aLeft, int nLeft, /* Left doclist */
129336 char *pEnd1 = &aLeft[nLeft];
130776 int nLeft;
130782 nLeft = p->doclist.nAll;
130790 nLeft = nList;
130794 fts3DoclistPhraseMerge(pTab->bDescIdx, nDiff, pLeft, nLeft, pRight,&nRight);
142910 int nLeft; /* Tokens to the left of first highlight */
142914 for(nLeft=0; !(hlmask & ((u64)1 << nLeft)); nLeft++);
142916 nDesired = (nLeft-nRight)/2;
146626 int nLeft = nIdx/2;
146627 int nRight = nIdx-nLeft;
146629 int *aRight = &aIdx[nLeft];
146631 SortByDistance(aLeft, nLeft, aDistance, aSpare);
146634 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
146637 while( iLeft<nLeft || iRight<nRight ){
146638 if( iLeft==nLeft ){
146695 int nLeft = nIdx/2;
146696 int nRight = nIdx-nLeft;
146698 int *aRight = &aIdx[nLeft];
146700 SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare);
146703 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
146705 while( iLeft<nLeft || iRight<nRight ){
146710 if( (iLeft!=nLeft) && ((iRight==nRight)
146781 int nLeft;
146784 nLeft=RTREE_MINCELLS(pRtree);
146785 nLeft<=(nCell-RTREE_MINCELLS(pRtree));
146786 nLeft++
146797 if( kk<nLeft ){
146807 if( (nLeft==RTREE_MINCELLS(pRtree))
146811 iBestLeft = nLeft;
148496 int nLeft,
148503 res = ucol_strcoll(p, (UChar *)zLeft, nLeft/2, (UChar *)zRight, nRight/2);
