Enum Pat 

pub enum Pat<L>
where
    L: Recursive,
    AsLanguage<L>: Language,
{
    PatVar(Var),
    Wrap(Signature<L, Box<Pat<L>>>),
}

Recursive AST for patterns in language L. This can be converted to/from Pattern<AsLanguage<L>>.

User can also define [From<L> for Pat<L>] for concrete L with Self::wrap.

Language derive macro will genrate a newtype wrapper of this type, which implements egg::Searcher and egg::Applier too, and it can have (otherwise orphan) custom instances.

Variants

PatVar(Var)

Variable in pattern.

Wrap(Signature<L, Box<Pat<L>>>)

Recursive pattern.

Implementations

impl<L> Pat<L>

where L: Recursive, AsLanguage<L>: Language,

pub fn pat_var<'a, S: Into<Cow<'a, str>>>(v: S) -> Self

Smart constructor for a variable. NOTE: this DOES NOT require ?-prefix before the identifier.

pub fn unwrap(self) -> ENodeOrVar<Signature<L, Self>>

Unwraps the pattern recursion by one layer.

pub fn wrap(inner: Signature<L, Self>) -> Self

Wraps the pattern recursion by one layer.

impl<L> Pat<L>

where L: Recursive, AsLanguage<L>: Language,

pub fn into_pattern_ast(self) -> PatternAst<AsLanguage<L>>

Convert a recursive pattern into a PatternAst<L>. See also: Self::to_pattern_ast.

pub fn to_pattern_ast(&self) -> PatternAst<AsLanguage<L>>

Convert a borrowed recursive pattern to a PatternAst<L>. See also: Self::into_pattern_ast.

pub fn from_pattern_ast(ast: &PatternAst<AsLanguage<L>>, id: Id) -> Self

Convert a PatternAst<L> into a recursive pattern.

pub fn add_into_pattern_ast(self, ast: &mut PatternAst<AsLanguage<L>>) -> Id

Adds the pattern into an existing PatternAst and returns the id of the root node. See also: Self::into_pattern_ast, Self::add_to_pattern_ast.

pub fn add_to_pattern_ast(&self, ast: &mut PatternAst<AsLanguage<L>>) -> Id

Adds the borrowed pattern into an existing PatternAst and returns the id of the root node. See also: Self::to_pattern_ast, Self::add_into_pattern_ast.

Trait Implementations

impl<L, N> Applier<<L as Functor>::Container<Id>, N> for Pat<L>

where L: Recursive, AsLanguage<L>: Language, N: Analysis<AsLanguage<L>>,

fn apply_one( &self, egraph: &mut EGraph<AsLanguage<L>, N>, eclass: Id, subst: &Subst, searcher_ast: Option<&PatternAst<AsLanguage<L>>>, rule_name: Symbol, ) -> Vec<Id>

Apply a single substitution.

fn apply_matches( &self, egraph: &mut EGraph<L, N>, matches: &[SearchMatches<'_, L>], rule_name: GlobalSymbol, ) -> Vec<Id>

Apply many substitutions.

fn get_pattern_ast(&self) -> Option<&RecExpr<ENodeOrVar<L>>>

For patterns, get the ast directly as a reference.

fn vars(&self) -> Vec<Var>

Returns a list of variables that this Applier assumes are bound.

impl<L> Clone for Pat<L>

where L: Recursive, AsLanguage<L>: Language,

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<L> From<&Pat<L>> for Pattern<AsLanguage<L>>

where L: Recursive, AsLanguage<L>: Language,

fn from(value: &Pat<L>) -> Self

Converts to this type from the input type.

impl<L> From<&Pat<L>> for PatternAst<AsLanguage<L>>

where L: Recursive, AsLanguage<L>: Language,

fn from(value: &Pat<L>) -> Self

Converts to this type from the input type.

impl<L> From<L> for Pat<L>

where L: Recursive, AsLanguage<L>: Language,

fn from(value: L) -> Self

Converts to this type from the input type.

impl<L> From<Pat<L>> for Pattern<AsLanguage<L>>

where L: Recursive, AsLanguage<L>: Language,

fn from(value: Pat<L>) -> Self

Converts to this type from the input type.

impl<L> From<Pat<L>> for PatternAst<AsLanguage<L>>

where L: Recursive, AsLanguage<L>: Language,

fn from(value: Pat<L>) -> Self

Converts to this type from the input type.

impl<L> From<Pattern<<L as Functor>::Container<Id>>> for Pat<L>

where L: Recursive, AsLanguage<L>: Language,

fn from(value: Pattern<AsLanguage<L>>) -> Self

Converts to this type from the input type.

impl<L> From<RecExpr<ENodeOrVar<<L as Functor>::Container<Id>>>> for Pat<L>

where L: Recursive, AsLanguage<L>: Language,

fn from(value: PatternAst<AsLanguage<L>>) -> Self

Converts to this type from the input type.

impl<L> From<Var> for Pat<L>

where L: Recursive, AsLanguage<L>: Language,

fn from(value: Var) -> Self

Converts to this type from the input type.

impl<L, N> Searcher<<L as Functor>::Container<Id>, N> for Pat<L>

where L: Recursive, AsLanguage<L>: Language, N: Analysis<AsLanguage<L>>,

fn search_eclass_with_limit( &self, egraph: &EGraph<AsLanguage<L>, N>, eclass: Id, limit: usize, ) -> Option<SearchMatches<'_, AsLanguage<L>>>

Similar to search_eclass, but return at most limit many matches.

fn vars(&self) -> Vec<Var>

Returns a list of the variables bound by this Searcher

fn search_eclass( &self, egraph: &EGraph<L, N>, eclass: Id, ) -> Option<SearchMatches<'_, L>>

Search one eclass, returning None if no matches can be found. This should not return a SearchMatches with no substs.

fn search(&self, egraph: &EGraph<L, N>) -> Vec<SearchMatches<'_, L>>

Search the whole EGraph, returning a list of all the SearchMatches where something was found. This just calls Searcher::search_with_limit with a big limit.

fn search_with_limit( &self, egraph: &EGraph<L, N>, limit: usize, ) -> Vec<SearchMatches<'_, L>>

Similar to search, but return at most limit many matches.

fn n_matches(&self, egraph: &EGraph<L, N>) -> usize

Returns the number of matches in the e-graph

fn get_pattern_ast(&self) -> Option<&RecExpr<ENodeOrVar<L>>>

For patterns, return the ast directly as a reference