Home | History | Annotate | Download | only in amalgamation

Lines Matching defs: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 );
114786 int nLeft, /* Maximum difference in token positions */
114797 return fts3PoslistPhraseMerge(0, nLeft, 0, 0, pp2, pp1);
114808 fts3PoslistPhraseMerge(&pTmp2, nLeft, 1, 0, pp2, pp1);
115554 int nLeft, nRight;
115568 nLeft = nOut;
115577 nLeft = nList;
115582 mt, nDist, 0, pOut, &nOut, aLeft, nLeft, aRight, nRight, &nDoc
115615 int nLeft, /* Size of LHS doclist in bytes */
115627 aOut = sqlite3_malloc(nLeft+nRight+1);
115632 aOut, pnOut, aLeft, nLeft, aRight, nRight, 0
115932 int nLeft;
115942 && 0==(rc = fts3EvalExpr(p, pExpr->pLeft, &aLeft, &nLeft, isReqPos))
115961 pLeft->pPhrase->nToken, aLeft, nLeft,
115975 char *aBuffer = sqlite3_malloc(nRight+nLeft+1);
115977 aLeft, nLeft, aRight, nRight, 0
115987 aLeft, nLeft, aRight, nRight, 0
123239 int nLeft; /* Tokens to the left of first highlight */
123243 for(nLeft=0; !(hlmask & ((u64)1 << nLeft)); nLeft++);
123245 nDesired = (nLeft-nRight)/2;
126141 int nLeft = nIdx/2;
126142 int nRight = nIdx-nLeft;
126144 int *aRight = &aIdx[nLeft];
126146 SortByDistance(aLeft, nLeft, aDistance, aSpare);
126149 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
126152 while( iLeft<nLeft || iRight<nRight ){
126153 if( iLeft==nLeft ){
126210 int nLeft = nIdx/2;
126211 int nRight = nIdx-nLeft;
126213 int *aRight = &aIdx[nLeft];
126215 SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare);
126218 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
126220 while( iLeft<nLeft || iRight<nRight ){
126225 if( (iLeft!=nLeft) && ((iRight==nRight)
126297 int nLeft;
126300 nLeft=RTREE_MINCELLS(pRtree);
126301 nLeft<=(nCell-RTREE_MINCELLS(pRtree));
126302 nLeft++
126313 if( kk<nLeft ){
126323 if( (nLeft==RTREE_MINCELLS(pRtree))
126327 iBestLeft = nLeft;
127888 int nLeft,
127895 res = ucol_strcoll(p, (UChar *)zLeft, nLeft/2, (UChar *)zRight, nRight/2);