Searched refs:best_idx1 (Results 1 – 2 of 2) sorted by relevance
97 uint32_t best_idx1;106 best_idx1 = pairs[0].idx1;108 FN(HistogramAddHistogram)(&out[best_idx1], &out[best_idx2]);109 out[best_idx1].bit_cost_ = pairs[0].cost_combo;110 cluster_size[best_idx1] += cluster_size[best_idx2];113 symbols[i] = best_idx1;129 if (p->idx1 == best_idx1 || p->idx2 == best_idx1 ||149 FN(BrotliCompareAndPushToQueue)(out, cluster_size, best_idx1, clusters[i],
949 int best_idx1 = -1, best_idx2 = 1; in HistogramCombineStochastic() local978 best_idx1 = histo_queue.queue[0].idx1; in HistogramCombineStochastic()980 assert(best_idx1 < best_idx2); in HistogramCombineStochastic()988 HistogramAdd(histograms[best_idx2], histograms[best_idx1], in HistogramCombineStochastic()989 histograms[best_idx1]); in HistogramCombineStochastic()990 histograms[best_idx1]->bit_cost_ = histo_queue.queue[0].cost_combo; 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()1008 p->idx1 = best_idx1; in HistogramCombineStochastic()1011 p->idx2 = best_idx1; in HistogramCombineStochastic()