Searched refs:cost_diff (Results 1 – 5 of 5) sorted by relevance
24 if (p1->cost_diff != p2->cost_diff) { in HistogramPairIsLess()25 return TO_BROTLI_BOOL(p1->cost_diff > p2->cost_diff); in HistogramPairIsLess()
21 p.cost_diff = p.cost_combo = 0;32 p.cost_diff = 0.5 * ClusterCostDiff(cluster_size[idx1], cluster_size[idx2]);33 p.cost_diff -= out[idx1].bit_cost_;34 p.cost_diff -= out[idx2].bit_cost_;44 BROTLI_MAX(double, 0.0, pairs[0].cost_diff);49 if (cost_combo < threshold - p.cost_diff) {55 p.cost_diff += p.cost_combo;100 if (pairs[0].cost_diff >= cost_diff_threshold) {
25 double cost_diff; member
734 double cost_diff; member775 assert(pair->cost_diff < 0.); in HistoQueueUpdateHead()779 if (pair->cost_diff < histo_queue->queue[0].cost_diff) { in HistoQueueUpdateHead()796 pair->cost_diff = pair->cost_combo - sum_cost; in HistoQueueUpdatePair()825 if (pair.cost_diff >= threshold) return 0.; in HistoQueuePush()830 return pair.cost_diff; in HistoQueuePush()949 (histo_queue.size == 0) ? 0. : histo_queue.queue[0].cost_diff; in HistogramCombineStochastic()1024 if (p->cost_diff >= 0.) { in HistogramCombineStochastic()
60 int cost_diff; member