Enum SortVarVal 

pub enum SortVarVal {
    Unsolved(SortCstr),
    Solved(Sort),
}

Unification value for sort variables used during sort checking.

Variants

Unsolved(SortCstr)

The variable is not yet solved but the solution must satisfy some constraint.

Solved(Sort)

The variable has been solved to a sort.

Implementations

impl SortVarVal

pub fn solved_or(&self, sort: &Sort) -> Sort

pub fn map_solved(&self, f: impl FnOnce(&Sort) -> Sort) -> SortVarVal

Trait Implementations

impl Clone for SortVarVal

fn clone(&self) -> SortVarVal

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SortVarVal

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

Formats the value using the given formatter.

impl Default for SortVarVal

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for SortVarVal

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl UnifyValue for SortVarVal

type Error = ()

Defines the type to return when merging of two values fails. If merging is infallible, use the special struct NoError found in this crate, which unlocks various more convenient methods on the unification table.

fn unify_values(value1: &Self, value2: &Self) -> Result<Self, Self::Error>

Given two values, produce a new value that combines them. If that is not possible, produce an error.

impl Eq for SortVarVal

impl StructuralPartialEq for SortVarVal