Lines Matching defs:nSample
10387 int nSample; /* Number of elements in aSample[] */
79518 int nSample; /* Current number of samples */
79613 }else if( p->nSample<p->mxSample ){
79621 if( p->nSample==p->mxSample ){
79622 assert( p->nSample - iMin - 1 >= 0 );
79623 memmove(&p->a[iMin], &p->a[iMin+1], sizeof(p->a[0])*(p->nSample-iMin-1));
79624 pSample = &p->a[p->nSample-1];
79626 pSample = &p->a[p->nSample++];
79636 if( p->nSample==p->mxSample ){
79642 assert( i<p->nSample );
79647 for(i++, pSample++; i<p->nSample; i++, pSample++){
79694 if( p->nSample<=n ) return;
80198 for(j=0; j<pIdx->nSample; j++){
80207 pIdx->nSample = 0;
80248 int nSample; /* Number of samples */
80252 nSample = sqlite3_column_int(pStmt, 1);
80255 assert( pIdx->nSample==0 );
80256 pIdx->nSample = nSample;
80257 pIdx->aSample = sqlite3DbMallocZero(db, nSample*sizeof(IndexSample));
80293 assert( idx<pIdx->nSample );
80298 if( idx==pIdx->nSample-1 ){
105042 assert( pIdx->nSample>0 );
105051 for(i=0; i<pIdx->nSample; i++){
105069 for(i=0; i<pIdx->nSample; i++){
105087 for(i=0; i<pIdx->nSample; i++){
105092 if( i<pIdx->nSample ){
105115 for(; i<pIdx->nSample; i++){
105122 int nSample;
105124 db, pColl->enc, aSample[i].u.z, aSample[i].nByte, &nSample
105130 c = pColl->xCmp(pColl->pUser, nSample, zSample, n, z);
105146 ** or equal to pVal. Or if i==pIdx->nSample, then all samples are less
105150 assert( i<pIdx->nSample );
105159 iUpper = i>=pIdx->nSample ? n : aSample[i].nLt;
105265 if( nEq==0 && p->nSample ){
105349 assert( p->nSample>0 );
