Enum ast_grep_config::Rule

pub enum Rule<L: Language> {
    Pattern(PatternCore<StrDoc<L>>),
    Kind(KindMatcher<L>),
    Regex(RegexMatcher<L>),
    Inside(Box<Inside<L>>),
    Has(Box<Has<L>>),
    Precedes(Box<Precedes<L>>),
    Follows(Box<Follows<L>>),
    All(All<L, Rule<L>>),
    Any(Any<L, Rule<L>>),
    Not(Box<Not<L, Rule<L>>>),
    Matches(ReferentRule<L>),
}

Variants

Pattern(PatternCore<StrDoc<L>>)

Kind(KindMatcher<L>)

Regex(RegexMatcher<L>)

Inside(Box<Inside<L>>)

Has(Box<Has<L>>)

Precedes(Box<Precedes<L>>)

Follows(Box<Follows<L>>)

All(All<L, Rule<L>>)

Any(Any<L, Rule<L>>)

Not(Box<Not<L, Rule<L>>>)

Matches(ReferentRule<L>)

Implementations

impl<L: Language> Rule<L>

pub fn is_atomic(&self) -> bool

pub fn is_relational(&self) -> bool

pub fn is_composite(&self) -> bool

Trait Implementations

impl<L: Language> Default for Rule<L>

Rule matches nothing by default. In Math jargon, Rule is vacuously false.

fn default() -> Self

Returns the “default value” for a type.

impl<L: Language> Matcher<L> for Rule<L>

fn match_node_with_env<'tree, D: Doc<Lang = L>>( &self, node: Node<'tree, D>, env: &mut Cow<'_, MetaVarEnv<'tree, D>> ) -> Option<Node<'tree, D>>

Returns the node why the input is matched or None if not matched. The return value is usually input node itself, but it can be different node. For example Has matcher can return the child or descendant node.

fn potential_kinds(&self) -> Option<BitSet>

Returns a bitset for all possible target node kind ids. Returns None if the matcher needs to try against all node kind.

fn get_match_len<D>(&self, _node: Node<'_, D>) -> Option<usize>where D: Doc<Lang = L>,

get_match_len will skip trailing anonymous child node to exclude punctuation.

fn match_node<D, 'tree>( &self, node: Node<'tree, D> ) -> Option<NodeMatch<'tree, D>>where D: Doc<Lang = L>,

fn find_node<D, 'tree>( &self, node: Node<'tree, D> ) -> Option<NodeMatch<'tree, D>>where D: Doc<Lang = L>,