Searched defs:histogram (Results 1 - 9 of 9) sorted by relevance
/external/e2fsprogs/misc/ |
H A D | e2freefrag.h | 19 struct free_chunk_histogram histogram; /* histogram of all chunk sizes*/ member in struct:chunk_info
|
/external/libvorbis/vq/ |
H A D | metrics.c | 44 float **histogram=NULL; variable 63 histogram=_ogg_calloc(books,sizeof(float *)); 75 histogram[i]=_ogg_calloc(b->entries,sizeof(float)); 169 sqrt((histogram_errorsq[book]+i*dim)[k]/histogram[book][i])); 185 (histogram_error[book]+i*dim)[k]/histogram[book][i]); 241 histogram[book][entry]++; 253 if(histogram[book][entry]==0 || histogram_hi[book][entry*dim+j]<error) 255 if(histogram[book][entry]==0 || histogram_lo[book][entry*dim+j]>error)
|
/external/webp/src/utils/ |
H A D | huffman_encode.c | 165 static void GenerateOptimalTree(const uint32_t* const histogram, argument 175 if (histogram[i] != 0) { 194 // So, we try by faking histogram entries to be at least 'count_min'. 198 if (histogram[j] != 0) { 200 (histogram[j] < count_min) ? count_min : histogram[j]; 406 void VP8LCreateHuffmanTree(uint32_t* const histogram, int tree_depth_limit, argument 412 OptimizeHuffmanForRle(num_symbols, buf_rle, histogram); 413 GenerateOptimalTree(histogram, num_symbols, huff_tree, tree_depth_limit,
|
/external/v8/src/ |
H A D | counters.h | 30 // a histogram for passing to the AddHistogramSample function 36 // to a histogram created with CreateHistogram function 56 // Create a histogram by name. If the create is successful, 69 // Add a sample to a histogram created with the CreateHistogram 71 void AddHistogramSample(void* histogram, int sample) { argument 73 return add_histogram_sample_function_(histogram, sample); 167 // A Histogram represents a dynamically created histogram in the StatsTable. 168 // It will be registered with the histogram system on first use. 185 // Add a single sample to this histogram. 188 // Returns true if this histogram i [all...] |
H A D | d8.cc | 780 void Shell::AddHistogramSample(void* histogram, int sample) { argument 781 Counter* counter = reinterpret_cast<Counter*>(histogram);
|
/external/jpeg/ |
H A D | jquant2.c | 34 * In the first pass over the image, we accumulate a histogram showing the 35 * usage count of each possible color. To keep the histogram to a reasonable 38 * in the same histogram cell. 81 * you'll probably want to tweak the histogram sizes too. 102 * First we have the histogram data structure and routines for creating it. 109 * To maintain a fully accurate histogram, we'd need to allocate a "long" 113 * enough results. This reduces the recommended histogram size from 256Kb 115 * (In the second pass the histogram space is re-used for pixel mapping data; 119 * machines, we can't just allocate the histogram in one chunk. Instead 132 #define HIST_C0_BITS 5 /* bits of precision in R/B histogram */ 201 hist3d histogram; /* pointer to the histogram */ member in struct:__anon6524 230 register hist3d histogram = cquantize->histogram; local 318 hist3d histogram = cquantize->histogram; local 505 hist3d histogram = cquantize->histogram; local 861 hist3d histogram = cquantize->histogram; local 920 hist3d histogram = cquantize->histogram; local 954 hist3d histogram = cquantize->histogram; local 1170 hist3d histogram = cquantize->histogram; local [all...] |
/external/libpng/ |
H A D | pngrtran.c | 395 * allowed, and a histogram if possible. If the current number 413 int num_palette, int maximum_colors, png_const_uint_16p histogram, 435 if (histogram != NULL) 466 if (histogram[png_ptr->quantize_sort[j]] 467 < histogram[png_ptr->quantize_sort[j + 1]]) 412 png_set_quantize(png_structrp png_ptr, png_colorp palette, int num_palette, int maximum_colors, png_const_uint_16p histogram, int full_quantize) argument
|
/external/pdfium/samples/fx_lpng/lpng_v163/ |
H A D | fx_pngrtran.c | 394 * allowed, and a histogram if possible. If the current number
412 int num_palette, int maximum_colors, png_const_uint_16p histogram,
434 if (histogram != NULL)
465 if (histogram[png_ptr->quantize_sort[j]]
466 < histogram[png_ptr->quantize_sort[j + 1]])
411 png_set_quantize(png_structrp png_ptr, png_colorp palette, int num_palette, int maximum_colors, png_const_uint_16p histogram, int full_quantize) argument
|
/external/webp/src/enc/ |
H A D | vp8l.c | 336 uint32_t histogram[CODE_LENGTH_CODES] = { 0 }; local 340 ++histogram[tokens[i].code]; 343 VP8LCreateHuffmanTree(histogram, 7, buf_rle, huff_tree, &huffman_code); 509 // Build histogram image and symbols from backward references. 512 // Create Huffman bit lengths and codes for each histogram image. 599 // Build histogram image and symbols from backward references. 606 // Create Huffman bit lengths and codes for each histogram image. 708 // Allocate histogram with cache_bits = 1.
|
Completed in 398 milliseconds