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: HashConsable,

pub fn new(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.

pub fn from_arc(inner: Arc<T>) -> Self

Rarely used: in case we already have an Arc, may avoid an allocation.

pub fn as_mut(&mut self) -> impl DerefMut<Target = T>

Get a reference to the pointed-to value that can be mutated. Avoids cloning/allocation if this is the sole pointer to that value.

The returned value must not be leaked as this would break the hash-consing invariant.

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.

Trait Implementations

impl<T: AstVisitable + HashConsable> AstVisitable for HashConsed<T>

fn drive<V: VisitAst>(&self, v: &mut V) -> ControlFlow<V::Break>

Recursively visit this type with the provided visitor. This calls the visitor’s visit_$any method if it exists, otherwise visit_inner.

fn drive_mut<V: VisitAstMut>(&mut self, v: &mut V) -> ControlFlow<V::Break>

Recursively visit this type with the provided visitor. This calls the visitor’s visit_$any method if it exists, otherwise visit_inner.

fn drive_two<V: ZipAst>(&self, other: &Self, v: &mut V) -> ControlFlow<V::Break>

Recursively visit this type with the provided visitor. This calls the visitor’s visit_$any method if it exists, otherwise visit_inner.

fn name(&self) -> &'static str

The name of the type, used for debug logging.

fn dyn_visit<T: AstVisitable>(&self, f: impl FnMut(&T))

where Self: Sized,

Visit all occurrences of that type inside self, in pre-order traversal.

fn dyn_visit_mut<T: AstVisitable>(&mut self, f: impl FnMut(&mut T))

where Self: Sized,

Visit all occurrences of that type inside self, in pre-order traversal.

impl<T> Clone for HashConsed<T>

fn clone(&self) -> Self

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<T> Deref for HashConsed<T>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

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

where T: Deserialize<'de> + HashConsable,

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

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'de, T, State> DeserializeState<'de, State> for HashConsed<T>

where T: DeserializeState<'de, State> + HashConsable, State: DedupSerializerState,

fn deserialize_state<D>( state: &State, deserializer: D, ) -> Result<Self, D::Error>

where D: Deserializer<'de>,

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: HashConsable, 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<'s, T, V: VisitTwo<'s, T>> DriveTwo<'s, V> for HashConsed<T>

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

Call v.visit() on the immediate contents of self and other, if they correspond. If the values don’t match up, this returns Break(Default::default()).

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

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

fn cmp(&self, other: &Self) -> 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.

fn clamp_to<R>(self, range: R) -> Self

where Self: Sized, R: ClampBounds<Self>,

🔬This is a nightly-only experimental API. (clamp_to)

Restrict a value to a certain range.

impl<T: PartialEq> PartialEq for HashConsed<T>

fn eq(&self, other: &HashConsed<T>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<T: PartialOrd> PartialOrd for HashConsed<T>

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

where T: Serialize + HashConsable,

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T, State> SerializeState<State> for HashConsed<T>

where T: SerializeState<State> + HashConsable, State: DedupSerializerState,

Options for the state are () to serialize values normally and DedupSerializer to deduplicate identical values in the serialized output.

fn serialize_state<S>( &self, state: &State, serializer: S, ) -> Result<S::Ok, S::Error>

where S: Serializer,

impl<T: PartialEq> StructuralPartialEq for HashConsed<T>