pub struct HasherFnv<T> { /* private fields */ }
hash
and cast
only.Expand description
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.
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.
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
.
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
.
Trait Implementations§
Source§impl ConstDefault for HasherFnv<u128>
impl ConstDefault for HasherFnv<u128>
Source§impl ConstDefault for HasherFnv<u32>
impl ConstDefault for HasherFnv<u32>
Source§impl ConstDefault for HasherFnv<u64>
impl ConstDefault for HasherFnv<u64>
Source§impl ConstDefault for HasherFnv<usize>
impl ConstDefault for HasherFnv<usize>
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<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<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
)impl<T: Copy> Copy for HasherFnv<T>
impl<T: Eq> Eq 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> UnwindSafe for HasherFnv<T>where
T: UnwindSafe,
Blanket Implementations§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
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, R> Chain<R> for Twhere
T: ?Sized,
impl<T, R> Chain<R> for Twhere
T: ?Sized,
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.Source§impl<T> ExtAny for T
impl<T> ExtAny for T
Source§fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
Source§impl<T> ExtMem for Twhere
T: ?Sized,
impl<T> ExtMem for Twhere
T: ?Sized,
Source§const NEEDS_DROP: bool = _
const NEEDS_DROP: bool = _
Source§fn mem_align_of_val(&self) -> usize ⓘ
fn mem_align_of_val(&self) -> 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.§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
Source§impl<T> Hook for T
impl<T> Hook for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out
indicating that a T
is niched.