Lines Matching refs:anEq
16063 int nSampleCol; /* Size of IndexSample.anEq[] and so on */
16098 tRowcnt *anEq; /* Est. number of rows where the key equals this sample */
99102 tRowcnt *anEq; /* sqlite_stat4.nEq */
99127 int nMaxEqZero; /* Max leading 0 in anEq[] for any a[] entry */
99181 memcpy(pTo->anEq, pFrom->anEq, sizeof(tRowcnt)*p->nCol);
99255 + sizeof(tRowcnt)*nColUp /* Stat4Accum.anEq */
99275 p->current.anEq = &p->current.anDLt[nColUp];
99285 p->current.anLt = &p->current.anEq[nColUp];
99293 p->a[i].anEq = (tRowcnt *)pSpace; pSpace += (sizeof(tRowcnt) * nColUp);
99332 ** the anEq[] array from pSample->anEq[pSample->iCol+1] onwards are valid.
99343 if( pNew->anEq[i]>pOld->anEq[i] ) return 1;
99344 if( pNew->anEq[i]<pOld->anEq[i] ) return 0;
99356 ** the anEq[] array from pSample->anEq[pSample->iCol] onwards are valid.
99363 tRowcnt nEqNew = pNew->anEq[pNew->iCol];
99364 tRowcnt nEqOld = pOld->anEq[pOld->iCol];
99393 ** values in the anEq[] array of any sample in Stat4Accum.a[]. In
99395 ** are no samples with Stat4Sample.anEq[m]==0 for (m>=n). */
99401 assert( pNew->anEq[pNew->iCol]>0 );
99410 if( pOld->anEq[pNew->iCol]==0 ){
99421 pUpgrade->anEq[pUpgrade->iCol] = pNew->anEq[pUpgrade->iCol];
99430 tRowcnt *anEq = pMin->anEq;
99437 pSample->anEq = anEq;
99456 /* Zero the first nEqZero entries in the anEq[] array. */
99457 memset(pSample->anEq, 0, sizeof(tRowcnt)*nEqZero);
99479 ** index. The value of anEq[iChng] and subsequent anEq[] elements are
99490 pBest->anEq[i] = p->current.anEq[i];
99496 /* Check that no sample contains an anEq[] entry with an index of
99500 for(j=p->nMaxEqZero; j<p->nCol; j++) assert( p->a[i].anEq[j]>0 );
99503 /* Update the anEq[] fields of any samples already collected. */
99508 if( p->a[i].anEq[j]==0 ) p->a[i].anEq[j] = p->current.anEq[j];
99518 tRowcnt nEq = p->current.anEq[0];
99576 for(i=0; i<p->nCol; i++) p->current.anEq[i] = 1;
99581 /* Update anDLt[], anLt[] and anEq[] to reflect the values that apply
99584 p->current.anEq[i]++;
99589 p->current.anLt[i] += p->current.anEq[i];
99591 p->current.anEq[i] = 1;
99719 assert( p->current.anEq[i] );
99745 case STAT_GET_NEQ: aCnt = p->a[p->iGet].anEq; break;
100485 sumEq += aSample[i].anEq[iCol];
100590 pIdx->aSample[i].anEq = pSpace; pSpace += nIdxCol;
100625 decodeIntArray((char*)sqlite3_column_text(pStmt,1),nCol,pSample->anEq,0,0);
133973 int iCol; /* Index of required stats in anEq[] etc. */
133980 tRowcnt iLower = 0; /* anLt[] + anEq[] of largest sample pRec is > */
134056 iLower = aSample[iSamp].anLt[n-1] + aSample[iSamp].anEq[n-1];
134114 aStat[1] = aSample[i].anEq[iCol];
