aboutsummaryrefslogtreecommitdiff
path: root/enc/hash.h
diff options
context:
space:
mode:
authorZoltan Szabadka <szabadka@google.com>2014-03-25 16:48:25 +0100
committerZoltan Szabadka <szabadka@google.com>2014-03-25 16:48:25 +0100
commit347781947a6c9a982d6ad03850f41d34421264e1 (patch)
treef1e08bb40908a1ee2e33af5c35c7c09ed4c1f98d /enc/hash.h
parente7650080a8cedc159fc4e89d7f144c28f4b028b4 (diff)
downloadbrotli-347781947a6c9a982d6ad03850f41d34421264e1.zip
brotli-347781947a6c9a982d6ad03850f41d34421264e1.tar.gz
brotli-347781947a6c9a982d6ad03850f41d34421264e1.tar.bz2
Update the dictionary and the transforms.
Diffstat (limited to 'enc/hash.h')
-rw-r--r--enc/hash.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/enc/hash.h b/enc/hash.h
index b07a538..bc3e1c4 100644
--- a/enc/hash.h
+++ b/enc/hash.h
@@ -193,7 +193,7 @@ class HashLongestMatch {
literal_cost[(cur_ix + 1) & ring_buffer_mask] + 1.2;
bool match_found = false;
// Don't accept a short copy from far away.
- double best_score = 8.11;
+ double best_score = 8.115;
if (insert_length_ < 4) {
double cost_diff[4] = { 0.10, 0.04, 0.02, 0.01 };
best_score += cost_diff[insert_length_];