Struct grafix_toolbox::uses::hash::SipHasher 1.0.0[−][src]
pub struct SipHasher(_);
use std::collections::hash_map::DefaultHasher instead
Expand description
An implementation of SipHash 2-4.
See: https://131002.net/siphash/
SipHash is a general-purpose hashing function: it runs at a good
speed (competitive with Spooky and City) and permits strong keyed
hashing. This lets you key your hash tables from a strong RNG, such as
rand::os::OsRng.
Although the SipHash algorithm is considered to be generally strong, it is not intended for cryptographic purposes. As such, all cryptographic uses of this implementation are strongly discouraged.
Implementations
👎 Deprecated since 1.13.0: use std::collections::hash_map::DefaultHasher instead
use std::collections::hash_map::DefaultHasher instead
Creates a new SipHasher with the two initial keys set to 0.
👎 Deprecated since 1.13.0: use std::collections::hash_map::DefaultHasher instead
use std::collections::hash_map::DefaultHasher instead
Creates a SipHasher that is keyed off the provided keys.
Trait Implementations
Writes a single u128 into this hasher.
Writes a single usize into this hasher.
Writes a single i128 into this hasher.
Writes a single isize into this hasher.
Auto Trait Implementations
impl RefUnwindSafe for SipHasherimpl UnwindSafe for SipHasherBlanket Implementations
Mutably borrows from an owned value. Read more
type Output = T
type Output = TShould always be Self
The inverse inclusion map: attempts to construct self from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> boolChecks if self is actually part of its subset T (and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SSUse with care! Same as self.to_subset but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SPThe inclusion map: converts self to the equivalent element of its superset.
pub fn vzip(self) -> V