Struct miniz_oxide::deflate::core::DictOxide

struct DictOxide {
    pub max_probes: [u32; 2],
    pub b: Box<HashBuffers>,
    pub code_buf_dict_pos: usize,
    pub lookahead_size: usize,
    pub lookahead_pos: usize,
    pub size: usize,
}

Fields

max_probes: [u32; 2]

The maximum number of checks in the hash chain, for the initial, and the lazy match respectively.

b: Box<HashBuffers>

Buffer of input data. Padded with 1 byte to simplify matching code in compress_fast.

code_buf_dict_pos: usize

lookahead_size: usize

lookahead_pos: usize

size: usize

Implementations

impl DictOxide

fn new(flags: u32) -> Self

fn update_flags(&mut self, flags: u32)

fn reset(&mut self)

fn read_unaligned_u32(&self, pos: usize) -> u32

Do an unaligned read of the data at pos in the dictionary and treat it as if it was of type T.

fn read_unaligned_u64(&self, pos: usize) -> u64

Do an unaligned read of the data at pos in the dictionary and treat it as if it was of type T.

fn read_as_u16(&self, pos: usize) -> u16

Do an unaligned read of the data at pos in the dictionary and treat it as if it was of type T.

fn find_match( &self, lookahead_pos: usize, max_dist: usize, max_match_len: u32, match_dist: u32, match_len: u32, ) -> (u32, u32)

Try to find a match for the data at lookahead_pos in the dictionary that is longer than match_len. Returns a tuple containing (match_distance, match_length). Will be equal to the input values if no better matches were found.