diff options
| author | Dimitri Papadopoulos <3234522+DimitriPapadopoulos@users.noreply.github.com> | 2023-08-06 13:27:51 +0200 |
|---|---|---|
| committer | Hans Kristian Rosbach <hk-github@circlestorm.org> | 2023-08-07 08:28:16 +0200 |
| commit | 73bbb54cf6686a81710a1326c4cf1cfee9a49784 (patch) | |
| tree | 4c9f7702f51199a5cc8f95551accb5793ef8d445 /insert_string_tpl.h | |
| parent | e841518da7f4861cb0a275583da0cec13714802c (diff) | |
| download | Project-Tick-73bbb54cf6686a81710a1326c4cf1cfee9a49784.tar.gz Project-Tick-73bbb54cf6686a81710a1326c4cf1cfee9a49784.zip | |
Discard repeated words
Diffstat (limited to 'insert_string_tpl.h')
| -rw-r--r-- | insert_string_tpl.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/insert_string_tpl.h b/insert_string_tpl.h index 4acd67fd62..c84617730a 100644 --- a/insert_string_tpl.h +++ b/insert_string_tpl.h @@ -43,7 +43,7 @@ /* =========================================================================== * Update a hash value with the given input byte - * IN assertion: all calls to to UPDATE_HASH are made with consecutive + * IN assertion: all calls to UPDATE_HASH are made with consecutive * input characters, so that a running hash key can be computed from the * previous key instead of complete recalculation each time. */ @@ -81,7 +81,7 @@ Z_INTERNAL Pos QUICK_INSERT_STRING(deflate_state *const s, uint32_t str) { * Insert string str in the dictionary and set match_head to the previous head * of the hash chain (the most recent string with same hash key). Return * the previous length of the hash chain. - * IN assertion: all calls to to INSERT_STRING are made with consecutive + * IN assertion: all calls to INSERT_STRING are made with consecutive * input characters and the first STD_MIN_MATCH bytes of str are valid * (except for the last STD_MIN_MATCH-1 bytes of the input file). */ |