Lines Matching defs:nLeft
46751 int nLeft, /* IN: Elements in array *paLeft */
46762 assert( nLeft>0 && nRight>0 );
46763 while( iRight<nRight || iLeft<nLeft ){
46767 if( (iLeft<nLeft)
46777 if( iLeft<nLeft && aContent[aLeft[iLeft]]==dbpage ) iLeft++;
46779 assert( iLeft>=nLeft || aContent[aLeft[iLeft]]>dbpage );
118796 int nLeft, /* Maximum difference in token positions */
118812 fts3PoslistPhraseMerge(&pTmp2, nLeft, 1, 0, pp2, pp1);
119025 char *aLeft, int nLeft, /* Left doclist */
119031 char *pEnd1 = &aLeft[nLeft];
120356 int nLeft;
120362 nLeft = p->doclist.nAll;
120370 nLeft = nList;
120374 fts3DoclistPhraseMerge(pTab->bDescIdx, nDiff, pLeft, nLeft, pRight,&nRight);
129203 int nLeft; /* Tokens to the left of first highlight */
129207 for(nLeft=0; !(hlmask & ((u64)1 << nLeft)); nLeft++);
129209 nDesired = (nLeft-nRight)/2;
132039 int nLeft = nIdx/2;
132040 int nRight = nIdx-nLeft;
132042 int *aRight = &aIdx[nLeft];
132044 SortByDistance(aLeft, nLeft, aDistance, aSpare);
132047 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
132050 while( iLeft<nLeft || iRight<nRight ){
132051 if( iLeft==nLeft ){
132108 int nLeft = nIdx/2;
132109 int nRight = nIdx-nLeft;
132111 int *aRight = &aIdx[nLeft];
132113 SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare);
132116 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
132118 while( iLeft<nLeft || iRight<nRight ){
132123 if( (iLeft!=nLeft) && ((iRight==nRight)
132195 int nLeft;
132198 nLeft=RTREE_MINCELLS(pRtree);
132199 nLeft<=(nCell-RTREE_MINCELLS(pRtree));
132200 nLeft++
132211 if( kk<nLeft ){
132221 if( (nLeft==RTREE_MINCELLS(pRtree))
132225 iBestLeft = nLeft;
133829 int nLeft,
133836 res = ucol_strcoll(p, (UChar *)zLeft, nLeft/2, (UChar *)zRight, nRight/2);
