Struct lib_ruby_parser::nodes::Index

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

Represents indexing operation (i.e. foo[1,2,3])

Fields

recv: Box<Node>

Receiver of indexing

indexes: Vec<Node>

A list of indexes

begin_l: Loc

Location of open bracket

foo[1, 2, 3]
   ~

end_l: Loc

Location of closing bracket

foo[1, 2, 3]
           ~

expression_l: Loc

Location of the full expression

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

Trait Implementations

impl Clone for Index

fn clone(&self) -> Index

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Index

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

Formats the value using the given formatter.

impl PartialEq<Index> for Index

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