Struct brotli::enc::backward_references::hash_to_binary_tree::H10

pub struct H10<AllocU32: Allocator<u32>, Buckets, Params: H10Params>
where
    Buckets: PartialEq<Buckets> + Allocable<u32, AllocU32> + SliceWrapperMut<u32> + SliceWrapper<u32>,
{
    pub window_mask_: usize,
    pub common: Struct1,
    pub buckets_: Buckets,
    pub invalid_pos_: u32,
    pub forest: AllocU32::AllocatedMemory,
    pub _params: PhantomData<Params>,
}

Fields

window_mask_: usize

common: Struct1

buckets_: Buckets

invalid_pos_: u32

forest: AllocU32::AllocatedMemory

_params: PhantomData<Params>

Implementations

impl<AllocU32: Allocator<u32>, Buckets, Params: H10Params> H10<AllocU32, Buckets, Params>

where Buckets: PartialEq<Buckets> + Allocable<u32, AllocU32> + SliceWrapperMut<u32> + SliceWrapper<u32>,

pub fn free(&mut self, m32: &mut AllocU32)

Trait Implementations

impl<AllocU32: Allocator<u32>, Buckets, Params: H10Params> AnyHasher for H10<AllocU32, Buckets, Params>

where Buckets: PartialEq<Buckets> + Allocable<u32, AllocU32> + SliceWrapperMut<u32> + SliceWrapper<u32>,

fn Opts(&self) -> H9Opts

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

fn HashTypeLength(&self) -> usize

fn StoreLookahead(&self) -> usize

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

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

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

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 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 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>, Buckets, Params: H10Params> CloneWithAlloc<Alloc> for H10<Alloc, Buckets, Params>

where Buckets: PartialEq<Buckets> + Allocable<u32, Alloc> + SliceWrapperMut<u32> + SliceWrapper<u32>,

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

impl<AllocU32: Allocator<u32>, Buckets, Params: H10Params> PartialEq for H10<AllocU32, Buckets, Params>

where Buckets: PartialEq<Buckets> + Allocable<u32, AllocU32> + SliceWrapperMut<u32> + SliceWrapper<u32>,

fn eq(&self, other: &H10<AllocU32, Buckets, Params>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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