Home
last modified time | relevance | path

Searched refs:best_idx2 (Results 1 – 2 of 2) sorted by relevance

/external/brotli/c/enc/
Dcluster_inc.h98 uint32_t best_idx2;
107 best_idx2 = pairs[0].idx2;
108 FN(HistogramAddHistogram)(&out[best_idx1], &out[best_idx2]);
110 cluster_size[best_idx1] += cluster_size[best_idx2];
112 if (symbols[i] == best_idx2) {
117 if (clusters[i] == best_idx2) {
130 p->idx1 == best_idx2 || p->idx2 == best_idx2) {
/external/webp/src/enc/
Dhistogram_enc.c825 int best_idx1 = -1, best_idx2 = 1; in HistogramCombineStochastic() local
853 best_idx2 = histo_queue.queue[0].idx2; in HistogramCombineStochastic()
854 assert(best_idx1 < best_idx2); in HistogramCombineStochastic()
855 HistogramAddEval(histograms[best_idx1], histograms[best_idx2], in HistogramCombineStochastic()
859 if (best_idx2 != image_histo_size) { in HistogramCombineStochastic()
860 HistogramSwap(&histograms[image_histo_size], &histograms[best_idx2]); in HistogramCombineStochastic()
867 const int is_idx1_best = p->idx1 == best_idx1 || p->idx1 == best_idx2; in HistogramCombineStochastic()
868 const int is_idx2_best = p->idx2 == best_idx1 || p->idx2 == best_idx2; in HistogramCombineStochastic()
888 p->idx2 = best_idx2; in HistogramCombineStochastic()