Lines Matching refs:nLeft
42124 int nLeft, /* IN: Elements in array *paLeft */
42135 assert( nLeft>0 && nRight>0 );
42136 while( iRight<nRight || iLeft<nLeft ){
42140 if( (iLeft<nLeft)
42150 if( iLeft<nLeft && aContent[aLeft[iLeft]]==dbpage ) iLeft++;
42152 assert( iLeft>=nLeft || aContent[aLeft[iLeft]]>dbpage );
108176 int nLeft, /* Maximum difference in token positions */
108187 return fts3PoslistPhraseMerge(0, nLeft, 0, pp2, pp1);
108198 fts3PoslistPhraseMerge(&pTmp2, nLeft, 1, pp2, pp1);
108728 int nLeft, /* Size of LHS doclist in bytes */
108740 aOut = sqlite3_malloc(nLeft+nRight+1);
108745 aOut, pnOut, aLeft, nLeft, aRight, nRight
108823 int nLeft;
108827 && 0==(rc = evalFts3Expr(p, pExpr->pLeft, &aLeft, &nLeft, isReqPos))
108850 pLeft->pPhrase->nToken, aLeft, nLeft,
108864 char *aBuffer = sqlite3_malloc(nRight+nLeft+1);
108866 aLeft, nLeft, aRight, nRight
108876 aLeft, nLeft, aRight, nRight
115369 int nLeft; /* Tokens to the left of first highlight */
115373 for(nLeft=0; !(hlmask & ((u64)1 << nLeft)); nLeft++);
115375 nDesired = (nLeft-nRight)/2;
117612 int nLeft = nIdx/2;
117613 int nRight = nIdx-nLeft;
117615 int *aRight = &aIdx[nLeft];
117617 SortByDistance(aLeft, nLeft, aDistance, aSpare);
117620 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
117623 while( iLeft<nLeft || iRight<nRight ){
117624 if( iLeft==nLeft ){
117681 int nLeft = nIdx/2;
117682 int nRight = nIdx-nLeft;
117684 int *aRight = &aIdx[nLeft];
117686 SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare);
117689 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
117691 while( iLeft<nLeft || iRight<nRight ){
117696 if( (iLeft!=nLeft) && ((iRight==nRight)
117768 int nLeft;
117771 nLeft=RTREE_MINCELLS(pRtree);
117772 nLeft<=(nCell-RTREE_MINCELLS(pRtree));
117773 nLeft++
117784 if( kk<nLeft ){
117794 if( (nLeft==RTREE_MINCELLS(pRtree))
117798 iBestLeft = nLeft;
119257 int nLeft,
119264 res = ucol_strcoll(p, (UChar *)zLeft, nLeft/2, (UChar *)zRight, nRight/2);