Home | History | Annotate | Download | only in dist

Lines Matching defs:nLeft

56069   int nLeft,                      /* IN: Elements in array *paLeft */
56080 assert( nLeft>0 && nRight>0 );
56081 while( iRight<nRight || iLeft<nLeft ){
56085 if( (iLeft<nLeft)
56095 if( iLeft<nLeft && aContent[aLeft[iLeft]]==dbpage ) iLeft++;
56097 assert( iLeft>=nLeft || aContent[aLeft[iLeft]]>dbpage );
90332 int nLeft, nRight;
90335 nLeft = sqlite3ExprVectorSize(pExpr->pLeft);
90338 if( nRight==nLeft ){
90345 if( nLeft!=nRight ){
91604 int nLeft = sqlite3ExprVectorSize(pLeft);
91611 if( nLeft!=sqlite3ExprVectorSize(pRight) ){
91636 assert( i>=0 && i<nLeft );
91650 if( i==nLeft-1 ){
91666 if( i==nLeft-2 ) opx = op;
130002 int nLeft; /* Number of elements on left side vector */
130278 && (nLeft = sqlite3ExprVectorSize(pExpr->pLeft))>1
130279 && sqlite3ExprVectorSize(pExpr->pRight)==nLeft
130284 for(i=0; i<nLeft; i++){
148298 int nLeft, /* Maximum difference in token positions */
148314 fts3PoslistPhraseMerge(&pTmp2, nLeft, 1, 0, pp2, pp1);
148527 char *aLeft, int nLeft, /* Left doclist */
148534 char *pEnd1 = &aLeft[nLeft];
150045 int nLeft;
150051 nLeft = p->doclist.nAll;
150059 nLeft = nList;
150064 pTab->bDescIdx, nDiff, pLeft, nLeft, &pRight, &nRight
162386 int nLeft; /* Tokens to the left of first highlight */
162390 for(nLeft=0; !(hlmask & ((u64)1 << nLeft)); nLeft++);
162392 nDesired = (nLeft-nRight)/2;
166382 int nLeft = nIdx/2;
166383 int nRight = nIdx-nLeft;
166385 int *aRight = &aIdx[nLeft];
166387 SortByDistance(aLeft, nLeft, aDistance, aSpare);
166390 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
166393 while( iLeft<nLeft || iRight<nRight ){
166394 if( iLeft==nLeft ){
166451 int nLeft = nIdx/2;
166452 int nRight = nIdx-nLeft;
166454 int *aRight = &aIdx[nLeft];
166456 SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare);
166459 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
166461 while( iLeft<nLeft || iRight<nRight ){
166466 if( (iLeft!=nLeft) && ((iRight==nRight)
166537 int nLeft;
166540 nLeft=RTREE_MINCELLS(pRtree);
166541 nLeft<=(nCell-RTREE_MINCELLS(pRtree));
166542 nLeft++
166553 if( kk<nLeft ){
166563 if( (nLeft==RTREE_MINCELLS(pRtree))
166567 iBestLeft = nLeft;
168430 int nLeft,
168437 res = ucol_strcoll(p, (UChar *)zLeft, nLeft/2, (UChar *)zRight, nRight/2);
179511 int nLeft, /* Number of bytes in lhs input */
179523 rc = sqlite3changegroup_add(pGrp, nLeft, pLeft);