Struct LtExpressionNode

pub struct LtExpressionNode { /* private fields */ }

Implementations

impl LtExpressionNode

pub fn left(&self) -> Option<ExpressionNode>

pub fn lt(&self) -> Option<Lt>

pub fn right(&self) -> Option<ExpressionNode>

Trait Implementations

impl AstNode for LtExpressionNode

fn can_cast(kind: Token) -> bool

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

fn syntax(&self) -> &SyntaxNode

fn expect(syntax: SyntaxNode) -> Self

fn clone_for_update(&self) -> Self

where Self: Sized,

fn clone_subtree(&self) -> Self

where Self: Sized,

impl BinaryExpression for LtExpressionNode

fn left(&self) -> Option<ExpressionNode>

fn right(&self) -> Option<ExpressionNode>

impl Clone for LtExpressionNode

fn clone(&self) -> LtExpressionNode

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for LtExpressionNode

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

Formats the value using the given formatter.

impl Hash for LtExpressionNode

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 PartialEq for LtExpressionNode

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

impl StructuralPartialEq for LtExpressionNode