/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/chromium_org/third_party/libwebp/utils/ |
filters.c | 205 int bins[WEBP_FILTER_LAST][SMAX]; local 206 memset(bins, 0, sizeof(bins)); 219 bins[WEBP_FILTER_NONE][diff0] = 1; 220 bins[WEBP_FILTER_HORIZONTAL][diff1] = 1; 221 bins[WEBP_FILTER_VERTICAL][diff2] = 1; 222 bins[WEBP_FILTER_GRADIENT][diff3] = 1; 233 if (bins[filter][i] > 0) {
|
/external/chromium_org/third_party/skia/tests/ |
RandomTest.cpp | 34 static bool chi_square_test(int bins[256], int e) { 42 double delta = bins[j] - e; 60 int bins[256]; local 61 memset(bins, 0, sizeof(int)*256); 65 bins[(rand.nextU() >> shift) & 0xff]++; 68 REPORTER_ASSERT(reporter, chi_square_test(bins, 10000)); 72 int bins[256]; local 73 memset(bins, 0, sizeof(int)*256); 79 bins[(int)(f*256.f)]++; 81 REPORTER_ASSERT(reporter, chi_square_test(bins, 10000)) 169 int bins[256]; local [all...] |
/external/chromium_org/third_party/smhasher/src/ |
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.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...] |
/external/skia/tests/ |
RandomTest.cpp | 34 static bool chi_square_test(int bins[256], int e) { 42 double delta = bins[j] - e; 60 int bins[256]; local 61 memset(bins, 0, sizeof(int)*256); 65 bins[(rand.nextU() >> shift) & 0xff]++; 68 REPORTER_ASSERT(reporter, chi_square_test(bins, 10000)); 72 int bins[256]; local 73 memset(bins, 0, sizeof(int)*256); 79 bins[(int)(f*256.f)]++; 81 REPORTER_ASSERT(reporter, chi_square_test(bins, 10000)) 169 int bins[256]; local [all...] |
/external/webp/src/utils/ |
filters.c | 205 int bins[WEBP_FILTER_LAST][SMAX]; local 206 memset(bins, 0, sizeof(bins)); 219 bins[WEBP_FILTER_NONE][diff0] = 1; 220 bins[WEBP_FILTER_HORIZONTAL][diff1] = 1; 221 bins[WEBP_FILTER_VERTICAL][diff2] = 1; 222 bins[WEBP_FILTER_GRADIENT][diff3] = 1; 233 if (bins[filter][i] > 0) {
|
/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("In %s() bin/num_bits : %x/%u", __func__, (unsigned)bins, (unsigned int)num_bits); 81 return bins;
|
/external/chromium_org/third_party/webrtc/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/jemalloc/src/ |
stats.c | 52 void *cbopaque, unsigned i, bool bins, bool large); 69 "bins: bin size regs pgs allocated nmalloc" 74 "bins: bin size regs pgs allocated nmalloc" 81 CTL_IJ_GET("stats.arenas.0.bins.0.nruns", &nruns, uint64_t); 108 CTL_IJ_GET("stats.arenas.0.bins.0.allocated", 110 CTL_IJ_GET("stats.arenas.0.bins.0.nmalloc", 112 CTL_IJ_GET("stats.arenas.0.bins.0.ndalloc", 115 CTL_IJ_GET("stats.arenas.0.bins.0.nrequests", 117 CTL_IJ_GET("stats.arenas.0.bins.0.nfills", 119 CTL_IJ_GET("stats.arenas.0.bins.0.nflushes" 287 bool bins = true; local [all...] |
/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/jemalloc/include/jemalloc/internal/ |
arena.h | 207 * Read-only information associated with each element of arena_t's bins array 379 /* bins is used to store trees of free regions. */ 380 arena_bin_t bins[NBINS]; member in struct:arena_s 930 actual_binind = bin - arena->bins; 946 size_t binind = bin - arena->bins; [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...] |
/external/chromium_org/third_party/opus/src/celt/ |
celt_encoder.c | 1210 int bins; local [all...] |
/external/libopus/celt/ |
celt_encoder.c | 1210 int bins; local [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...] |
/frameworks/base/core/java/com/android/internal/os/ |
BatteryStatsImpl.java | 5609 int bins = in.readInt(); local [all...] |
/prebuilts/devtools/tools/lib/ |
jfreechart-1.0.9.jar | |
/prebuilts/tools/common/jfreechart/ |
jfreechart-1.0.9.jar | |
/prebuilts/tools/common/m2/repository/jfree/jfreechart/1.0.9/ |
jfreechart-1.0.9.jar | |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
org.eclipse.pde.api.tools_1.0.202.v20100820_r361.jar | |