See http://michael.dipperstein.com/lzss/ and http://www.binaryessence.com/dct/en000138.htm
A dictionary look-up compressor that performs best with very long repeating patterns e.g. [0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3]
. Use RedLZSS for better albeit slower compression.
Returns an array with length, distance and value...
Returns an array.
Maximum sliding window size. The default is 4096.
Maximum length for matching pattern. The default is 32.