Introduce separate hir::BinaryOp

Unlike ast::BinOp, it has significantly more structure to it, so it's
easier to, say, handle all assignment-like operations in the same way.

1 files changed, 0 insertions, 6 deletions

diff --git a/crates/ra_syntax/src/ast/expr_extensions.rs b/crates/ra_syntax/src/ast/expr_extensions.rs
index 20e390209..cf5b6f251 100644
--- a/crates/ra_syntax/src/ast/expr_extensions.rs
+++ b/crates/ra_syntax/src/ast/expr_extensions.rs
@@ -102,10 +102,6 @@ pub enum BinOp {
     BitwiseOr,
     /// The `&` operator for bitwise AND
     BitwiseAnd,
-    /// The `..` operator for right-open ranges
-    RangeRightOpen,
-    /// The `..=` operator for right-closed ranges
-    RangeRightClosed,
     /// The `=` operator for assignment
     Assignment,
     /// The `+=` operator for assignment after addition
@@ -152,8 +148,6 @@ impl ast::BinExpr {
                 T![^] => BinOp::BitwiseXor,
                 T![|] => BinOp::BitwiseOr,
                 T![&] => BinOp::BitwiseAnd,
-                T![..] => BinOp::RangeRightOpen,
-                T![..=] => BinOp::RangeRightClosed,
                 T![=] => BinOp::Assignment,
                 T![+=] => BinOp::AddAssign,
                 T![/=] => BinOp::DivAssign,