Struct FloatHashOf

pub struct FloatHashOf<T> { /* private fields */ }

Takes a 64 bit hash, and makes a primitive 63 bit hash using a double. This allows for easy comparison without keeping making heap allocations in JavaScript (eg: string) or requiring low entropy (int)

Implementations

impl<T> FloatHashOf<T>

pub fn into_inner(self) -> f64

Trait Implementations

impl<T> Clone for FloatHashOf<T>

fn clone(&self) -> Self

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug> Debug for FloatHashOf<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: Hash + ?Sized, Q: Borrow<T>> From<&T> for FloatHashOf<Q>

fn from(value: &T) -> Self

Converts to this type from the input type.

impl<T> From<HashOf<T>> for FloatHashOf<T>

fn from(hash: HashOf<T>) -> Self

Converts to this type from the input type.

impl<T: Hash> Hash for FloatHashOf<T>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: PartialEq> PartialEq for FloatHashOf<T>

fn eq(&self, other: &FloatHashOf<T>) -> 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.

impl<T> Copy for FloatHashOf<T>

impl<T: Eq> Eq for FloatHashOf<T>

impl<T> StructuralPartialEq for FloatHashOf<T>