Struct lib_ruby_parser::nodes::CaseMatch

#[repr(C)]
pub struct CaseMatch {
    pub expr: Box<Node>,
    pub in_bodies: Vec<Node>,
    pub else_body: Option<Box<Node>>,
    pub keyword_l: Loc,
    pub else_l: Option<Loc>,
    pub end_l: Loc,
    pub expression_l: Loc,
}

Represents a case statement used for pattern matching (for regular case see Case node)

Fields

expr: Box<Node>

Expression given to case, Int("1") for case 1; in 1; end None for code like

case
in pattern
end

in_bodies: Vec<Node>

A list of InPattern nodes (each has pattern, guard and body)

else_body: Option<Box<Node>>

Body of the else branch, None if there’s no else branch

keyword_l: Loc

Location of the case keyword

case 1; in 2; end
~~~~

else_l: Option<Loc>

Location of the else keyword

case 1; in 2; else; end
              ~~~~

None if there’s no else branch

end_l: Loc

Location of the end keyword

case 1; in 2; end
              ~~~

expression_l: Loc

Location of the full expression

case 1; in 2; end
~~~~~~~~~~~~~~~~~

Trait Implementations

impl Clone for CaseMatch

fn clone(&self) -> CaseMatch

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for CaseMatch

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

Formats the value using the given formatter.

impl PartialEq<CaseMatch> for CaseMatch

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