Home | History | Annotate | Download | only in amalgamation

Lines Matching refs:nLeft

44636   int nLeft,                      /* IN: Elements in array *paLeft */
44647 assert( nLeft>0 && nRight>0 );
44648 while( iRight<nRight || iLeft<nLeft ){
44652 if( (iLeft<nLeft)
44662 if( iLeft<nLeft && aContent[aLeft[iLeft]]==dbpage ) iLeft++;
44664 assert( iLeft>=nLeft || aContent[aLeft[iLeft]]>dbpage );
114775 int nLeft, /* Maximum difference in token positions */
114786 return fts3PoslistPhraseMerge(0, nLeft, 0, 0, pp2, pp1);
114797 fts3PoslistPhraseMerge(&pTmp2, nLeft, 1, 0, pp2, pp1);
115543 int nLeft, nRight;
115557 nLeft = nOut;
115566 nLeft = nList;
115571 mt, nDist, 0, pOut, &nOut, aLeft, nLeft, aRight, nRight, &nDoc
115604 int nLeft, /* Size of LHS doclist in bytes */
115616 aOut = sqlite3_malloc(nLeft+nRight+1);
115621 aOut, pnOut, aLeft, nLeft, aRight, nRight, 0
115921 int nLeft;
115931 && 0==(rc = fts3EvalExpr(p, pExpr->pLeft, &aLeft, &nLeft, isReqPos))
115950 pLeft->pPhrase->nToken, aLeft, nLeft,
115964 char *aBuffer = sqlite3_malloc(nRight+nLeft+1);
115966 aLeft, nLeft, aRight, nRight, 0
115976 aLeft, nLeft, aRight, nRight, 0
123228 int nLeft; /* Tokens to the left of first highlight */
123232 for(nLeft=0; !(hlmask & ((u64)1 << nLeft)); nLeft++);
123234 nDesired = (nLeft-nRight)/2;
126130 int nLeft = nIdx/2;
126131 int nRight = nIdx-nLeft;
126133 int *aRight = &aIdx[nLeft];
126135 SortByDistance(aLeft, nLeft, aDistance, aSpare);
126138 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
126141 while( iLeft<nLeft || iRight<nRight ){
126142 if( iLeft==nLeft ){
126199 int nLeft = nIdx/2;
126200 int nRight = nIdx-nLeft;
126202 int *aRight = &aIdx[nLeft];
126204 SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare);
126207 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
126209 while( iLeft<nLeft || iRight<nRight ){
126214 if( (iLeft!=nLeft) && ((iRight==nRight)
126286 int nLeft;
126289 nLeft=RTREE_MINCELLS(pRtree);
126290 nLeft<=(nCell-RTREE_MINCELLS(pRtree));
126291 nLeft++
126302 if( kk<nLeft ){
126312 if( (nLeft==RTREE_MINCELLS(pRtree))
126316 iBestLeft = nLeft;
127877 int nLeft,
127884 res = ucol_strcoll(p, (UChar *)zLeft, nLeft/2, (UChar *)zRight, nRight/2);