Struct rustc_data_structures::unify::VarValue [−][src]
pub struct VarValue<K> where
K: UnifyKey, { /* fields omitted */ }
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: UnifyKey + Clone,
<K as UnifyKey>::Value: Clone,
[src]
impl<K> Clone for VarValue<K> where
K: UnifyKey + Clone,
<K as UnifyKey>::Value: Clone,
fn clone(&self) -> VarValue<K>
[src]
fn clone(&self) -> VarValue<K>
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
fn clone_from(&mut self, source: &Self)
1.0.0
[src]Performs copy-assignment from source
. Read more
impl<K> Debug for VarValue<K> where
K: UnifyKey + Debug,
<K as UnifyKey>::Value: Debug,
[src]
impl<K> Debug for VarValue<K> where
K: UnifyKey + Debug,
<K as UnifyKey>::Value: Debug,
fn fmt(&self, f: &mut Formatter) -> Result<(), Error>
[src]
fn fmt(&self, f: &mut Formatter) -> Result<(), Error>
Formats the value using the given formatter. Read more
impl<K> PartialEq<VarValue<K>> for VarValue<K> where
K: UnifyKey + PartialEq<K>,
<K as UnifyKey>::Value: PartialEq<<K as UnifyKey>::Value>,
[src]
impl<K> PartialEq<VarValue<K>> for VarValue<K> where
K: UnifyKey + PartialEq<K>,
<K as UnifyKey>::Value: PartialEq<<K as UnifyKey>::Value>,