Lines Matching defs:nLeft
46723 int nLeft, /* IN: Elements in array *paLeft */
46734 assert( nLeft>0 && nRight>0 );
46735 while( iRight<nRight || iLeft<nLeft ){
46739 if( (iLeft<nLeft)
46749 if( iLeft<nLeft && aContent[aLeft[iLeft]]==dbpage ) iLeft++;
46751 assert( iLeft>=nLeft || aContent[aLeft[iLeft]]>dbpage );
118760 int nLeft, /* Maximum difference in token positions */
118776 fts3PoslistPhraseMerge(&pTmp2, nLeft, 1, 0, pp2, pp1);
118989 char *aLeft, int nLeft, /* Left doclist */
118995 char *pEnd1 = &aLeft[nLeft];
120308 int nLeft;
120314 nLeft = p->doclist.nAll;
120322 nLeft = nList;
120326 fts3DoclistPhraseMerge(pTab->bDescIdx, nDiff, pLeft, nLeft, pRight,&nRight);
129155 int nLeft; /* Tokens to the left of first highlight */
129159 for(nLeft=0; !(hlmask & ((u64)1 << nLeft)); nLeft++);
129161 nDesired = (nLeft-nRight)/2;
131991 int nLeft = nIdx/2;
131992 int nRight = nIdx-nLeft;
131994 int *aRight = &aIdx[nLeft];
131996 SortByDistance(aLeft, nLeft, aDistance, aSpare);
131999 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
132002 while( iLeft<nLeft || iRight<nRight ){
132003 if( iLeft==nLeft ){
132060 int nLeft = nIdx/2;
132061 int nRight = nIdx-nLeft;
132063 int *aRight = &aIdx[nLeft];
132065 SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare);
132068 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
132070 while( iLeft<nLeft || iRight<nRight ){
132075 if( (iLeft!=nLeft) && ((iRight==nRight)
132147 int nLeft;
132150 nLeft=RTREE_MINCELLS(pRtree);
132151 nLeft<=(nCell-RTREE_MINCELLS(pRtree));
132152 nLeft++
132163 if( kk<nLeft ){
132173 if( (nLeft==RTREE_MINCELLS(pRtree))
132177 iBestLeft = nLeft;
133781 int nLeft,
133788 res = ucol_strcoll(p, (UChar *)zLeft, nLeft/2, (UChar *)zRight, nRight/2);
