Struct lib_ruby_parser::traverse::finder::Pattern

pub struct Pattern { /* private fields */ }

Pattern that is used for matching.

Consists of multiple finder::Item elements

For example the following pattern:

Pattern::new("args -> arglist -> 2 -> default")

can find a node that represents constant FIND_ME in the following code:

def foo(a, b, c = FIND_ME)
end

It means:

1. enter .args of the Def node ((a, b, c = FIND_ME))
2. enter its .argslist (a, b, c = FIND_ME)
3. enter element [2] (c = FIND_ME)
4. enter .default of the Optarg node (FIND_ME)

Implementations

impl Pattern

pub fn new(input: &str) -> Result<Self, PatternError>

Constructs a pattern from a string, returns an error on the first sub-pattern error

pub fn empty() -> Self

Returns true if pattern is empty

pub fn push(&mut self, item: Item)

Pushes a new Item into a pattern

pub fn pop(&mut self) -> Option<Item>

Pops an Item from a pattern

Trait Implementations

impl Debug for Pattern

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

Formats the value using the given formatter.

impl PartialEq<Pattern> for Pattern

fn eq(&self, other: &Pattern) -> bool

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

const 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 Eq for Pattern

impl StructuralEq for Pattern

impl StructuralPartialEq for Pattern