Enum rustc_typeck::middle::infer::unify::VarValueUnstable [-] [+] [src]

pub enum VarValue<K> where K: UnifyKey {
    Redirect(K),
    Root(K::Value, usize),
}

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.

Variants

Redirect
Root

Trait Implementations

Derived Implementations

impl<K> Debug for VarValue<K> where K: UnifyKey + Debug + Debug, K::Value: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

impl<K> Clone for VarValue<K> where K: UnifyKey + Clone + Clone, K::Value: Clone

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

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

impl<K> PartialEq<VarValue<K>> for VarValue<K> where K: UnifyKey + PartialEq<K> + PartialEq<K>, K::Value: PartialEq<K::Value>

fn eq(&self, __arg_0: &VarValue<K>) -> bool

fn ne(&self, __arg_0: &VarValue<K>) -> bool