Struct moniker::FreeVar

pub struct FreeVar<N> {
    pub unique_id: UniqueId,
    pub pretty_name: Option<N>,
}

A free variable

Fields

unique_id: UniqueId

A generated id

pretty_name: Option<N>

programmer-provided name for pretty-printing

Implementations

impl<N> FreeVar<N>

pub fn fresh(pretty_name: Option<N>) -> FreeVar<N>

Create a fresh free variable, with an optional name hint for pretty printing

pub fn fresh_unnamed() -> FreeVar<N>

Create a fresh free variable, with no name hint

pub fn fresh_named(pretty_name: impl Into<N>) -> FreeVar<N>

Create a fresh free variable, with a name hint for pretty printing

Trait Implementations

impl<N: Clone + PartialEq> BoundTerm<N> for FreeVar<N>

fn term_eq(&self, other: &FreeVar<N>) -> bool

Alpha equivalence for terms

fn close_term(&mut self, _: ScopeState, _: &impl OnFreeFn<N>)

Close the term using the supplied binders

fn open_term(&mut self, _: ScopeState, _: &impl OnBoundFn<N>)

Open the term using the supplied binders

fn visit_vars(&self, _: &mut impl FnMut(&Var<N>))

Visit each variable in the term, calling the on_var callback on each of them in turn

fn visit_mut_vars(&mut self, _: &mut impl FnMut(&mut Var<N>))

Visit each variable in the term, calling the on_var callback on each of them in turn

impl<N: Clone> Clone for FreeVar<N>

fn clone(&self) -> FreeVar<N>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<N: Debug> Debug for FreeVar<N>

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

Formats the value using the given formatter.

impl<N: Display> Display for FreeVar<N>

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

Formats the value using the given formatter.

impl<N> Hash for FreeVar<N>where
    N: Hash,

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where
    H: Hasher,
    Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<N> PartialEq<Binder<N>> for FreeVar<N>where
    N: PartialEq,

fn eq(&self, other: &Binder<N>) -> bool

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

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

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

impl<N> PartialEq<FreeVar<N>> for Binder<N>where
    N: PartialEq,

fn eq(&self, other: &FreeVar<N>) -> bool

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

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

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

impl<N> PartialEq<FreeVar<N>> for FreeVar<N>where
    N: PartialEq,

fn eq(&self, other: &FreeVar<N>) -> bool

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

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

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

impl<N> PartialEq<FreeVar<N>> for Var<N>where
    N: PartialEq,

fn eq(&self, other: &FreeVar<N>) -> bool

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

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

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

impl<N> PartialEq<Var<N>> for FreeVar<N>where
    N: PartialEq,

fn eq(&self, other: &Var<N>) -> bool

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

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

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

impl<N> Eq for FreeVar<N>where
    N: Eq,