Struct brotli::enc::backward_references::H9

pub struct H9<Alloc: Allocator<u16> + Allocator<u32>> {
    pub num_: <Alloc as Allocator<u16>>::AllocatedMemory,
    pub buckets_: <Alloc as Allocator<u32>>::AllocatedMemory,
    pub dict_search_stats_: Struct1,
    pub h9_opts: H9Opts,
}

Fields

num_: <Alloc as Allocator<u16>>::AllocatedMemory

buckets_: <Alloc as Allocator<u32>>::AllocatedMemory

dict_search_stats_: Struct1

h9_opts: H9Opts

Trait Implementations

impl<Alloc: Allocator<u16> + Allocator<u32>> AnyHasher for H9<Alloc>

fn Opts(&self) -> H9Opts

fn GetHasherCommon(&mut self) -> &mut Struct1

fn HashBytes(&self, data: &[u8]) -> usize

fn HashTypeLength(&self) -> usize

fn StoreLookahead(&self) -> usize

fn PrepareDistanceCache(&self, distance_cache: &mut [i32])

fn FindLongestMatch( &mut self, dictionary: Option<&BrotliDictionary>, dictionary_hash: &[u16], data: &[u8], ring_buffer_mask: usize, distance_cache: &[i32], cur_ix: usize, max_length: usize, max_backward: usize, gap: usize, max_distance: usize, out: &mut HasherSearchResult, ) -> bool

fn Store(&mut self, data: &[u8], mask: usize, ix: usize)

fn StoreRange( &mut self, data: &[u8], mask: usize, ix_start: usize, ix_end: usize, )

fn BulkStoreRange( &mut self, data: &[u8], mask: usize, ix_start: usize, ix_end: usize, )

fn Prepare( &mut self, _one_shot: bool, _input_size: usize, _data: &[u8], ) -> HowPrepared

fn StitchToPreviousBlock( &mut self, num_bytes: usize, position: usize, ringbuffer: &[u8], ringbuffer_mask: usize, )

fn Store4Vec4(&mut self, data: &[u8], mask: usize, ix: usize)

fn StoreEvenVec4(&mut self, data: &[u8], mask: usize, ix: usize)

impl<Alloc: Allocator<u16> + Allocator<u32>> CloneWithAlloc<Alloc> for H9<Alloc>

fn clone_with_alloc(&self, m: &mut Alloc) -> Self

impl<Alloc: Allocator<u16> + Allocator<u32>> PartialEq for H9<Alloc>

fn eq(&self, other: &H9<Alloc>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.