X-Git-Url: https://git.lizzy.rs/?a=blobdiff_plain;f=clippy_lints%2Fsrc%2Fbooleans.rs;h=cc399a1f8a00946dba1a0c31d820925a8541beb3;hb=81810fa8f400b1d941b8bf14b2d085cf0a045ae1;hp=2bff1ba48aa595ec7938dd4f55fab318a900646c;hpb=39947992b57239de6581c9761dfad7ac3cf001c8;p=rust.git diff --git a/clippy_lints/src/booleans.rs b/clippy_lints/src/booleans.rs index 2bff1ba48aa..cc399a1f8a0 100644 --- a/clippy_lints/src/booleans.rs +++ b/clippy_lints/src/booleans.rs @@ -1,17 +1,16 @@ use crate::utils::{ - get_trait_def_id, implements_trait, in_macro, match_type, paths, snippet_opt, span_lint_and_sugg, + get_trait_def_id, implements_trait, in_macro, is_type_diagnostic_item, paths, snippet_opt, span_lint_and_sugg, span_lint_and_then, SpanlessEq, }; use if_chain::if_chain; -use rustc::hir::map::Map; -use rustc::lint::{LateContext, LateLintPass}; +use rustc_ast::ast::LitKind; use rustc_errors::Applicability; -use rustc_hir::intravisit; -use rustc_hir::intravisit::*; -use rustc_hir::*; +use rustc_hir::intravisit::{walk_expr, FnKind, NestedVisitorMap, Visitor}; +use rustc_hir::{BinOpKind, Body, Expr, ExprKind, FnDecl, HirId, UnOp}; +use rustc_lint::{LateContext, LateLintPass}; +use rustc_middle::hir::map::Map; use rustc_session::{declare_lint_pass, declare_tool_lint}; use rustc_span::source_map::Span; -use syntax::ast::LitKind; declare_clippy_lint! { /// **What it does:** Checks for boolean expressions that can be written more @@ -60,7 +59,7 @@ impl<'a, 'tcx> LateLintPass<'a, 'tcx> for NonminimalBool { fn check_fn( &mut self, cx: &LateContext<'a, 'tcx>, - _: intravisit::FnKind<'tcx>, + _: FnKind<'tcx>, _: &'tcx FnDecl<'_>, body: &'tcx Body<'_>, _: Span, @@ -162,7 +161,7 @@ struct SuggestContext<'a, 'tcx, 'v> { impl<'a, 'tcx, 'v> SuggestContext<'a, 'tcx, 'v> { fn recurse(&mut self, suggestion: &Bool) -> Option<()> { - use quine_mc_cluskey::Bool::*; + use quine_mc_cluskey::Bool::{And, False, Not, Or, Term, True}; match suggestion { True => { self.output.push_str("true"); @@ -207,7 +206,7 @@ fn recurse(&mut self, suggestion: &Bool) -> Option<()> { } }, Or(v) => { - for (index, inner) in v.iter().enumerate() { + for (index, inner) in v.iter().rev().enumerate() { if index > 0 { self.output.push_str(" || "); } @@ -248,9 +247,11 @@ fn simplify_not(cx: &LateContext<'_, '_>, expr: &Expr<'_>) -> Option { )) }) }, - ExprKind::MethodCall(path, _, args) if args.len() == 1 => { - let type_of_receiver = cx.tables.expr_ty(&args[0]); - if !match_type(cx, type_of_receiver, &paths::OPTION) && !match_type(cx, type_of_receiver, &paths::RESULT) { + ExprKind::MethodCall(path, _, args, _) if args.len() == 1 => { + let type_of_receiver = cx.tables().expr_ty(&args[0]); + if !is_type_diagnostic_item(cx, type_of_receiver, sym!(option_type)) + && !is_type_diagnostic_item(cx, type_of_receiver, sym!(result_type)) + { return None; } METHODS_WITH_NEGATION @@ -278,7 +279,7 @@ fn suggest(cx: &LateContext<'_, '_>, suggestion: &Bool, terminals: &[&Expr<'_>]) } fn simple_negate(b: Bool) -> Bool { - use quine_mc_cluskey::Bool::*; + use quine_mc_cluskey::Bool::{And, False, Not, Or, Term, True}; match b { True => False, False => True, @@ -326,7 +327,7 @@ fn recurse(b: &Bool, stats: &mut Stats) { &Term(n) => stats.terminals[n as usize] += 1, } } - use quine_mc_cluskey::Bool::*; + use quine_mc_cluskey::Bool::{And, False, Not, Or, Term, True}; let mut stats = Stats::default(); recurse(b, &mut stats); stats @@ -359,7 +360,7 @@ fn bool_expr(&self, e: &'tcx Expr<'_>) { } simplified.push(simple_negated); } - let mut improvements = Vec::new(); + let mut improvements = Vec::with_capacity(simplified.len()); 'simplified: for suggestion in &simplified { let simplified_stats = terminal_stats(suggestion); let mut improvement = false; @@ -375,13 +376,13 @@ fn bool_expr(&self, e: &'tcx Expr<'_>) { LOGIC_BUG, e.span, "this boolean expression contains a logic bug", - |db| { - db.span_help( + |diag| { + diag.span_help( h2q.terminals[i].span, "this expression can be optimized out by applying boolean operations to the \ outer expression", ); - db.span_suggestion( + diag.span_suggestion( e.span, "it would look like the following", suggest(self.cx, suggestion, &h2q.terminals), @@ -410,8 +411,8 @@ fn bool_expr(&self, e: &'tcx Expr<'_>) { NONMINIMAL_BOOL, e.span, "this boolean expression can be simplified", - |db| { - db.span_suggestions( + |diag| { + diag.span_suggestions( e.span, "try", suggestions.into_iter(), @@ -449,7 +450,7 @@ fn visit_expr(&mut self, e: &'tcx Expr<'_>) { self.bool_expr(e) }, ExprKind::Unary(UnOp::UnNot, inner) => { - if self.cx.tables.node_types()[inner.hir_id].is_bool() { + if self.cx.tables().node_types()[inner.hir_id].is_bool() { self.bool_expr(e); } else { walk_expr(self, e); @@ -458,13 +459,13 @@ fn visit_expr(&mut self, e: &'tcx Expr<'_>) { _ => walk_expr(self, e), } } - fn nested_visit_map(&mut self) -> NestedVisitorMap<'_, Self::Map> { + fn nested_visit_map(&mut self) -> NestedVisitorMap { NestedVisitorMap::None } } fn implements_ord<'a, 'tcx>(cx: &'a LateContext<'a, 'tcx>, expr: &Expr<'_>) -> bool { - let ty = cx.tables.expr_ty(expr); + let ty = cx.tables().expr_ty(expr); get_trait_def_id(cx, &paths::ORD).map_or(false, |id| implements_trait(cx, ty, id, &[])) } @@ -492,7 +493,7 @@ fn visit_expr(&mut self, expr: &'tcx Expr<'_>) { walk_expr(self, expr); } - fn nested_visit_map(&mut self) -> NestedVisitorMap<'_, Self::Map> { + fn nested_visit_map(&mut self) -> NestedVisitorMap { NestedVisitorMap::None } }