#[non_exhaustive]
pub enum BinOp {
Show 15 variants
And(TokenReference),
Caret(TokenReference),
GreaterThan(TokenReference),
GreaterThanEqual(TokenReference),
LessThan(TokenReference),
LessThanEqual(TokenReference),
Minus(TokenReference),
Or(TokenReference),
Percent(TokenReference),
Plus(TokenReference),
Slash(TokenReference),
Star(TokenReference),
TildeEqual(TokenReference),
TwoDots(TokenReference),
TwoEqual(TokenReference),
}
Expand description
Operators that require two operands, such as X + Y or X - Y
Variants (Non-exhaustive)
This enum is marked as non-exhaustive
And(TokenReference)
Caret(TokenReference)
GreaterThan(TokenReference)
GreaterThanEqual(TokenReference)
LessThan(TokenReference)
LessThanEqual(TokenReference)
Minus(TokenReference)
Or(TokenReference)
Percent(TokenReference)
Plus(TokenReference)
Slash(TokenReference)
Star(TokenReference)
TildeEqual(TokenReference)
TwoDots(TokenReference)
TwoEqual(TokenReference)
Implementations
sourceimpl BinOp
impl BinOp
sourcepub fn precedence(&self) -> u8
pub fn precedence(&self) -> u8
The precedence of the operator, from a scale of 1 to 8. The larger the number, the higher the precedence. See more at http://www.lua.org/manual/5.1/manual.html#2.5.6
sourcepub fn is_right_associative(&self) -> bool
pub fn is_right_associative(&self) -> bool
Whether the operator is right associative. If not, it is left associative. See more at https://www.lua.org/pil/3.5.html
sourcepub fn token(&self) -> &TokenReference
pub fn token(&self) -> &TokenReference
The token associated with the operator
Trait Implementations
sourceimpl<'de> Deserialize<'de> for BinOp
impl<'de> Deserialize<'de> for BinOp
sourcefn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
sourceimpl Node for BinOp
impl Node for BinOp
sourcefn start_position(&self) -> Option<Position>
fn start_position(&self) -> Option<Position>
The start position of a node. None if can’t be determined
sourcefn end_position(&self) -> Option<Position>
fn end_position(&self) -> Option<Position>
The end position of a node. None if it can’t be determined
sourcefn similar(&self, other: &Self) -> bool
fn similar(&self, other: &Self) -> bool
Whether another node of the same type is the same as this one semantically, ignoring position
sourcefn tokens<'a>(&'a self) -> Tokens<'a>ⓘNotable traits for Tokens<'a>impl<'a> Iterator for Tokens<'a> type Item = &'a TokenReference;
fn tokens<'a>(&'a self) -> Tokens<'a>ⓘNotable traits for Tokens<'a>impl<'a> Iterator for Tokens<'a> type Item = &'a TokenReference;
The token references that comprise a node
impl StructuralPartialEq for BinOp
Auto Trait Implementations
impl RefUnwindSafe for BinOp
impl Send for BinOp
impl Sync for BinOp
impl Unpin for BinOp
impl UnwindSafe for BinOp
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcepub fn borrow_mut(&mut self) -> &mut T
pub fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcepub fn to_owned(&self) -> T
pub fn to_owned(&self) -> T
Creates owned data from borrowed data, usually by cloning. Read more
sourcepub fn clone_into(&self, target: &mut T)
pub fn clone_into(&self, target: &mut T)
toowned_clone_into
)Uses borrowed data to replace owned data, usually by cloning. Read more