Struct MatchFinder 

pub struct MatchFinder { /* private fields */ }

LZ77 match finder using hash chains.

The match finder maintains a hash table and chain table that are indexed by position in a virtual address space where the dictionary is prepended to the actual data.

Implementations

impl MatchFinder

pub fn new(config: &LevelConfig) -> Self

Create a new match finder with the given level configuration.

pub fn find_sequences( &mut self, data: &[u8], dict: &[u8], ) -> Result<Vec<Lz77Sequence>>

Find LZ77 sequences in the input data.

The optional dict slice acts as history prepended before data. Matches may reference bytes in the dictionary. The returned sequences cover exactly all bytes of data (not the dictionary).

Errors

Returns an error if internal invariants are violated (should not happen in normal operation).

pub fn reset(&mut self)

Reset the match finder for a new block.

Clears the hash and chain tables so no stale positions from previous blocks are referenced.