HomeSort by relevance Sort by last modified time
    Searched refs:bins (Results 1 - 25 of 32) sorted by null

1 2

  /external/chromium_org/third_party/smhasher/src/
Stats.h 12 double calcScore ( const int * bins, const int bincount, const int ballcount );
16 inline double ExpectedCollisions ( double balls, double bins )
18 return balls - bins + bins * pow(1 - 1/bins,balls);
124 std::vector<int> bins; local
125 bins.resize(1 << maxwidth);
136 memset(&bins[0],0,sizeof(int)*bincount);
144 bins[index]++;
147 // Test the distribution, then fold the bins in half
    [all...]
AvalancheTest.cpp 5 void PrintAvalancheDiagram ( int x, int y, int reps, double scale, int * bins )
16 int bin = bins[k + (j*y)];
AvalancheTest.h 83 std::vector<int> bins(keybits*hashbits,0);
85 calcBias<keytype,hashtype>(hash,bins,reps,r);
91 double b = maxBias(bins,reps);
119 std::vector<int> bins(hashbits*hashbits*4,0);
146 bins[(out1 * hashbits + out2) * 4 + b]++;
168 double b2 = double(bins[(out1 * hashbits + out2) * 4 + b]) / double(reps / 2);
257 std::vector<int> bins(keybits*pagesize,0);
263 int * page = &bins[keybit*pagesize];
296 int * page = &bins[keybit*pagesize];
297 int * bins = &page[(out1*hashbits+out2)*4] local
371 int bins[4] = { 0, 0, 0, 0 }; local
    [all...]
Stats.cpp 39 // the bins. This makes for a nice uniform way to rate a distribution that isn't
40 // dependent on the number of bins or the number of keys
42 // (as long as # keys > # bins * 3 or so, otherwise random fluctuations show up
45 double calcScore ( const int * bins, const int bincount, const int keycount )
56 double b = bins[i];
  /external/libvorbis/vq/
distribution.c 38 long bins=-1; local
45 fprintf(stderr,"Usage: distribution {data.vqd [bins]| book.vqh} \n\n");
49 bins=atoi(argv[2])-1;
72 bins=_book_maptype1_quantvals(c);
75 bins=c->entries*c->dim;
82 for(i=0;i<bins;i++){
96 long **sort=calloc(bins,sizeof(long *));
98 countarray=calloc(bins,sizeof(long));
100 for(i=0;i<bins;i++)sort[i]=c->quantlist+i;
101 qsort(sort,bins,sizeof(long *),ascend)
    [all...]
latticetune.c 139 long bins=_book_maptype1_quantvals(c); local
149 int index= (j/indexdiv)%bins;
152 indexdiv*=bins;
  /external/skia/tests/
RandomTest.cpp 35 static bool chi_square_test(int bins[256], int e) {
43 double delta = bins[j] - e;
61 int bins[256]; local
62 memset(bins, 0, sizeof(int)*256);
66 bins[(rand.nextU() >> shift) & 0xff]++;
69 REPORTER_ASSERT(reporter, chi_square_test(bins, 10000));
73 int bins[256]; local
74 memset(bins, 0, sizeof(int)*256);
80 bins[(int)(f*256.f)]++;
82 REPORTER_ASSERT(reporter, chi_square_test(bins, 10000))
170 int bins[256]; local
    [all...]
  /external/opencv/cv/src/
cvhistogram.cpp 62 hist->bins = 0;
65 CV_CALL( hist->bins = cvInitMatNDHeader( &hist->mat, dims, sizes,
67 CV_CALL( cvCreateData( hist->bins ));
71 CV_CALL( hist->bins = cvCreateSparseMat( dims, sizes, CV_HIST_DEFAULT_TYPE ));
109 CV_CALL( hist->bins = cvInitMatNDHeader( &hist->mat, dims, sizes,
127 hist->bins = 0;
154 cvRelease( &temp->bins );
157 cvReleaseData( temp->bins );
158 temp->bins = 0;
180 cvZero( hist->bins );
891 int* bins = ((CvMatND*)(hist->bins))->data.i; local
1149 int* bins = mat->data.i; local
1574 float* bins = mat->data.fl; local
1842 float* bins = mat->data.fl; local
    [all...]