Struct ena::unify::VarValue

pub struct VarValue<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: PartialEq + UnifyKey> PartialEq for VarValue<K> where
    K::Value: PartialEq, 

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

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

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

This method tests for !=.

impl<K: Clone + UnifyKey> Clone for VarValue<K> where
    K::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 + UnifyKey> Debug for VarValue<K> where
    K::Value: Debug, 

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

Formats the value using the given formatter.