Struct LuaBinaryExpr

pub struct LuaBinaryExpr { /* private fields */ }

Implementations

impl LuaBinaryExpr

pub fn get_exprs(&self) -> Option<(LuaExpr, LuaExpr)>

pub fn get_op_token(&self) -> Option<LuaBinaryOpToken>

Trait Implementations

impl Clone for LuaBinaryExpr

fn clone(&self) -> LuaBinaryExpr

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for LuaBinaryExpr

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

Formats the value using the given formatter.

impl Hash for LuaBinaryExpr

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl LuaAstNode for LuaBinaryExpr

fn syntax(&self) -> &LuaSyntaxNode

fn can_cast(kind: LuaSyntaxKind) -> bool

where Self: Sized,

fn cast(syntax: LuaSyntaxNode) -> Option<Self>

where Self: Sized,

fn child<N: LuaAstNode>(&self) -> Option<N>

fn token<N: LuaAstToken>(&self) -> Option<N>

fn token_by_kind(&self, kind: LuaTokenKind) -> Option<LuaGeneralToken>

fn tokens<N: LuaAstToken>(&self) -> LuaAstTokenChildren<N>

fn children<N: LuaAstNode>(&self) -> LuaAstChildren<N>

fn descendants<N: LuaAstNode>(&self) -> impl Iterator<Item = N>

fn walk_descendants<N: LuaAstNode>(&self) -> impl Iterator<Item = WalkEvent<N>>

fn ancestors<N: LuaAstNode>(&self) -> impl Iterator<Item = N>

fn get_position(&self) -> TextSize

fn get_range(&self) -> TextRange

fn get_syntax_id(&self) -> LuaSyntaxId

fn dump(&self)

impl PartialEq for LuaBinaryExpr

fn eq(&self, other: &LuaBinaryExpr) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for LuaBinaryExpr

impl StructuralPartialEq for LuaBinaryExpr