267   tRowcnt *anEq;                  /* sqlite_stat4.nEq */  member
351   memcpy(pTo->anEq, pFrom->anEq, sizeof(tRowcnt)*p->nCol);  in sampleCopy()
450   p->current.anEq = &p->current.anDLt[nColUp];  in statInit()
460     p->current.anLt = &p->current.anEq[nColUp];  in statInit()
468       p->a[i].anEq = (tRowcnt *)pSpace; pSpace += (sizeof(tRowcnt) * nColUp);  in statInit()
519     if( pNew->anEq[i]>pOld->anEq[i] ) return 1;  in sampleIsBetterPost()
520     if( pNew->anEq[i]<pOld->anEq[i] ) return 0;  in sampleIsBetterPost()
539   tRowcnt nEqNew = pNew->anEq[pNew->iCol];  in sampleIsBetter()
540   tRowcnt nEqOld = pOld->anEq[pOld->iCol];  in sampleIsBetter()
572     assert( pNew->anEq[pNew->iCol]>0 );  in sampleInsert()
581       if( pOld->anEq[pNew->iCol]==0 ){  in sampleInsert()
592       pUpgrade->anEq[pUpgrade->iCol] = pNew->anEq[pUpgrade->iCol];  in sampleInsert()
600     tRowcnt *anEq = pMin->anEq;  in sampleInsert()  local
607     pSample->anEq = anEq;  in sampleInsert()
625   memset(pSample->anEq, 0, sizeof(tRowcnt)*nEqZero);  in sampleInsert()
656     pBest->anEq[i] = p->current.anEq[i];  in samplePushPrevious()
666     for(j=p->nMaxEqZero; j<p->nCol; j++) assert( p->a[i].anEq[j]>0 );  in samplePushPrevious()
674         if( p->a[i].anEq[j]==0 ) p->a[i].anEq[j] = p->current.anEq[j];  in samplePushPrevious()
719     for(i=0; i<p->nCol; i++) p->current.anEq[i] = 1;  in statPush()
729       p->current.anEq[i]++;  in statPush()
734       if( p->mxSample ) p->current.anLt[i] += p->current.anEq[i];  in statPush()
736       p->current.anEq[i] = 1;  in statPush()
870       assert( p->current.anEq[i] );  in statGet()
896       case STAT_GET_NEQ:  aCnt = p->a[p->iGet].anEq; break;  in statGet()
1665           sumEq += aSample[i].anEq[iCol];
1765       pIdx->aSample[i].anEq = pSpace; pSpace += nIdxCol;
1799     decodeIntArray((char*)sqlite3_column_text(pStmt,1),nCol,pSample->anEq,0,0);