• Home
  • Raw
  • Download

Lines Matching refs:nLeft

60810   int nLeft,                      /* IN: Elements in array *paLeft */
60821 assert( nLeft>0 && nRight>0 );
60822 while( iRight<nRight || iLeft<nLeft ){
60826 if( (iLeft<nLeft)
60836 if( iLeft<nLeft && aContent[aLeft[iLeft]]==dbpage ) iLeft++;
60838 assert( iLeft>=nLeft || aContent[aLeft[iLeft]]>dbpage );
98633 int nLeft, nRight;
98636 nLeft = sqlite3ExprVectorSize(pExpr->pLeft);
98639 if( nRight==nLeft ){
98646 if( nLeft!=nRight ){
100094 int nLeft = sqlite3ExprVectorSize(pLeft);
100104 if( nLeft!=sqlite3ExprVectorSize(pRight) ){
100129 assert( i>=0 && i<nLeft );
100141 if( i==nLeft-1 ){
100157 if( i==nLeft-2 ) opx = op;
144383 int nLeft; /* Number of elements on left side vector */
144670 && (nLeft = sqlite3ExprVectorSize(pExpr->pLeft))>1
144671 && sqlite3ExprVectorSize(pExpr->pRight)==nLeft
144676 for(i=0; i<nLeft; i++){
168614 int nLeft, /* Maximum difference in token positions */
168630 fts3PoslistPhraseMerge(&pTmp2, nLeft, 1, 0, pp2, pp1);
168856 char *aLeft, int nLeft, /* Left doclist */
168863 char *pEnd1 = &aLeft[nLeft];
170378 int nLeft;
170384 nLeft = p->doclist.nAll;
170392 nLeft = nList;
170397 pTab->bDescIdx, nDiff, pLeft, nLeft, &pRight, &nRight
182816 int nLeft; /* Tokens to the left of first highlight */
182820 for(nLeft=0; !(hlmask & ((u64)1 << nLeft)); nLeft++);
182823 nDesired = (nLeft-nRight)/2;
189616 int nLeft = nIdx/2;
189617 int nRight = nIdx-nLeft;
189619 int *aRight = &aIdx[nLeft];
189621 SortByDistance(aLeft, nLeft, aDistance, aSpare);
189624 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
189627 while( iLeft<nLeft || iRight<nRight ){
189628 if( iLeft==nLeft ){
189685 int nLeft = nIdx/2;
189686 int nRight = nIdx-nLeft;
189688 int *aRight = &aIdx[nLeft];
189690 SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare);
189693 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
189695 while( iLeft<nLeft || iRight<nRight ){
189700 if( (iLeft!=nLeft) && ((iRight==nRight)
189771 int nLeft;
189774 nLeft=RTREE_MINCELLS(pRtree);
189775 nLeft<=(nCell-RTREE_MINCELLS(pRtree));
189776 nLeft++
189787 if( kk<nLeft ){
189797 if( (nLeft==RTREE_MINCELLS(pRtree))
189801 iBestLeft = nLeft;
194091 int nLeft,
194098 res = ucol_strcoll(p, (UChar *)zLeft, nLeft/2, (UChar *)zRight, nRight/2);
206725 int nLeft, /* Number of bytes in lhs input */
206737 rc = sqlite3changegroup_add(pGrp, nLeft, pLeft);