277   int iCol;                       /* If !isPSample, the reason for inclusion */  member
349   pTo->iCol = pFrom->iCol;  in sampleCopy()
475       p->aBest[i].iCol = i;  in statInit()
517   assert( pNew->iCol==pOld->iCol );  in sampleIsBetterPost()
518   for(i=pNew->iCol+1; i<nCol; i++){  in sampleIsBetterPost()
539   tRowcnt nEqNew = pNew->anEq[pNew->iCol];  in sampleIsBetter()
540   tRowcnt nEqOld = pOld->anEq[pOld->iCol];  in sampleIsBetter()
543   assert( IsStat4 || (pNew->iCol==0 && pOld->iCol==0) );  in sampleIsBetter()
547     if( pNew->iCol<pOld->iCol ) return 1;  in sampleIsBetter()
548     return (pNew->iCol==pOld->iCol && sampleIsBetterPost(pAccum, pNew, pOld));  in sampleIsBetter()
572     assert( pNew->anEq[pNew->iCol]>0 );  in sampleInsert()
581       if( pOld->anEq[pNew->iCol]==0 ){  in sampleInsert()
583         assert( pOld->iCol>pNew->iCol );  in sampleInsert()
591       pUpgrade->iCol = pNew->iCol;  in sampleInsert()
592       pUpgrade->anEq[pUpgrade->iCol] = pNew->anEq[pUpgrade->iCol];  in sampleInsert()
756       p->current.iCol = 0;  in statPush()
763       p->current.iCol = i;  in statPush()
1628     int iCol;  local
1638     for(iCol=0; iCol<nCol; iCol++){
1647       if( !pIdx->aiRowEst || iCol>=pIdx->nKeyCol || pIdx->aiRowEst[iCol+1]==0 ){
1648         nRow = pFinal->anLt[iCol];
1649         nDist100 = (i64)100 * pFinal->anDLt[iCol];
1653         nDist100 = ((i64)100 * pIdx->aiRowEst[0]) / pIdx->aiRowEst[iCol+1];
1663          || aSample[i].anDLt[iCol]!=aSample[i+1].anDLt[iCol] 
1665           sumEq += aSample[i].anEq[iCol];
1674       pIdx->aAvgEq[iCol] = avgEq;