class

Brotli::Enc::QuicklyHasher

Inherits Brotli::Enc::Hasher < Reference < Object

hash_longest_match_quickly_inc.h — one class parameterized the way C instantiates H2/H3/H4/H54 (bucket bits / sweep bits / hash length / dictionary use).

Constructors

new(bucket_bits : Int32, sweep_bits : Int32, hash_len : Int32, use_dict : Bool)
Source

Instance methods

buckets
Source
common
Source
find_longest_match(dict : EncoderDictionary, data : Bytes, ring_buffer_mask : Int32, distance_cache : Slice(Int32), cur_ix : Int32, max_length : Int32, max_backward : Int32, dictionary_distance : Int32, max_distance : Int32, sr : HasherSearchResult) : Nil

hash_longest_match_quickly_inc.h:128

Source
hash_bytes(data : Bytes, pos : Int32) : UInt32

hash_longest_match_quickly_inc.h:56

Source
hash_type_length
Source
prepare(data : Bytes, one_shot : Bool, input_size : Int32) : Nil

hash_longest_match_quickly_inc.h:40

Source
prepare_distance_cache(distance_cache : Slice(Int32)) : Nil

Quickly hashers do not use the distance cache heuristics.

Source
stitch_to_previous_block(num_bytes : Int32, position : Int32, ringbuffer : Bytes, ringbuffer_mask : Int32) : Nil

hash_longest_match_quickly_inc.h:107

Source
store(data : Bytes, mask : Int32, ix : Int32) : Nil

hash_longest_match_quickly_inc.h:84

Source
store_lookahead
Source
store_range(data : Bytes, mask : Int32, ix_start : Int32, ix_end : Int32) : Nil
Source