Struct lark_unify::UnificationTable

pub struct UnificationTable<Interners, Cause> { /* fields omitted */ }

Methods

impl<Interners, Cause> UnificationTable<Interners, Cause>

pub fn new(interners: Interners) -> Self

pub fn shallow_resolve_data<K>(
    &mut self,
    value: K
) -> Result<K::KnownData, InferVar> where
    K: Inferable<Interners>, 

value to a known-value, if possible. Else, it must be an inference variable, so return that InferVar.

pub fn is_known(
    &mut self,
    index: impl Inferable<Interners>
) -> bool

True if index has been assigned to a value, false otherwise.

pub fn var_is_known(&mut self, var: InferVar) -> bool

True if var has been assigned to a value, false otherwise.

pub fn new_inferable<K>(&mut self) -> K where
    K: Inferable<Interners>, 

Creates a new inferable thing.

pub fn drain_events(
    &mut self
) -> impl Iterator<Item = InferVar> + '_

Read out all the variables that may have been unified since the last invocation to drain_events.

pub fn unify<K>(
    &mut self,
    cause: Cause,
    key1: K,
    key2: K
) -> Result<(), (K::KnownData, K::KnownData)> where
    K: Inferable<Interners>, 

Tries to unify key1 and key2 -- if one or both is an unbound inference variable, we will record the connection between them. But if they both represent known values, then we will return the two known values so you can recursively unify those.

Trait Implementations

impl<Interners: Clone, Cause: Clone> Clone for UnificationTable<Interners, Cause>

fn clone(&self) -> UnificationTable<Interners, Cause>

Returns a copy of the value.

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

Performs copy-assignment from source.