Struct ExprBinary

pub struct ExprBinary { /* private fields */ }

Implementations

impl ExprBinary

pub const INDEX_LHS: usize = 0usize

pub const INDEX_OP: usize = 1usize

pub const INDEX_RHS: usize = 2usize

pub fn new_green( db: &dyn SyntaxGroup, lhs: ExprGreen, op: BinaryOperatorGreen, rhs: ExprGreen, ) -> ExprBinaryGreen

impl ExprBinary

pub fn lhs(&self, db: &dyn SyntaxGroup) -> Expr

pub fn op(&self, db: &dyn SyntaxGroup) -> BinaryOperator

pub fn rhs(&self, db: &dyn SyntaxGroup) -> Expr

Trait Implementations

impl Clone for ExprBinary

fn clone(&self) -> ExprBinary

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for ExprBinary

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

Formats the value using the given formatter.

impl From<&ExprBinary> for SyntaxStablePtrId

fn from(node: &ExprBinary) -> Self

Converts to this type from the input type.

impl Hash for ExprBinary

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 ExprBinary

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

const OPTIONAL_KIND: Option<SyntaxKind> = _

The relevant SyntaxKind. None for enums.

type StablePtr = ExprBinaryPtr

type Green = ExprBinaryGreen

fn missing(db: &dyn SyntaxGroup) -> Self::Green

fn from_syntax_node(db: &dyn SyntaxGroup, node: SyntaxNode) -> Self

fn as_syntax_node(&self) -> SyntaxNode

fn stable_ptr(&self) -> Self::StablePtr

impl Eq for ExprBinary

impl StructuralPartialEq for ExprBinary