/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...] |
cvpgh.cpp | 143 // ang_dim - number of angle bins (vertical size of histogram) 144 // dist_dim - number of distance bins (horizontal size of histogram) 349 dims = cvGetDims( hist->bins, size ); 357 IPPI_CALL( icvCalcPGH( contour, ((CvMatND*)(hist->bins))->data.fl, size[0], size[1] ));
|
cvthresh.cpp | 219 h = (float*)cvPtr1D( hist->bins, 0 );
|
/external/webrtc/src/system_wrappers/source/spreadsortlib/ |
spreadsort.hpp | 39 //This is called for a set of bins, instead of bin-by-bin, to avoid performance overhead
91 //If we can finish in one iteration without exceeding either (2 to the MAX_SPLITS) or n bins, do so
115 //Make sure there is space for the bins
141 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count);
local 147 bins[0] = first;
149 bins[u + 1] = bins[u] + bin_sizes[u];
155 RandomAccessIter * local_bin = bins + u;
160 for(target_bin = (bins + ((*current >> log_divisor) - div_min)); target_bin != local_bin;
161 target_bin = bins + ((*current >> log_divisor) - div_min)) { 254 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count); local 302 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count); local 495 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count); local 544 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count); local 595 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count); local 644 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count); local 694 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count); local 778 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count); local 862 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count); local 1125 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, membin_count) + 1; local 1214 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, membin_count); local 1301 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, membin_count) + 1; local 1388 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, membin_count) + 1; local 1478 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, membin_count); local [all...] |
/external/chromium_org/third_party/libwebp/utils/ |
filters.c | 167 int bins[WEBP_FILTER_LAST][SMAX]; local 168 memset(bins, 0, sizeof(bins)); 181 bins[WEBP_FILTER_NONE][diff0] = 1; 182 bins[WEBP_FILTER_HORIZONTAL][diff1] = 1; 183 bins[WEBP_FILTER_VERTICAL][diff2] = 1; 184 bins[WEBP_FILTER_GRADIENT][diff3] = 1; 194 if (bins[filter][i] > 0) {
|
/external/opencv/cvaux/include/ |
cvaux.hpp | 75 { return m_hist ? cvGetDims( m_hist->bins, dims ) : 0; } 87 bool set_threshold( int threshold ) // threshold applied to the histogram bins 115 { return m_hist ? (float)cvGetRealND(m_hist->bins, bin) : 0.f; }
|
/external/webp/src/utils/ |
filters.c | 167 int bins[WEBP_FILTER_LAST][SMAX]; local 168 memset(bins, 0, sizeof(bins)); 181 bins[WEBP_FILTER_NONE][diff0] = 1; 182 bins[WEBP_FILTER_HORIZONTAL][diff1] = 1; 183 bins[WEBP_FILTER_VERTICAL][diff2] = 1; 184 bins[WEBP_FILTER_GRADIENT][diff3] = 1; 194 if (bins[filter][i] > 0) {
|
/external/bison/lib/ |
bitset_stats.c | 108 unsigned int n_bins, unsigned int *bins) 115 total += bins[i]; 124 (i + 1) * 100.0 / n_bins, bins[i], 125 (100.0 * bins[i]) / total); 132 unsigned int n_bins, unsigned int *bins) 140 total += bins[i]; 145 /* Determine number of useful bins. */ 146 for (i = n_bins; i > 3 && ! bins[i - 1]; i--) 156 max_width, i, bins[i], 100.0 * bins[i] / total) [all...] |
/external/opencv/cvaux/src/ |
camshift.cpp | 171 dims = cvGetDims( m_hist->bins ); 187 cvScale( m_hist->bins, m_hist->bins, max_val ? 255. / max_val : 0. ); 255 int c_dims2 = cvGetDims( m_hist->bins, dims2 );
|
/hardware/qcom/media/mm-video-legacy/vidc/common/src/ |
extra_data_handler.cpp | 50 OMX_U32 rem_bits = num_bits, bins = 0, shift = 0; local 55 bins <<= shift; 57 bins |= ((rbsp_buf[byte_ptr] << shift) & 0xFF) >> shift; 66 bins <<= rem_bits; 67 bins |= ((rbsp_buf[byte_ptr] << (8-bit_ptr)) & 0xFF) >> (8-rem_bits); 77 DEBUG_PRINT_LOW("\nIn %s() bin/num_bits : %x/%d", __func__, bins, num_bits); 78 return bins;
|
/hardware/qcom/media/mm-video-v4l2/vidc/common/src/ |
extra_data_handler.cpp | 50 OMX_U32 rem_bits = num_bits, bins = 0, shift = 0; local 55 bins <<= shift; 57 bins |= ((rbsp_buf[byte_ptr] << shift) & 0xFF) >> shift; 67 bins <<= rem_bits; 68 bins |= ((rbsp_buf[byte_ptr] << (8-bit_ptr)) & 0xFF) >> (8-rem_bits); 80 DEBUG_PRINT_LOW("\nIn %s() bin/num_bits : %x/%d", __func__, bins, num_bits); 81 return bins;
|
/external/libvpx/libvpx/build/make/ |
Makefile | 336 BINS=$(call enabled,BINS) 337 .bins: $(BINS) 340 INSTALL-BINS=$(call cond_enabled,CONFIG_INSTALL_BINS,INSTALL-BINS) 342 INSTALL-BINS+=$(call cond_enabled,CONFIG_INSTALL_BINS,DIST-BINS) 344 .install-bins: .bins $(addprefix $(DIST_DIR)/,$(INSTALL-BINS) [all...] |
/external/opencv/cv/include/ |
cvcompat.h | 480 ((float)cvGetReal1D( (hist)->bins, (idx0))) 482 ((float)cvGetReal2D( (hist)->bins, (idx0), (idx1))) 484 ((float)cvGetReal3D( (hist)->bins, (idx0), (idx1), (idx2))) 486 ((float)cvGetRealND( (hist)->bins, (idx))) 491 ((float*)cvPtr1D( (hist)->bins, (idx0), 0)) 493 ((float*)cvPtr2D( (hist)->bins, (idx0), (idx1), 0)) 495 ((float*)cvPtr3D( (hist)->bins, (idx0), (idx1), (idx2), 0)) 497 ((float*)cvPtrND( (hist)->bins, (idx), 0)) [all...] |
/external/chromium_org/v8/test/mjsunit/ |
unicode-test.js | [all...] |
/external/v8/test/mjsunit/ |
unicode-test.js | [all...] |
/external/chromium_org/third_party/jemalloc/chromium/ |
jemalloc.c | 1007 * bins is used to store rings of free regions of the following sizes, 1010 * bins[i] | size | 1029 arena_bin_t bins[1]; /* Dynamically sized. */ member in struct:arena_s 1046 static size_t bin_maxclass; /* Max size class for bins. */ 1047 static unsigned ntbins; /* Number of (2^n)-spaced tiny bins. */ 1048 static unsigned nqbins; /* Number of quantum-spaced bins. */ 1049 static unsigned nsbins; /* Number of (2^n)-spaced sub-page bins. */ [all...] |
/external/chromium_org/third_party/jemalloc/vendor/ |
jemalloc.c | 1000 * bins is used to store rings of free regions of the following sizes, 1003 * bins[i] | size | 1022 arena_bin_t bins[1]; /* Dynamically sized. */ member in struct:arena_s 1039 static size_t bin_maxclass; /* Max size class for bins. */ 1040 static unsigned ntbins; /* Number of (2^n)-spaced tiny bins. */ 1041 static unsigned nqbins; /* Number of quantum-spaced bins. */ 1042 static unsigned nsbins; /* Number of (2^n)-spaced sub-page bins. */ [all...] |
/external/opencv/cxcore/include/ |
cxtypes.h | 812 CvArr* bins; member in struct:CvHistogram 822 (hist)->bins != NULL) 828 CV_IS_SPARSE_MAT((hist)->bins) [all...] |