Chained Hash Table and understanding Deflate
问题 I am currently trying to create a custom Deflate implementation in C#. I am currently trying to implement the "pattern search" part where I have (up to) 32k of data and am trying to search the longest possible pattern for my input. The RFC 1951 which defines Deflate says about that process: The compressor uses a chained hash table to find duplicated strings, using a hash function that operates on 3-byte sequences. At any given point during compression, let XYZ be the next 3 input bytes to be