@@ -110,7 +110,7 @@ impl<'a, 'tcx, 'v> Hir2Qmm<'a, 'tcx, 'v> {
110
110
// prevent folding of `cfg!` macros and the like
111
111
if !e. span . from_expansion ( ) {
112
112
match & e. kind {
113
- ExprKind :: Unary ( UnOp :: UnNot , inner) => return Ok ( Bool :: Not ( box self . run ( inner) ?) ) ,
113
+ ExprKind :: Unary ( UnOp :: Not , inner) => return Ok ( Bool :: Not ( box self . run ( inner) ?) ) ,
114
114
ExprKind :: Binary ( binop, lhs, rhs) => match & binop. node {
115
115
BinOpKind :: Or => {
116
116
return Ok ( Bool :: Or ( self . extract ( BinOpKind :: Or , & [ lhs, rhs] , Vec :: new ( ) ) ?) ) ;
@@ -454,7 +454,7 @@ impl<'a, 'tcx> Visitor<'tcx> for NonminimalBoolVisitor<'a, 'tcx> {
454
454
ExprKind :: Binary ( binop, _, _) if binop. node == BinOpKind :: Or || binop. node == BinOpKind :: And => {
455
455
self . bool_expr ( e)
456
456
} ,
457
- ExprKind :: Unary ( UnOp :: UnNot , inner) => {
457
+ ExprKind :: Unary ( UnOp :: Not , inner) => {
458
458
if self . cx . typeck_results ( ) . node_types ( ) [ inner. hir_id ] . is_bool ( ) {
459
459
self . bool_expr ( e) ;
460
460
} else {
@@ -482,7 +482,7 @@ impl<'a, 'tcx> Visitor<'tcx> for NotSimplificationVisitor<'a, 'tcx> {
482
482
type Map = Map < ' tcx > ;
483
483
484
484
fn visit_expr ( & mut self , expr : & ' tcx Expr < ' _ > ) {
485
- if let ExprKind :: Unary ( UnOp :: UnNot , inner) = & expr. kind {
485
+ if let ExprKind :: Unary ( UnOp :: Not , inner) = & expr. kind {
486
486
if let Some ( suggestion) = simplify_not ( self . cx , inner) {
487
487
span_lint_and_sugg (
488
488
self . cx ,
0 commit comments