Struct rustc_data_structures::unify::VarValue [−][src]
Expand description
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.
Fields
parent: K
value: <K as UnifyKey>::Value
rank: u32
Auto Trait Implementations
impl<K> RefUnwindSafe for VarValue<K> where
K: RefUnwindSafe,
<K as UnifyKey>::Value: RefUnwindSafe,
impl<K> UnwindSafe for VarValue<K> where
K: UnwindSafe,
<K as UnifyKey>::Value: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
Layout
Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.