Lines Matching defs:histograms
61 + (uint64_t)size * sizeof(*set->histograms)
62 + (uint64_t)size * sizeof(**set->histograms);
68 set->histograms = (VP8LHistogram**)memory;
69 memory += size * sizeof(*set->histograms);
74 set->histograms[i] = bulk + i;
75 VP8LHistogramInit(set->histograms[i], cache_bits);
341 VP8LHistogram** const histograms = image->histograms;
346 VP8LHistogramAddSinglePixOrCopy(histograms[ix], v);
378 // Copy histograms from in[] to out[].
381 in->histograms[i]->bit_cost_ = VP8LHistogramEstimateBits(in->histograms[i]);
382 *out->histograms[i] = *in->histograms[i];
385 // Collapse similar histograms in 'out'.
394 // Choose two histograms at random and try to combine them.
403 curr_cost_diff = HistogramAddEval(out->histograms[idx1],
404 out->histograms[idx2],
407 { // swap cur/best combo histograms
419 *out->histograms[best_idx1] = *best_combo;
423 out->histograms[best_idx2] = out->histograms[out_size];
424 out->histograms[out_size] = NULL; // just for sanity check.
450 // Find the best 'out' histogram for each of the 'in' histograms.
459 HistogramDistance(in->histograms[i], out->histograms[0], 1.e38);
463 HistogramDistance(in->histograms[i], out->histograms[k], best_bits);
474 HistogramClear(out->histograms[i]);
477 HistogramAdd(in->histograms[i], out->histograms[symbols[i]]);
502 // Collapse similar histograms.
507 // Find the optimal map from original histograms to the final ones.
