Lines Matching defs:entries
122 int entries=-1,dim=-1;
155 entries=b->entries;
213 for(i=0;i<entries;i++)if(c->lengthlist[i]==0)break;
214 if(c->q_sequencep || i<entries){
235 the vector (pigeonmap groups quantized entries together) and
236 list the entries that could possible be the best fit for any
272 entries that could possibly be the best fit for a value appearing
281 /* must iterate over both pigeonholes and entries */
306 /* Search all entries to find the one with the minimum possible
308 for(i=0;i<entries;i++){
317 /* Our search list will contain all entries with a minimum
319 for(i=0;i<entries;i++)
337 "\rTotal search list size (all entries): %ld\n",totalstack);
342 /*for(i=0;i<entries;i++){
344 if(c->lengthlist[i]==0 || probability*entries<cutoff){
377 tempcount[i]+bmiss<entries/30)){