Struct ra_ap_rustc_data_structures::unify::VarValue

pub struct VarValue<K>
where
    K: UnifyKey,
{ /* private fields */ }

Value of a unification key. We implement Tarjan’s union-find algorithm: when two keys are unified, one of them is converted into a “redirect” pointing at the other. These redirects form a DAG: the roots of the DAG (nodes that are not redirected) are each associated with a value of type V and a rank. The rank is used to keep the DAG relatively balanced, which helps keep the running time of the algorithm under control. For more information, see http://en.wikipedia.org/wiki/Disjoint-set_data_structure.

Trait Implementations

impl<K> Clone for VarValue<K>

where K: Clone + UnifyKey, <K as UnifyKey>::Value: Clone,

fn clone(&self) -> VarValue<K>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K> Debug for VarValue<K>

where K: Debug + UnifyKey, <K as UnifyKey>::Value: Debug,

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

Formats the value using the given formatter.

impl<K> PartialEq for VarValue<K>

where K: PartialEq + UnifyKey, <K as UnifyKey>::Value: PartialEq,

fn eq(&self, other: &VarValue<K>) -> 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<K> StructuralPartialEq for VarValue<K>

where K: UnifyKey,