• Home
  • Raw
  • Download

Lines Matching refs:nLeft

57053   int nLeft,                      /* IN: Elements in array *paLeft */
57064 assert( nLeft>0 && nRight>0 );
57065 while( iRight<nRight || iLeft<nLeft ){
57069 if( (iLeft<nLeft)
57079 if( iLeft<nLeft && aContent[aLeft[iLeft]]==dbpage ) iLeft++;
57081 assert( iLeft>=nLeft || aContent[aLeft[iLeft]]>dbpage );
91948 int nLeft, nRight;
91951 nLeft = sqlite3ExprVectorSize(pExpr->pLeft);
91954 if( nRight==nLeft ){
91961 if( nLeft!=nRight ){
93238 int nLeft = sqlite3ExprVectorSize(pLeft);
93245 if( nLeft!=sqlite3ExprVectorSize(pRight) ){
93270 assert( i>=0 && i<nLeft );
93284 if( i==nLeft-1 ){
93300 if( i==nLeft-2 ) opx = op;
132363 int nLeft; /* Number of elements on left side vector */
132649 && (nLeft = sqlite3ExprVectorSize(pExpr->pLeft))>1
132650 && sqlite3ExprVectorSize(pExpr->pRight)==nLeft
132655 for(i=0; i<nLeft; i++){
151153 int nLeft, /* Maximum difference in token positions */
151169 fts3PoslistPhraseMerge(&pTmp2, nLeft, 1, 0, pp2, pp1);
151382 char *aLeft, int nLeft, /* Left doclist */
151389 char *pEnd1 = &aLeft[nLeft];
152889 int nLeft;
152895 nLeft = p->doclist.nAll;
152903 nLeft = nList;
152908 pTab->bDescIdx, nDiff, pLeft, nLeft, &pRight, &nRight
165240 int nLeft; /* Tokens to the left of first highlight */
165244 for(nLeft=0; !(hlmask & ((u64)1 << nLeft)); nLeft++);
165246 nDesired = (nLeft-nRight)/2;
169208 int nLeft = nIdx/2;
169209 int nRight = nIdx-nLeft;
169211 int *aRight = &aIdx[nLeft];
169213 SortByDistance(aLeft, nLeft, aDistance, aSpare);
169216 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
169219 while( iLeft<nLeft || iRight<nRight ){
169220 if( iLeft==nLeft ){
169277 int nLeft = nIdx/2;
169278 int nRight = nIdx-nLeft;
169280 int *aRight = &aIdx[nLeft];
169282 SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare);
169285 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
169287 while( iLeft<nLeft || iRight<nRight ){
169292 if( (iLeft!=nLeft) && ((iRight==nRight)
169363 int nLeft;
169366 nLeft=RTREE_MINCELLS(pRtree);
169367 nLeft<=(nCell-RTREE_MINCELLS(pRtree));
169368 nLeft++
169379 if( kk<nLeft ){
169389 if( (nLeft==RTREE_MINCELLS(pRtree))
169393 iBestLeft = nLeft;
171730 int nLeft,
171737 res = ucol_strcoll(p, (UChar *)zLeft, nLeft/2, (UChar *)zRight, nRight/2);
183531 int nLeft, /* Number of bytes in lhs input */
183543 rc = sqlite3changegroup_add(pGrp, nLeft, pLeft);