Searched refs:nEq (Results 1 – 5 of 5) sorted by relevance
| /sqlite-3.40.0/src/ |
| H A D | wherecode.c | 89 u16 nEq = pLoop->u.btree.nEq; in explainIndexRange() local
95 for(i=0; i<nEq; i++){ in explainIndexRange()
585 int nEq = 0; in codeEqualityTerm() local
783 nEq = pLoop->u.btree.nEq; in codeAllEqualityTerms()
1294 u16 nEq = pLoop->u.btree.nEq; in filterPullDown() local
1717 u16 nEq = pLoop->u.btree.nEq; /* Number of == or IN terms */ in sqlite3WhereCodeOneLoopStart() local
1745 j = nEq; in sqlite3WhereCodeOneLoopStart()
1808 if( (nEq<pIdx->nColumn && bRev==(pIdx->aSortOrder[nEq]==SQLITE_SO_ASC)) ){ in sqlite3WhereCodeOneLoopStart()
1841 nConstraint = nEq; in sqlite3WhereCodeOneLoopStart()
1941 nConstraint = nEq; in sqlite3WhereCodeOneLoopStart()
[all …]
|
| H A D | where.c | 1697 int nEq = pLoop->u.btree.nEq; in whereRangeSkipScanEst() local
1814 int nEq = pLoop->u.btree.nEq; in whereRangeScanEst() local
1854 if( nEq==0 ){ in whereRangeScanEst()
1989 int nEq = pBuilder->pNew->u.btree.nEq; in whereEqualScanEst() local
1995 assert( nEq>=1 ); in whereEqualScanEst()
2009 if( nEq>=p->nColumn ){ in whereEqualScanEst()
2745 || pIdx->aSortOrder[i+nEq]!=pIdx->aSortOrder[nEq] in whereRangeVectorLen()
3020 int nEq = ++pNew->u.btree.nEq; in whereLoopAddBtreeIndex() local
3051 if( nEq==1 in whereLoopAddBtreeIndex()
3079 pNew->nOut += (pProbe->aiRowLogEst[nEq] - pProbe->aiRowLogEst[nEq-1]); in whereLoopAddBtreeIndex()
[all …]
|
| H A D | whereInt.h | 141 u16 nEq; /* Number of equality constraints */ member
|
| /sqlite-3.40.0/test/ |
| H A D | analyze9.test | 56 SELECT tbl,idx,nEq,nLt,nDLt,test_decode(sample) FROM sqlite_stat4;
67 SELECT tbl,idx,nEq,nLt,nDLt,s(sample) FROM sqlite_stat4;
120 # The first element in the "nEq" list of all samples should therefore be 10.
124 SELECT lindex(nEq, 0) FROM sqlite_stat4;
1194 # sample=('A', 70) nEq=(100, 2) nLt=(900, 970)
1195 # sample=('B', 70) nEq=(100, 2) nLt=(1000, 1070)
|
| /sqlite-3.40.0/ext/expert/ |
| H A D | sqlite3expert.c | 891 int nEq = 0; /* Number of elements in pEq */ in idxFindCompatible() local
895 for(pIter=pEq; pIter; pIter=pIter->pLink) nEq++; in idxFindCompatible()
914 if( iIdx<nEq ){ in idxFindCompatible()
|