Struct Rec 

pub struct Rec<P> {
    pub unsafe_pattern: P,
}

Recursively bind a pattern in itself

Mutually recursive bindings can be modelled by combining this type with the pattern implementations for Vec<P> and (P1, P2).

Fields

unsafe_pattern: P

Implementations

impl<P> Rec<P>

pub fn new<N>(pattern: P) -> Rec<P>

where N: Clone + PartialEq, P: BoundPattern<N>,

pub fn unrec<N>(self) -> P

where N: Clone + PartialEq, P: BoundPattern<N>,

Trait Implementations

impl<N, P> BoundPattern<N> for Rec<P>

where N: Clone + PartialEq, P: BoundPattern<N>,

fn pattern_eq(&self, other: &Rec<P>) -> bool

Alpha equivalence for patterns

fn close_pattern(&mut self, state: ScopeState, on_free: &impl OnFreeFn<N>)

Close the terms in the pattern using the supplied binders

fn open_pattern(&mut self, state: ScopeState, on_bound: &impl OnBoundFn<N>)

Open the terms in the pattern using the supplied binders

fn visit_vars(&self, on_var: &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, on_var: &mut impl FnMut(&mut Var<N>))

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

fn visit_binders(&self, on_binder: &mut impl FnMut(&Binder<N>))

Visit each of the binders in the term, calling the on_binder callback on each of them in turn

fn visit_mut_binders(&mut self, on_binder: &mut impl FnMut(&mut Binder<N>))

Visit each of the binders in the term, calling the on_binder callback on each of them in turn

fn free_vars(&self) -> HashSet<FreeVar<N>>

where N: Eq + Hash + Clone,

Returns the set of free variables in this term

fn binders(&self) -> Vec<Binder<N>>

where N: Clone,

Returns the binders in this pattern

impl<P: Clone> Clone for Rec<P>

fn clone(&self) -> Rec<P>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<P: Debug> Debug for Rec<P>

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

Formats the value using the given formatter.

impl<P: PartialEq> PartialEq for Rec<P>

fn eq(&self, other: &Rec<P>) -> 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<P: Eq> Eq for Rec<P>

impl<P> StructuralPartialEq for Rec<P>