Struct hashconsing::HConsed

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

A hashconsed value.

Implementations

impl<T> HConsed<T>

pub fn get(&self) -> &T

The inner element. Can also be accessed via dereferencing.

pub fn uid(&self) -> u64

The unique identifier of the element.

pub fn to_weak(&self) -> WHConsed<T>

Turns a hashconsed thing in a weak hashconsed thing.

pub fn to_weak_ref(&self) -> Weak<T>

Weak reference version.

pub fn arc_count(&self) -> usize

Number of (strong) references to this term.

Trait Implementations

impl<T> Clone for HConsed<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 HConsed<T>

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

Formats the value using the given formatter.

impl<T> Deref for HConsed<T>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &T

Dereferences the value.

impl<T: Display> Display for HConsed<T>

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

Formats the value using the given formatter.

impl<T> FromIterator<HConsed<<T as HashConsed>::Inner>> for HConSet<T>where T: HashConsed, T::Inner: Hash + Eq,

fn from_iter<I: IntoIterator<Item = HConsed<T::Inner>>>(iter: I) -> Self

Creates a value from an iterator.

impl<T, S> FromIterator<HConsed<<T as HashConsed>::Inner>> for HConSet<T, S>where T: HashConsed, T::Inner: Hash + Eq, S: BuildHasher + Default,

fn from_iter<I: IntoIterator<Item = HConsed<T::Inner>>>(iter: I) -> Self

Creates a value from an iterator.

impl<T: Hash> Hash for HConsed<T>

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

type Inner = T

Elements stored inside a hashconsed value.

impl<T> Ord for HConsed<T>

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

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

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl<T> PartialEq<HConsed<T>> for HConsed<T>

fn eq(&self, rhs: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T> PartialOrd<HConsed<T>> for HConsed<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

This method tests less than (for self and other) and is used by the < operator.

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

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

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

This method tests greater than (for self and other) and is used by the > operator.

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

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

impl<T> Eq for HConsed<T>