Enum rustc_trans::middle::infer::unify::VarValueExperimental [-]  [+] [src]

pub enum VarValue<K, V> {
    Redirect(K),
    Root(V, uint),
}

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

impl<'tcx, K: Repr<'tcx>, V: Repr<'tcx>> Repr<'tcx> for VarValue<K, V>

fn repr(&self, tcx: &ctxt<'tcx>) -> String

Derived Implementations

impl<K: Clone, V: Clone> Clone for VarValue<K, V>

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

fn clone_from(&mut self, &VarValue<K, V>)

impl<K: PartialEq<K>, V: PartialEq<V>> PartialEq<VarValue<K, V>> for VarValue<K, V>

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

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

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