HomeSort by relevance Sort by last modified time
    Searched refs:cost_diff (Results 1 - 4 of 4) sorted by null

  /external/brotli/c/enc/
cluster.c 24 if (p1->cost_diff != p2->cost_diff) {
25 return TO_BROTLI_BOOL(p1->cost_diff > p2->cost_diff);
cluster.h 25 double cost_diff; member in struct:HistogramPair
cluster_inc.h 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) {
  /external/webp/src/enc/
histogram_enc.c 622 double cost_diff; member in struct:__anon43747
670 assert(pair->cost_diff < 0.);
674 if (pair->cost_diff < histo_queue->queue[0].cost_diff) {
706 pair.cost_diff = pair.cost_combo - sum_cost;
709 if (pair.cost_diff >= threshold) return 0.;
716 return pair.cost_diff;
824 (histo_queue.size == 0) ? 0. : histo_queue.queue[0].cost_diff;
    [all...]

Completed in 124 milliseconds