Struct moniker::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

Methods

impl<P> Rec<P>

pub fn new<N>(pattern: P) -> Rec<P> where     N: Clone,     P: BoundPattern<N>,

pub fn unrec<N>(self) -> P where     N: Clone,     P: BoundPattern<N>,

Trait Implementations

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

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

Formats the value using the given formatter.

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

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

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

This method tests for !=.

impl<P: Eq> Eq for Rec<P>

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

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

Alpha equivalence in a pattern context

fn close_pattern(&mut self, state: ScopeState, binders: &[Binder<N>])

fn open_pattern(&mut self, state: ScopeState, binders: &[Binder<N>])

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

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

fn binders(&self) -> Vec<Binder<N>> where     N: Clone,

Returns the binders in this pattern