Struct lib_ruby_parser::nodes::FindPattern

#[repr(C)]
pub struct FindPattern {
    pub elements: Vec<Node>,
    pub begin_l: Option<Loc>,
    pub end_l: Option<Loc>,
    pub expression_l: Loc,
}

Represents a find pattern using in pattern matching (i.e. in [*x, 1 => a, *y])

It’s different from ArrayPattern/ConstPattern because it supports multiple wildcard pattern

Fields

elements: Vec<Node>

Inner part of the find pattern

begin_l: Option<Loc>

Location of the begin

case foo; in [*x, 1 => a, *y]; end
             ~

None if there are no brackets/parentheses

end_l: Option<Loc>

Location of the end

case foo; in [*x, 1 => a, *y]; end
                            ~

None if there are no brackets/parentheses

expression_l: Loc

Location of the full expression

case foo; in [*x, 1 => a, *y]; end
             ~~~~~~~~~~~~~~~~

Trait Implementations

impl Clone for FindPattern

fn clone(&self) -> FindPattern

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for FindPattern

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

Formats the value using the given formatter.

impl PartialEq<FindPattern> for FindPattern

fn eq(&self, other: &FindPattern) -> 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 StructuralPartialEq for FindPattern