Home
last modified time | relevance | path

Searched refs:cost_diff (Results 1 – 2 of 2) sorted by relevance

/external/chromium_org/third_party/brotli/src/brotli/enc/
Dcluster.h41 double cost_diff; member
46 if (p1.cost_diff != p2.cost_diff) { in operator()
47 return p1.cost_diff > p2.cost_diff; in operator()
80 p.cost_diff = 0.5 * ClusterCostDiff(cluster_size[idx1], cluster_size[idx2]); in CompareAndPushToHeap()
81 p.cost_diff -= out[idx1].bit_cost_; in CompareAndPushToHeap()
82 p.cost_diff -= out[idx2].bit_cost_; in CompareAndPushToHeap()
92 std::max(0.0, (*pairs)[0].cost_diff); in CompareAndPushToHeap()
96 if (cost_combo < threshold - p.cost_diff) { in CompareAndPushToHeap()
102 p.cost_diff += p.cost_combo; in CompareAndPushToHeap()
135 if (pairs[0].cost_diff >= cost_diff_threshold) { in HistogramCombine()
Dhash.h198 double cost_diff[4] = { 0.10, 0.04, 0.02, 0.01 }; in FindLongestMatch() local
199 best_score += cost_diff[insert_length_]; in FindLongestMatch()