• Home
  • Raw
  • Download

Lines Matching refs:nLeft

56074   int nLeft,                      /* IN: Elements in array *paLeft */
56085 assert( nLeft>0 && nRight>0 );
56086 while( iRight<nRight || iLeft<nLeft ){
56090 if( (iLeft<nLeft)
56100 if( iLeft<nLeft && aContent[aLeft[iLeft]]==dbpage ) iLeft++;
56102 assert( iLeft>=nLeft || aContent[aLeft[iLeft]]>dbpage );
90349 int nLeft, nRight;
90352 nLeft = sqlite3ExprVectorSize(pExpr->pLeft);
90355 if( nRight==nLeft ){
90362 if( nLeft!=nRight ){
91621 int nLeft = sqlite3ExprVectorSize(pLeft);
91628 if( nLeft!=sqlite3ExprVectorSize(pRight) ){
91653 assert( i>=0 && i<nLeft );
91667 if( i==nLeft-1 ){
91683 if( i==nLeft-2 ) opx = op;
130019 int nLeft; /* Number of elements on left side vector */
130295 && (nLeft = sqlite3ExprVectorSize(pExpr->pLeft))>1
130296 && sqlite3ExprVectorSize(pExpr->pRight)==nLeft
130301 for(i=0; i<nLeft; i++){
148315 int nLeft, /* Maximum difference in token positions */
148331 fts3PoslistPhraseMerge(&pTmp2, nLeft, 1, 0, pp2, pp1);
148544 char *aLeft, int nLeft, /* Left doclist */
148551 char *pEnd1 = &aLeft[nLeft];
150048 int nLeft;
150054 nLeft = p->doclist.nAll;
150062 nLeft = nList;
150067 pTab->bDescIdx, nDiff, pLeft, nLeft, &pRight, &nRight
162398 int nLeft; /* Tokens to the left of first highlight */
162402 for(nLeft=0; !(hlmask & ((u64)1 << nLeft)); nLeft++);
162404 nDesired = (nLeft-nRight)/2;
166394 int nLeft = nIdx/2;
166395 int nRight = nIdx-nLeft;
166397 int *aRight = &aIdx[nLeft];
166399 SortByDistance(aLeft, nLeft, aDistance, aSpare);
166402 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
166405 while( iLeft<nLeft || iRight<nRight ){
166406 if( iLeft==nLeft ){
166463 int nLeft = nIdx/2;
166464 int nRight = nIdx-nLeft;
166466 int *aRight = &aIdx[nLeft];
166468 SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare);
166471 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
166473 while( iLeft<nLeft || iRight<nRight ){
166478 if( (iLeft!=nLeft) && ((iRight==nRight)
166549 int nLeft;
166552 nLeft=RTREE_MINCELLS(pRtree);
166553 nLeft<=(nCell-RTREE_MINCELLS(pRtree));
166554 nLeft++
166565 if( kk<nLeft ){
166575 if( (nLeft==RTREE_MINCELLS(pRtree))
166579 iBestLeft = nLeft;
168442 int nLeft,
168449 res = ucol_strcoll(p, (UChar *)zLeft, nLeft/2, (UChar *)zRight, nRight/2);
179523 int nLeft, /* Number of bytes in lhs input */
179535 rc = sqlite3changegroup_add(pGrp, nLeft, pLeft);