Searched refs:bit_cost_ (Results 1 – 5 of 5) sorted by relevance
33 p.cost_diff -= out[idx1].bit_cost_;34 p.cost_diff -= out[idx2].bit_cost_;37 p.cost_combo = out[idx2].bit_cost_;40 p.cost_combo = out[idx1].bit_cost_;109 out[best_idx1].bit_cost_ = pairs[0].cost_combo;164 return FN(BrotliPopulationCost)(&tmp) - candidate->bit_cost_;273 out[i].bit_cost_ = FN(BrotliPopulationCost)(&in[i]);
15 double bit_cost_;21 self->bit_cost_ = HUGE_VAL; in FN()
254 histograms[j].bit_cost_ = FN(BrotliPopulationCost)(&histograms[j]); in FN()
103 p->bit_cost_ = 0.; in VP8LHistogramInit()447 const double sum_cost = a->bit_cost_ + b->bit_cost_; in HistogramAddEval()452 out->bit_cost_ = cost; in HistogramAddEval()467 cost = -a->bit_cost_; in HistogramAddThresh()522 h->bit_cost_ = h->literal_cost_ + h->red_cost_ + h->blue_cost_ + in UpdateHistogramCost()682 const double bit_cost = histograms[idx]->bit_cost_; in HistogramCombineEntropyBin()793 const double sum_cost = h1->bit_cost_ + h2->bit_cost_; in HistoQueueUpdatePair()870 histograms[idx1]->bit_cost_ = histo_queue.queue[0].cost_combo; in HistogramCombineGreedy()991 histograms[best_idx1]->bit_cost_ = histo_queue.queue[0].cost_combo; in HistogramCombineStochastic()
43 double bit_cost_; // cached value of bit cost. member