diff options
| -rw-r--r-- | lib/README.md | 2 | ||||
| -rw-r--r-- | lib/lz4hc.c | 1 |
2 files changed, 1 insertions, 2 deletions
diff --git a/lib/README.md b/lib/README.md index 7082fe3..fc5d4e9 100644 --- a/lib/README.md +++ b/lib/README.md @@ -15,7 +15,7 @@ They generate and decode data using [LZ4 block format]. For more compression ratio at the cost of compression speed, the High Compression variant called **lz4hc** is available. -Add files **`lz4hc.c`** and **`lz4hc.h`**. +Add files **`lz4hc.c`**, **`lz4hc.h`** and **`lz4opt.h`**. The variant still depends on regular `lib/lz4.*` source files. diff --git a/lib/lz4hc.c b/lib/lz4hc.c index 010ac2d..19636c5 100644 --- a/lib/lz4hc.c +++ b/lib/lz4hc.c @@ -262,7 +262,6 @@ LZ4_FORCE_INLINE int LZ4HC_InsertAndGetWiderMatch ( matchIndex += (U32)forwardPatternLength - (U32)srcPatternLength; /* best position, full pattern, might be followed by more match */ } else { matchIndex -= (U32)backLength; /* let's go to farthest segment position, will find a match of length currentSegmentLength + maybe some back */ - //matchIndex -= DELTANEXTU16(chainTable, matchIndex); /* skip directly to following candidate; slightly faster, but miss some rare corner cases (likely when back is useful)*/ } } } } } } /* while ((matchIndex>=lowLimit) && (nbAttempts)) */ |