rust/clippy_lints/src/double_comparison.rs

87 lines
2.9 KiB
Rust
Raw Normal View History

2018-01-29 19:35:35 -06:00
//! Lint on unnecessary double comparisons. Some examples:
use rustc::hir::*;
use rustc::lint::*;
2018-07-19 02:53:23 -05:00
use rustc::{declare_lint, lint_array};
2018-01-29 19:35:35 -06:00
use syntax::codemap::Span;
2018-05-30 03:15:50 -05:00
use crate::utils::{snippet, span_lint_and_sugg, SpanlessEq};
2018-01-29 19:35:35 -06:00
/// **What it does:** Checks for double comparions that could be simpified to a single expression.
///
///
/// **Why is this bad?** Readability.
///
/// **Known problems:** None.
///
/// **Example:**
/// ```rust
/// x == y || x < y
/// ```
///
/// Could be written as:
///
/// ```rust
/// x <= y
/// ```
2018-03-28 08:24:26 -05:00
declare_clippy_lint! {
2018-01-29 19:35:35 -06:00
pub DOUBLE_COMPARISONS,
2018-03-28 08:24:26 -05:00
complexity,
2018-01-29 19:35:35 -06:00
"unnecessary double comparisons that can be simplified"
}
pub struct DoubleComparisonPass;
impl LintPass for DoubleComparisonPass {
fn get_lints(&self) -> LintArray {
lint_array!(DOUBLE_COMPARISONS)
}
}
impl<'a, 'tcx> DoubleComparisonPass {
fn check_binop(
&self,
cx: &LateContext<'a, 'tcx>,
2018-07-12 02:50:09 -05:00
op: BinOpKind,
2018-01-29 19:35:35 -06:00
lhs: &'tcx Expr,
rhs: &'tcx Expr,
span: Span,
) {
let (lkind, llhs, lrhs, rkind, rlhs, rrhs) = match (lhs.node.clone(), rhs.node.clone()) {
2018-07-12 02:30:57 -05:00
(ExprKind::Binary(lb, llhs, lrhs), ExprKind::Binary(rb, rlhs, rrhs)) => {
2018-01-29 19:35:35 -06:00
(lb.node, llhs, lrhs, rb.node, rlhs, rrhs)
}
_ => return,
};
2018-05-17 13:17:21 -05:00
let mut spanless_eq = SpanlessEq::new(cx).ignore_fn();
2018-01-29 19:35:35 -06:00
if !(spanless_eq.eq_expr(&llhs, &rlhs) && spanless_eq.eq_expr(&lrhs, &rrhs)) {
return;
}
macro_rules! lint_double_comparison {
($op:tt) => {{
let lhs_str = snippet(cx, llhs.span, "");
let rhs_str = snippet(cx, lrhs.span, "");
let sugg = format!("{} {} {}", lhs_str, stringify!($op), rhs_str);
span_lint_and_sugg(cx, DOUBLE_COMPARISONS, span,
"This binary expression can be simplified",
"try", sugg);
}}
}
match (op, lkind, rkind) {
2018-07-12 02:50:09 -05:00
(BinOpKind::Or, BinOpKind::Eq, BinOpKind::Lt) | (BinOpKind::Or, BinOpKind::Lt, BinOpKind::Eq) => lint_double_comparison!(<=),
(BinOpKind::Or, BinOpKind::Eq, BinOpKind::Gt) | (BinOpKind::Or, BinOpKind::Gt, BinOpKind::Eq) => lint_double_comparison!(>=),
(BinOpKind::Or, BinOpKind::Lt, BinOpKind::Gt) | (BinOpKind::Or, BinOpKind::Gt, BinOpKind::Lt) => lint_double_comparison!(!=),
(BinOpKind::And, BinOpKind::Le, BinOpKind::Ge) | (BinOpKind::And, BinOpKind::Ge, BinOpKind::Le) => lint_double_comparison!(==),
2018-01-29 19:35:35 -06:00
_ => (),
};
}
}
impl<'a, 'tcx> LateLintPass<'a, 'tcx> for DoubleComparisonPass {
fn check_expr(&mut self, cx: &LateContext<'a, 'tcx>, expr: &'tcx Expr) {
2018-07-12 02:30:57 -05:00
if let ExprKind::Binary(ref kind, ref lhs, ref rhs) = expr.node {
2018-01-29 19:35:35 -06:00
self.check_binop(cx, kind.node, lhs, rhs, expr.span);
}
}
}