Lines Matching refs:nEq
10006 u32 nEq; /* Number of == constraints */
97317 pLevel->plan.nEq = nColumn;
97369 assert( (u32)n==pLevel->plan.nEq );
97709 pCost->plan.nEq = 0;
97863 ** The nEq parameter is passed the index of the index column subject to the
97870 ** then nEq should be passed the value 1 (as the range restricted column,
97875 ** then nEq should be passed 0.
97879 ** approximately 1/100th (1%) of the rows selected by the nEq equality
97892 int nEq, /* index into p->aCol[] of the range-compared column */
97901 if( nEq==0 && p->aSample ){
97951 UNUSED_PARAMETER(nEq);
98068 ** nEq:
98121 int nEq;
98130 /* Determine the values of nEq and nInMul */
98131 for(nEq=0; nEq<pProbe->nColumn; nEq++){
98132 int j = pProbe->aiColumn[nEq];
98152 if( nEq<pProbe->nColumn ){
98153 int j = pProbe->aiColumn[nEq];
98157 whereRangeScanEst(pParse, pProbe, nEq, pBtm, pTop, &estBound);
98184 && isSortingIndex(pParse,pWC->pMaskSet,pProbe,iCur,pOrderBy,nEq,&rev)
98218 nRow = (double)(aiRowEst[nEq] * nInMul);
98221 nInMul = (int)(nRow / aiRowEst[nEq]);
98269 int nSkipEq = nEq; /* Number of == constraints to skip */
98279 /* Ignore the first nEq equality matches since the index
98307 "%s(%s): nEq=%d nInMul=%d estBound=%d bSort=%d bLookup=%d wsFlags=0x%x\n"
98310 nEq, nInMul, estBound, bSort, bLookup, wsFlags,
98324 pCost->plan.nEq = nEq;
98551 ** In the example above nEq==2. But this subroutine works for any value
98552 ** of nEq including 0. If nEq==0, this routine is nearly a no-op.
98560 ** this routine allocates an additional nEq memory cells for internal
98586 int nEq = pLevel->plan.nEq; /* The number of == or IN constraints to code */
98603 nReg = pLevel->plan.nEq + nExtraReg;
98613 assert( pIdx->nColumn>=nEq );
98614 for(j=0; j<nEq; j++){
98694 int nEq = pPlan->nEq;
98700 if( nEq==0 && (pPlan->wsFlags & (WHERE_BTM_LIMIT|WHERE_TOP_LIMIT))==0 ){
98706 for(i=0; i<nEq; i++){
98747 isSearch = (pLevel->plan.nEq>0)
99053 int nEq = pLevel->plan.nEq; /* Number of == or IN terms */
99072 k = pIdx->aiColumn[nEq]; /* Column for inequality constraints */
99079 ** the first one after the nEq equality constraints in the index,
99084 && (pIdx->nColumn>nEq)
99087 /* assert( pOrderBy->a[0].pExpr->iColumn==pIdx->aiColumn[nEq] ); */
99118 if( nEq<pIdx->nColumn && bRev==(pIdx->aSortOrder[nEq]==SQLITE_SO_ASC) ){
99128 start_constraints = pRangeStart || nEq>0;
99131 nConstraint = nEq;
99134 sqlite3ExprCode(pParse, pRight, regBase+nEq);
99135 sqlite3ExprCodeIsNullJump(v, pRight, regBase+nEq, addrNxt);
99137 if( sqlite3CompareAffinity(pRight, zStartAff[nEq])==SQLITE_AFF_NONE){
99141 zStartAff[nEq] = SQLITE_AFF_NONE;
99143 if( sqlite3ExprNeedsNoAffinityChange(pRight, zStartAff[nEq]) ){
99144 zStartAff[nEq] = SQLITE_AFF_NONE;
99150 sqlite3VdbeAddOp2(v, OP_Null, 0, regBase+nEq);
99169 nConstraint = nEq;
99172 sqlite3ExprCacheRemove(pParse, regBase+nEq, 1);
99173 sqlite3ExprCode(pParse, pRight, regBase+nEq);
99174 sqlite3ExprCodeIsNullJump(v, pRight, regBase+nEq, addrNxt);
99176 if( sqlite3CompareAffinity(pRight, zEndAff[nEq])==SQLITE_AFF_NONE){
99180 zEndAff[nEq] = SQLITE_AFF_NONE;
99182 if( sqlite3ExprNeedsNoAffinityChange(pRight, zEndAff[nEq]) ){
99183 zEndAff[nEq] = SQLITE_AFF_NONE;
99186 codeApplyAffinity(pParse, regBase, nEq+1, zEndAff);
99197 op = aEndOp[(pRangeEnd || nEq) * (1 + bRev)];
99214 sqlite3VdbeAddOp3(v, OP_Column, iIdxCur, nEq, r1);
99719 ** pWInfo->a[].nEq The number of == and IN constraints
