Lines Matching defs:histograms
59 + (uint64_t)size * sizeof(*set->histograms)
60 + (uint64_t)size * sizeof(**set->histograms);
66 set->histograms = (VP8LHistogram**)memory;
67 memory += size * sizeof(*set->histograms);
72 set->histograms[i] = bulk + i;
73 VP8LHistogramInit(set->histograms[i], cache_bits);
229 VP8LHistogram** const histograms = image->histograms;
234 VP8LHistogramAddSinglePixOrCopy(histograms[ix], v);
266 // Copy histograms from in[] to out[].
269 in->histograms[i]->bit_cost_ = VP8LHistogramEstimateBits(in->histograms[i]);
270 *out->histograms[i] = *in->histograms[i];
273 // Collapse similar histograms in 'out'.
282 // Choose two histograms at random and try to combine them.
290 *cur_combo = *out->histograms[idx1];
291 VP8LHistogramAdd(cur_combo, out->histograms[idx2]);
295 - out->histograms[idx1]->bit_cost_
296 - out->histograms[idx2]->bit_cost_;
298 { // swap cur/best combo histograms
310 *out->histograms[best_idx1] = *best_combo;
314 out->histograms[best_idx2] = out->histograms[out_size];
315 out->histograms[out_size] = NULL; // just for sanity check.
350 // Find the best 'out' histogram for each of the 'in' histograms.
358 double best_bits = HistogramDistance(in->histograms[i], out->histograms[0]);
362 HistogramDistance(in->histograms[i], out->histograms[k]);
373 HistogramClear(out->histograms[i]);
376 VP8LHistogramAdd(out->histograms[symbols[i]], in->histograms[i]);
401 // Collapse similar histograms.
406 // Find the optimal map from original histograms to the final ones.
