Searched refs:best_idx2 (Results 1 – 2 of 2) sorted by relevance
| /external/brotli/c/enc/ |
| D | cluster_inc.h | 98 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/ |
| D | histogram_enc.c | 949 int best_idx1 = -1, best_idx2 = 1; in HistogramCombineStochastic() local
979 best_idx2 = histo_queue.queue[0].idx2; in HistogramCombineStochastic()
980 assert(best_idx1 < best_idx2); in HistogramCombineStochastic()
982 mapping_index = (int*) bsearch(&best_idx2, mappings, *num_used, in HistogramCombineStochastic()
983 sizeof(best_idx2), &PairComparison); in HistogramCombineStochastic()
988 HistogramAdd(histograms[best_idx2], histograms[best_idx1], in HistogramCombineStochastic()
991 HistogramSetRemoveHistogram(image_histo, best_idx2, num_used); in HistogramCombineStochastic()
996 const int is_idx1_best = p->idx1 == best_idx1 || p->idx1 == best_idx2; in HistogramCombineStochastic()
997 const int is_idx2_best = p->idx2 == best_idx1 || p->idx2 == best_idx2; in HistogramCombineStochastic()
|