Struct gluon_check::substitution::UnionByLevel

pub struct UnionByLevel { /* fields omitted */ }

Specialized union implementation which makes sure that variables with a higher level always point to the lower level variable.

map.union(1, 2); map.find(2) -> 1 map.find(1) -> 1

Trait Implementations

impl From<u32> for UnionByLevel

fn from(index: u32) -> Self

Performs the conversion.

impl Clone for UnionByLevel

fn clone(&self) -> UnionByLevel

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for UnionByLevel

impl Eq for UnionByLevel

impl PartialEq<UnionByLevel> for UnionByLevel

fn eq(&self, other: &UnionByLevel) -> bool

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

fn ne(&self, other: &UnionByLevel) -> bool

This method tests for !=.

impl Debug for UnionByLevel

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

Formats the value using the given formatter.

impl StructuralPartialEq for UnionByLevel

impl StructuralEq for UnionByLevel

impl UnifyKey for UnionByLevel

type Value = Level

fn index(&self) -> u32

fn from_index(index: u32) -> Self

fn tag() -> &'static str

fn order_roots(
    a: Self,
    a_level: &Level,
    b: Self,
    b_level: &Level
) -> Option<(Self, Self)>

If true, then self should be preferred as root to other. Note that we assume a consistent partial ordering, so returning true implies that other.prefer_as_root_to(self) would return false. If there is no ordering between two keys (i.e., a.prefer_as_root_to(b) and b.prefer_as_root_to(a) both return false) then the rank will be used to determine the root in an optimal way.