pub struct HasherFnv<T> { /* private fields */ }hash only.Expand description
๐ A FowlerโNollโVo hasher, implemented for u32, u64, u128 & usize.
๐ data/codec/hash
It uses the fnv-1a variation which gives better avalanche characteristics.
See
Implementationsยง
Sourceยงimpl HasherFnv<u32>
impl HasherFnv<u32>
Sourcepub const fn get_hash_mod_lazy(&self, range: u32) -> u32
pub const fn get_hash_mod_lazy(&self, range: u32) -> u32
Returns the hash value with lazy mod mapping to the given range.
Sourcepub const fn get_hash_mod_retry(&self, range: u32) -> u32
pub const fn get_hash_mod_retry(&self, range: u32) -> u32
Returns the hash value with retried mod mapping to the given range.
Sourcepub const fn get_hash_n_bits(&self, n: usize) -> u32
pub const fn get_hash_n_bits(&self, n: usize) -> u32
Sourcepub const fn update(&mut self, input: &[u8])
pub const fn update(&mut self, input: &[u8])
Updates the hasher with more data.
Allows the hasher to receive additional bytes incrementally.
Sourcepub const fn hash_mod_lazy(input: &[u8], range: u32) -> u32
pub const fn hash_mod_lazy(input: &[u8], range: u32) -> u32
Maps the computed FNV hash to the given range using lazy mod mapping.
This method only does an additional mod at the end. But thereโs a small bias against the larger values.
Sourcepub const fn hash_mod_retry(input: &[u8], range: u32) -> u32
pub const fn hash_mod_retry(input: &[u8], range: u32) -> u32
Maps the computed FNV hash to the given range using retried mod mapping.
Sourcepub const fn hash_n_bits(input: &[u8], n: usize) -> u32
pub const fn hash_n_bits(input: &[u8], n: usize) -> u32
Sourcepub const fn mod_retry_hash(hash: u32, range: u32) -> u32
pub const fn mod_retry_hash(hash: u32, range: u32) -> u32
Maps a hash to the given range using retried mod mapping.
Ensures that the hash value is uniform and unbiased within the range.
Sourceยงimpl HasherFnv<u64>
impl HasherFnv<u64>
Sourcepub const fn get_hash_mod_lazy(&self, range: u64) -> u64
pub const fn get_hash_mod_lazy(&self, range: u64) -> u64
Returns the hash value with lazy mod mapping to the given range.
Sourcepub const fn get_hash_mod_retry(&self, range: u64) -> u64
pub const fn get_hash_mod_retry(&self, range: u64) -> u64
Returns the hash value with retried mod mapping to the given range.
Sourcepub const fn get_hash_n_bits(&self, n: usize) -> u64
pub const fn get_hash_n_bits(&self, n: usize) -> u64
Sourcepub const fn update(&mut self, input: &[u8])
pub const fn update(&mut self, input: &[u8])
Updates the hasher with more data.
Allows the hasher to receive additional bytes incrementally.
Sourcepub const fn hash_mod_lazy(input: &[u8], range: u64) -> u64
pub const fn hash_mod_lazy(input: &[u8], range: u64) -> u64
Maps the computed FNV hash to the given range using lazy mod mapping.
This method only does an additional mod at the end. But thereโs a small bias against the larger values.
Sourcepub const fn hash_mod_retry(input: &[u8], range: u64) -> u64
pub const fn hash_mod_retry(input: &[u8], range: u64) -> u64
Maps the computed FNV hash to the given range using retried mod mapping.
Sourcepub const fn hash_n_bits(input: &[u8], n: usize) -> u64
pub const fn hash_n_bits(input: &[u8], n: usize) -> u64
Sourcepub const fn mod_retry_hash(hash: u64, range: u64) -> u64
pub const fn mod_retry_hash(hash: u64, range: u64) -> u64
Maps a hash to the given range using retried mod mapping.
Ensures that the hash value is uniform and unbiased within the range.
Sourceยงimpl HasherFnv<u128>
impl HasherFnv<u128>
Sourcepub const fn get_hash_mod_lazy(&self, range: u128) -> u128
pub const fn get_hash_mod_lazy(&self, range: u128) -> u128
Returns the hash value with lazy mod mapping to the given range.
Sourcepub const fn get_hash_mod_retry(&self, range: u128) -> u128
pub const fn get_hash_mod_retry(&self, range: u128) -> u128
Returns the hash value with retried mod mapping to the given range.
Sourcepub const fn get_hash_n_bits(&self, n: usize) -> u128
pub const fn get_hash_n_bits(&self, n: usize) -> u128
Sourcepub const fn update(&mut self, input: &[u8])
pub const fn update(&mut self, input: &[u8])
Updates the hasher with more data.
Allows the hasher to receive additional bytes incrementally.
Sourcepub const fn hash_mod_lazy(input: &[u8], range: u128) -> u128
pub const fn hash_mod_lazy(input: &[u8], range: u128) -> u128
Maps the computed FNV hash to the given range using lazy mod mapping.
This method only does an additional mod at the end. But thereโs a small bias against the larger values.
Sourcepub const fn hash_mod_retry(input: &[u8], range: u128) -> u128
pub const fn hash_mod_retry(input: &[u8], range: u128) -> u128
Maps the computed FNV hash to the given range using retried mod mapping.
Sourcepub const fn hash_n_bits(input: &[u8], n: usize) -> u128
pub const fn hash_n_bits(input: &[u8], n: usize) -> u128
Computes the FNV hash of the provided byte slice, xor folded to n bits.
ยงPanics
Panics in debug if n exceeds u128::BITS.
Sourcepub const fn mod_retry_hash(hash: u128, range: u128) -> u128
pub const fn mod_retry_hash(hash: u128, range: u128) -> u128
Maps a hash to the given range using retried mod mapping.
Ensures that the hash value is uniform and unbiased within the range.
Sourceยงimpl HasherFnv<usize>
impl HasherFnv<usize>
Sourcepub const fn get_hash_mod_lazy(&self, range: usize) -> usize
pub const fn get_hash_mod_lazy(&self, range: usize) -> usize
Returns the hash value with lazy mod mapping to the given range.
Sourcepub const fn get_hash_mod_retry(&self, range: usize) -> usize
pub const fn get_hash_mod_retry(&self, range: usize) -> usize
Returns the hash value with retried mod mapping to the given range.
Sourcepub const fn get_hash_n_bits(&self, n: usize) -> usize
pub const fn get_hash_n_bits(&self, n: usize) -> usize
Sourcepub const fn update(&mut self, input: &[u8])
pub const fn update(&mut self, input: &[u8])
Updates the hasher with more data.
Allows the hasher to receive additional bytes incrementally.
Sourcepub const fn hash_mod_lazy(input: &[u8], range: usize) -> usize
pub const fn hash_mod_lazy(input: &[u8], range: usize) -> usize
Maps the computed FNV hash to the given range using lazy mod mapping.
This method only does an additional mod at the end. But thereโs a small bias against the larger values.
Sourcepub const fn hash_mod_retry(input: &[u8], range: usize) -> usize
pub const fn hash_mod_retry(input: &[u8], range: usize) -> usize
Maps the computed FNV hash to the given range using retried mod mapping.
Sourcepub const fn hash_n_bits(input: &[u8], n: usize) -> usize
pub const fn hash_n_bits(input: &[u8], n: usize) -> usize
Computes the FNV hash of the provided byte slice, xor folded to n bits.
ยงPanics
Panics in debug if n exceeds usize::BITS.
Sourcepub const fn mod_retry_hash(hash: usize, range: usize) -> usize
pub const fn mod_retry_hash(hash: usize, range: usize) -> usize
Maps a hash to the given range using retried mod mapping.
Ensures that the hash value is uniform and unbiased within the range.
Trait Implementationsยง
impl<T: Copy> Copy for HasherFnv<T>
impl<T: Eq> Eq for HasherFnv<T>
Sourceยงimpl Hasher for HasherFnv<u32>
impl Hasher for HasherFnv<u32>
1.26.0 ยท Sourceยงfn write_u128(&mut self, i: u128)
fn write_u128(&mut self, i: u128)
u128 into this hasher.1.3.0 ยท Sourceยงfn write_usize(&mut self, i: usize)
fn write_usize(&mut self, i: usize)
usize into this hasher.1.26.0 ยท Sourceยงfn write_i128(&mut self, i: i128)
fn write_i128(&mut self, i: i128)
i128 into this hasher.1.3.0 ยท Sourceยงfn write_isize(&mut self, i: isize)
fn write_isize(&mut self, i: isize)
isize into this hasher.Sourceยงfn write_length_prefix(&mut self, len: usize)
fn write_length_prefix(&mut self, len: usize)
hasher_prefixfree_extras)Sourceยงimpl Hasher for HasherFnv<u64>
impl Hasher for HasherFnv<u64>
1.26.0 ยท Sourceยงfn write_u128(&mut self, i: u128)
fn write_u128(&mut self, i: u128)
u128 into this hasher.1.3.0 ยท Sourceยงfn write_usize(&mut self, i: usize)
fn write_usize(&mut self, i: usize)
usize into this hasher.1.26.0 ยท Sourceยงfn write_i128(&mut self, i: i128)
fn write_i128(&mut self, i: i128)
i128 into this hasher.1.3.0 ยท Sourceยงfn write_isize(&mut self, i: isize)
fn write_isize(&mut self, i: isize)
isize into this hasher.Sourceยงfn write_length_prefix(&mut self, len: usize)
fn write_length_prefix(&mut self, len: usize)
hasher_prefixfree_extras)Sourceยงimpl Hasher for HasherFnv<u128>
impl Hasher for HasherFnv<u128>
1.26.0 ยท Sourceยงfn write_u128(&mut self, i: u128)
fn write_u128(&mut self, i: u128)
u128 into this hasher.1.3.0 ยท Sourceยงfn write_usize(&mut self, i: usize)
fn write_usize(&mut self, i: usize)
usize into this hasher.1.26.0 ยท Sourceยงfn write_i128(&mut self, i: i128)
fn write_i128(&mut self, i: i128)
i128 into this hasher.1.3.0 ยท Sourceยงfn write_isize(&mut self, i: isize)
fn write_isize(&mut self, i: isize)
isize into this hasher.Sourceยงfn write_length_prefix(&mut self, len: usize)
fn write_length_prefix(&mut self, len: usize)
hasher_prefixfree_extras)Sourceยงimpl Hasher for HasherFnv<usize>
impl Hasher for HasherFnv<usize>
1.26.0 ยท Sourceยงfn write_u128(&mut self, i: u128)
fn write_u128(&mut self, i: u128)
u128 into this hasher.1.3.0 ยท Sourceยงfn write_usize(&mut self, i: usize)
fn write_usize(&mut self, i: usize)
usize into this hasher.1.26.0 ยท Sourceยงfn write_i128(&mut self, i: i128)
fn write_i128(&mut self, i: i128)
i128 into this hasher.1.3.0 ยท Sourceยงfn write_isize(&mut self, i: isize)
fn write_isize(&mut self, i: isize)
isize into this hasher.Sourceยงfn write_length_prefix(&mut self, len: usize)
fn write_length_prefix(&mut self, len: usize)
hasher_prefixfree_extras)Sourceยงimpl<T: PartialEq> PartialEq for HasherFnv<T>
impl<T: PartialEq> PartialEq for HasherFnv<T>
impl<T> StructuralPartialEq for HasherFnv<T>
Auto Trait Implementationsยง
impl<T> Freeze for HasherFnv<T>where
T: Freeze,
impl<T> RefUnwindSafe for HasherFnv<T>where
T: RefUnwindSafe,
impl<T> Send for HasherFnv<T>where
T: Send,
impl<T> Sync for HasherFnv<T>where
T: Sync,
impl<T> Unpin for HasherFnv<T>where
T: Unpin,
impl<T> UnsafeUnpin for HasherFnv<T>where
T: UnsafeUnpin,
impl<T> UnwindSafe for HasherFnv<T>where
T: UnwindSafe,
Blanket Implementationsยง
Sourceยงimpl<T> AnyExt for T
impl<T> AnyExt for T
Sourceยงfn type_hash_with<H: Hasher>(&self, hasher: H) -> u64
fn type_hash_with<H: Hasher>(&self, hasher: H) -> u64
TypeId of Self using a custom hasher.Sourceยงfn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
Sourceยงfn as_any_box(self: Box<Self>) -> Box<dyn Any>where
Self: Sized,
fn as_any_box(self: Box<Self>) -> Box<dyn Any>where
Self: Sized,
alloc only.Sourceยงimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Sourceยงfn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Sourceยงimpl<T> ByteSized for T
impl<T> ByteSized for T
Sourceยงconst BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
Sourceยงfn byte_align(&self) -> usize
fn byte_align(&self) -> usize
Sourceยงfn ptr_size_ratio(&self) -> [usize; 2]
fn ptr_size_ratio(&self) -> [usize; 2]
Sourceยงimpl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Sourceยงimpl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Sourceยงimpl<T> MemExt for Twhere
T: ?Sized,
impl<T> MemExt for Twhere
T: ?Sized,
Sourceยงconst NEEDS_DROP: bool = _
const NEEDS_DROP: bool = _
Sourceยงfn mem_align_of<T>() -> usize
fn mem_align_of<T>() -> usize
Sourceยงfn mem_align_of_val(&self) -> usize
fn mem_align_of_val(&self) -> usize
Sourceยงfn mem_size_of<T>() -> usize
fn mem_size_of<T>() -> usize
Sourceยงfn mem_size_of_val(&self) -> usize
fn mem_size_of_val(&self) -> usize
Sourceยงfn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
true if dropping values of this type matters. Read moreSourceยงfn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
self without running its destructor. Read moreSourceยงfn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
Sourceยงunsafe fn mem_zeroed<T>() -> T
unsafe fn mem_zeroed<T>() -> T
unsafe_layout only.T represented by the all-zero byte-pattern. Read moreSourceยงunsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe_layout only.T represented by the all-zero byte-pattern. Read moreSourceยงfn mem_as_bytes(&self) -> &[u8] โ
fn mem_as_bytes(&self) -> &[u8] โ
unsafe_slice only.