Struct lib_ruby_parser::nodes::Until

#[repr(C)]
pub struct Until {
    pub cond: Box<Node>,
    pub body: Option<Box<Node>>,
    pub keyword_l: Loc,
    pub begin_l: Option<Loc>,
    pub end_l: Option<Loc>,
    pub expression_l: Loc,
}

Represents until loop

Fields

cond: Box<Node>

Condition of the loop

body: Option<Box<Node>>

Body of the loop.

None if body is empty

keyword_l: Loc

Location of the until keyword

until cond do; foo; end
~~~~~

begin_l: Option<Loc>

Location of the do keyword

until cond do; foo; end
           ~~

do is optional, and so begin_l can be None

end_l: Option<Loc>

Location of the end keyword

until cond do; foo; end
                    ~~~

None if loop is a modifier (i.e. foo until bar)

expression_l: Loc

Location of the full expression

until cond do; foo; end
~~~~~~~~~~~~~~~~~~~~~~~

foo until bar
~~~~~~~~~~~~~

Trait Implementations

impl Clone for Until

fn clone(&self) -> Until

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Until

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

Formats the value using the given formatter.

impl PartialEq<Until> for Until

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