Struct HashConsed

pub struct HashConsed<T>(HashByAddr<Arc<T>>);

Hash-consed data structure: a reference-counted wrapper that guarantees that two equal value will be stored at the same address. This makes it possible to use the pointer address as a hash value.

Tuple Fields

0: HashByAddr<Arc<T>>

Implementations

impl<T> HashConsed<T>

pub fn inner(&self) -> &T

impl<T> HashConsed<T>

where T: Hash + PartialEq + Eq + Clone + Mappable,

pub fn new(inner: T) -> Self

pub fn with_inner_mut<R>(&mut self, f: impl FnOnce(&mut T) -> R) -> R

Clones if needed to get mutable access to the inner value.

fn intern(inner: T) -> Self

Deduplicate the values by hashing them. This deduplication is crucial for the hashing function to be correct. This is the only function allowed to create Self values.

Trait Implementations

impl<T: Clone> Clone for HashConsed<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for HashConsed<T>

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

Formats the value using the given formatter.

impl<'de, T> Deserialize<'de> for HashConsed<T>

where T: Hash + PartialEq + Eq + Clone + Mappable + Deserialize<'de>,

Manual impl to make sure we re-establish sharing!

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'s, T, V: Visit<'s, T>> Drive<'s, V> for HashConsed<T>

fn drive_inner(&'s self, v: &mut V) -> ControlFlow<V::Break>

Call v.visit() on the immediate contents of self.

impl<'s, T, V> DriveMut<'s, V> for HashConsed<T>

where T: Hash + PartialEq + Eq + Clone + Mappable, V: for<'a> VisitMut<'a, T>,

Note: this explores the inner value mutably by cloning and re-hashing afterwards.

fn drive_inner_mut(&'s mut self, v: &mut V) -> ControlFlow<V::Break>

Call v.visit() on the immediate contents of self.

impl<T: Hash> Hash for HashConsed<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 HashConsed<T>

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

where T: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: Eq> Eq for HashConsed<T>

impl<T> StructuralPartialEq for HashConsed<T>