Lines Matching defs:dim
164 long vals=floor(pow((float)b->entries,1.f/b->dim));
168 means that vals really is the greatest value of dim for which
175 for(i=0;i<b->dim;i++){
202 float *r=_ogg_calloc(n*b->dim,sizeof(*r));
210 scalar is values == entries/dim. If entries%dim != 0, we'll
211 have 'too few' values (values*dim<entries), which means that
220 for(k=0;k<b->dim;k++){
226 r[sparsemap[count]*b->dim+k]=val;
228 r[count*b->dim+k]=val;
241 for(k=0;k<b->dim;k++){
242 float val=b->quantlist[j*b->dim+k];
246 r[sparsemap[count]*b->dim+k]=val;
248 r[count*b->dim+k]=val;
310 c->dim=s->dim;
343 c->dim=s->dim;
465 int dim=book->dim;
474 for(k=0,o=step*(dim-1);k<dim;k++,o-=step){
512 for(k=0,o=0;k<dim;k++,o+=step){
520 for(k=0,o=step*(dim-1);k<dim;k++,o-=step){
529 if(k==dim && pt->fitlength[entry]){
533 float this=_dist(dim,book->valuelist+list[i]*dim,a,step);
551 for(k=0,o=0;k<dim;k++,o+=step)
572 float this=_dist(dim,e,a,step);
578 e+=dim;
584 for(i=0;i<dim*step;i+=step)fprintf(stderr,"%g,",a[i]);
587 for(i=0;i<dim;i++)fprintf(stderr,"%g,",
588 (book->valuelist+savebest*dim)[i]);
591 for(i=0;i<dim;i++)fprintf(stderr,"%g,",
592 (book->valuelist+besti*dim)[i]);
720 for(i=0;i<b->entries*b->dim;i++)