Struct lib_ruby_parser::nodes::IndexAsgn

#[repr(C)]
pub struct IndexAsgn {
    pub recv: Box<Node>,
    pub indexes: Vec<Node>,
    pub value: Option<Box<Node>>,
    pub begin_l: Loc,
    pub end_l: Loc,
    pub operator_l: Option<Loc>,
    pub expression_l: Loc,
}

Represents assignment using indexing operation (i.e. foo[1, 2, 3] = bar)

Fields

recv: Box<Node>

Receiver of the indexing

indexes: Vec<Node>

A list of indexes

value: Option<Box<Node>>

Value that is assigned

None if assignment is a part of the multi-assignment. In such case value belongs to Masgn node.

begin_l: Loc

Location of open bracket

foo[1, 2, 3] = bar
   ~

end_l: Loc

Location of closing bracket

foo[1, 2, 3] = bar
           ~

operator_l: Option<Loc>

Location of the = operator

foo[1, 2, 3] = bar
             ~

None if assignment is a part of the multi-assignment. In such case operator = belongs to Masgn node.

expression_l: Loc

Location of the full expression

foo[1, 2, 3] = bar
~~~~~~~~~~~~~~~~~~

Trait Implementations

impl Clone for IndexAsgn

fn clone(&self) -> IndexAsgn

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for IndexAsgn

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

Formats the value using the given formatter.

impl PartialEq<IndexAsgn> for IndexAsgn

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