• Home
  • Raw
  • Download

Lines Matching refs:nLeft

60826   int nLeft,                      /* IN: Elements in array *paLeft */
60837 assert( nLeft>0 && nRight>0 );
60838 while( iRight<nRight || iLeft<nLeft ){
60842 if( (iLeft<nLeft)
60852 if( iLeft<nLeft && aContent[aLeft[iLeft]]==dbpage ) iLeft++;
60854 assert( iLeft>=nLeft || aContent[aLeft[iLeft]]>dbpage );
98649 int nLeft, nRight;
98652 nLeft = sqlite3ExprVectorSize(pExpr->pLeft);
98655 if( nRight==nLeft ){
98662 if( nLeft!=nRight ){
100110 int nLeft = sqlite3ExprVectorSize(pLeft);
100120 if( nLeft!=sqlite3ExprVectorSize(pRight) ){
100145 assert( i>=0 && i<nLeft );
100157 if( i==nLeft-1 ){
100173 if( i==nLeft-2 ) opx = op;
144399 int nLeft; /* Number of elements on left side vector */
144686 && (nLeft = sqlite3ExprVectorSize(pExpr->pLeft))>1
144687 && sqlite3ExprVectorSize(pExpr->pRight)==nLeft
144692 for(i=0; i<nLeft; i++){
168630 int nLeft, /* Maximum difference in token positions */
168646 fts3PoslistPhraseMerge(&pTmp2, nLeft, 1, 0, pp2, pp1);
168872 char *aLeft, int nLeft, /* Left doclist */
168879 char *pEnd1 = &aLeft[nLeft];
170406 int nLeft;
170412 nLeft = p->doclist.nAll;
170420 nLeft = nList;
170425 pTab->bDescIdx, nDiff, pLeft, nLeft, &pRight, &nRight
182844 int nLeft; /* Tokens to the left of first highlight */
182848 for(nLeft=0; !(hlmask & ((u64)1 << nLeft)); nLeft++);
182851 nDesired = (nLeft-nRight)/2;
189644 int nLeft = nIdx/2;
189645 int nRight = nIdx-nLeft;
189647 int *aRight = &aIdx[nLeft];
189649 SortByDistance(aLeft, nLeft, aDistance, aSpare);
189652 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
189655 while( iLeft<nLeft || iRight<nRight ){
189656 if( iLeft==nLeft ){
189713 int nLeft = nIdx/2;
189714 int nRight = nIdx-nLeft;
189716 int *aRight = &aIdx[nLeft];
189718 SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare);
189721 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
189723 while( iLeft<nLeft || iRight<nRight ){
189728 if( (iLeft!=nLeft) && ((iRight==nRight)
189799 int nLeft;
189802 nLeft=RTREE_MINCELLS(pRtree);
189803 nLeft<=(nCell-RTREE_MINCELLS(pRtree));
189804 nLeft++
189815 if( kk<nLeft ){
189825 if( (nLeft==RTREE_MINCELLS(pRtree))
189829 iBestLeft = nLeft;
194119 int nLeft,
194126 res = ucol_strcoll(p, (UChar *)zLeft, nLeft/2, (UChar *)zRight, nRight/2);
206753 int nLeft, /* Number of bytes in lhs input */
206765 rc = sqlite3changegroup_add(pGrp, nLeft, pLeft);