Struct Prehashed

pub struct Prehashed<T>
where
    T: ?Sized,
{ /* private fields */ }

A wrapper type with precomputed hash.

This is useful if you want to pass large values of T to memoized functions. Especially recursive structures like trees benefit from intermediate prehashed nodes.

Note that for a value v of type T, hash(v) is not necessarily equal to hash(Prehashed::new(v)). Writing the precomputed hash into a hasher’s state produces different output than writing the value’s parts directly. However, that seldomly matters as you are typically either dealing with values of type T or with values of type Prehashed<T>, not a mix of both.

Equality

Because comemo uses high-quality 128 bit hashes in all places, the risk of a hash collision is reduced to an absolute minimum. Therefore, this type additionally provides PartialEq and Eq implementations that compare by hash instead of by value. For this to be correct, your hash implementation must feed all information relevant to the PartialEq impl to the hasher.

Implementations

impl<T> Prehashed<T>

where T: Hash + 'static,

pub fn new(item: T) -> Prehashed<T>

Compute an item’s hash and wrap it.

pub fn into_inner(self) -> T

Return the wrapped value.

pub fn update<F, U>(&mut self, f: F) -> U

where F: FnOnce(&mut T) -> U,

Update the wrapped value and recompute the hash.

Trait Implementations

impl<T> Clone for Prehashed<T>

where T: Clone + ?Sized,

fn clone(&self) -> Prehashed<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Debug for Prehashed<T>

where T: Debug + ?Sized,

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

Formats the value using the given formatter.

impl<T> Default for Prehashed<T>

where T: Default + Hash + 'static,

fn default() -> Prehashed<T>

Returns the “default value” for a type.

impl<T> Deref for Prehashed<T>

where T: ?Sized,

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &<Prehashed<T> as Deref>::Target

Dereferences the value.

impl<T> From<T> for Prehashed<T>

where T: Hash + 'static,

fn from(value: T) -> Prehashed<T>

Converts to this type from the input type.

impl<T> Hash for Prehashed<T>

where T: ?Sized,

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

where H: Hasher,

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> Ord for Prehashed<T>

where T: Ord + ?Sized,

fn cmp(&self, other: &Prehashed<T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T> PartialEq for Prehashed<T>

where T: ?Sized,

fn eq(&self, other: &Prehashed<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> PartialOrd for Prehashed<T>

where T: PartialOrd + ?Sized,

fn partial_cmp(&self, other: &Prehashed<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T> Copy for Prehashed<T>

where T: Copy + ?Sized,

impl<T> Eq for Prehashed<T>

where T: ?Sized,