diff options
| author | Mark Adler <madler@alumni.caltech.edu> | 2016-10-30 08:36:13 -0700 |
|---|---|---|
| committer | Mark Adler <madler@alumni.caltech.edu> | 2016-10-30 08:49:01 -0700 |
| commit | 03614c56ad299f9b238c75aa1e66f0c08fc4fc8b (patch) | |
| tree | 6cb5d2059fe21c342cb10a2b25e0ce000c33c96a /deflate.c | |
| parent | 94575859cf7f657f0f31aff4c50761fe3f182699 (diff) | |
| download | zlib-03614c56ad299f9b238c75aa1e66f0c08fc4fc8b.tar.gz zlib-03614c56ad299f9b238c75aa1e66f0c08fc4fc8b.tar.bz2 zlib-03614c56ad299f9b238c75aa1e66f0c08fc4fc8b.zip | |
Fix some typos.
Diffstat (limited to 'deflate.c')
| -rw-r--r-- | deflate.c | 12 |
1 files changed, 6 insertions, 6 deletions
| @@ -154,9 +154,9 @@ local const config configuration_table[10] = { | |||
| 154 | 154 | ||
| 155 | /* =========================================================================== | 155 | /* =========================================================================== |
| 156 | * Update a hash value with the given input byte | 156 | * Update a hash value with the given input byte |
| 157 | * IN assertion: all calls to to UPDATE_HASH are made with consecutive | 157 | * IN assertion: all calls to UPDATE_HASH are made with consecutive input |
| 158 | * input characters, so that a running hash key can be computed from the | 158 | * characters, so that a running hash key can be computed from the previous |
| 159 | * previous key instead of complete recalculation each time. | 159 | * key instead of complete recalculation each time. |
| 160 | */ | 160 | */ |
| 161 | #define UPDATE_HASH(s,h,c) (h = (((h)<<s->hash_shift) ^ (c)) & s->hash_mask) | 161 | #define UPDATE_HASH(s,h,c) (h = (((h)<<s->hash_shift) ^ (c)) & s->hash_mask) |
| 162 | 162 | ||
| @@ -167,9 +167,9 @@ local const config configuration_table[10] = { | |||
| 167 | * the previous length of the hash chain. | 167 | * the previous length of the hash chain. |
| 168 | * If this file is compiled with -DFASTEST, the compression level is forced | 168 | * If this file is compiled with -DFASTEST, the compression level is forced |
| 169 | * to 1, and no hash chains are maintained. | 169 | * to 1, and no hash chains are maintained. |
| 170 | * IN assertion: all calls to to INSERT_STRING are made with consecutive | 170 | * IN assertion: all calls to INSERT_STRING are made with consecutive input |
| 171 | * input characters and the first MIN_MATCH bytes of str are valid | 171 | * characters and the first MIN_MATCH bytes of str are valid (except for |
| 172 | * (except for the last MIN_MATCH-1 bytes of the input file). | 172 | * the last MIN_MATCH-1 bytes of the input file). |
| 173 | */ | 173 | */ |
| 174 | #ifdef FASTEST | 174 | #ifdef FASTEST |
| 175 | #define INSERT_STRING(s, str, match_head) \ | 175 | #define INSERT_STRING(s, str, match_head) \ |