rust-clippy/clippy_lints/src/matches.rs

1237 lines
42 KiB
Rust
Raw Normal View History

2020-01-11 10:39:43 +00:00
use crate::consts::{constant, miri_to_const, Constant};
2018-05-30 08:15:50 +00:00
use crate::utils::paths;
use crate::utils::sugg::Sugg;
2020-01-10 16:14:17 +00:00
use crate::utils::usage::is_unused;
2018-11-27 20:14:15 +00:00
use crate::utils::{
2020-03-21 19:26:55 +00:00
expr_block, get_arg_name, get_parent_expr, in_macro, indent_of, is_allowed, is_expn_of, is_refutable, is_wild,
match_qpath, match_type, match_var, multispan_sugg, remove_blocks, snippet, snippet_block,
snippet_with_applicability, span_lint_and_help, span_lint_and_note, span_lint_and_sugg, span_lint_and_then,
walk_ptrs_ty,
2018-11-27 20:14:15 +00:00
};
use if_chain::if_chain;
2020-03-01 03:23:33 +00:00
use rustc_ast::ast::LitKind;
use rustc_errors::Applicability;
2020-01-06 16:39:50 +00:00
use rustc_hir::def::CtorKind;
2020-02-21 08:39:38 +00:00
use rustc_hir::{
Arm, BindingAnnotation, Block, BorrowKind, Expr, ExprKind, Local, MatchSource, Mutability, Node, Pat, PatKind,
QPath, RangeEnd,
2020-02-21 08:39:38 +00:00
};
2020-01-12 06:08:41 +00:00
use rustc_lint::{LateContext, LateLintPass, LintContext};
use rustc_middle::lint::in_external_macro;
use rustc_middle::ty::{self, Ty};
use rustc_session::{declare_tool_lint, impl_lint_pass};
use rustc_span::source_map::Span;
2018-11-27 20:14:15 +00:00
use std::cmp::Ordering;
use std::collections::Bound;
2018-03-28 13:24:26 +00:00
declare_clippy_lint! {
/// **What it does:** Checks for matches with a single arm where an `if let`
/// will usually suffice.
///
/// **Why is this bad?** Just readability `if let` nests less than a `match`.
///
/// **Known problems:** None.
///
/// **Example:**
/// ```rust
/// # fn bar(stool: &str) {}
/// # let x = Some("abc");
/// match x {
/// Some(ref foo) => bar(foo),
/// _ => (),
/// }
/// ```
2018-11-27 20:49:09 +00:00
pub SINGLE_MATCH,
style,
2020-01-06 06:30:43 +00:00
"a `match` statement with a single nontrivial arm (i.e., where the other arm is `_ => {}`) instead of `if let`"
}
2015-12-23 00:14:10 +00:00
2018-03-28 13:24:26 +00:00
declare_clippy_lint! {
/// **What it does:** Checks for matches with two arms where an `if let else` will
/// usually suffice.
///
/// **Why is this bad?** Just readability `if let` nests less than a `match`.
///
/// **Known problems:** Personal style preferences may differ.
///
/// **Example:**
///
/// Using `match`:
///
/// ```rust
/// # fn bar(foo: &usize) {}
/// # let other_ref: usize = 1;
/// # let x: Option<&usize> = Some(&1);
/// match x {
/// Some(ref foo) => bar(foo),
/// _ => bar(&other_ref),
/// }
/// ```
///
/// Using `if let` with `else`:
///
/// ```rust
/// # fn bar(foo: &usize) {}
/// # let other_ref: usize = 1;
/// # let x: Option<&usize> = Some(&1);
/// if let Some(ref foo) = x {
/// bar(foo);
/// } else {
/// bar(&other_ref);
/// }
/// ```
2018-11-27 20:49:09 +00:00
pub SINGLE_MATCH_ELSE,
pedantic,
2020-01-06 06:30:43 +00:00
"a `match` statement with two arms where the second arm's pattern is a placeholder instead of a specific match pattern"
}
2018-03-28 13:24:26 +00:00
declare_clippy_lint! {
/// **What it does:** Checks for matches where all arms match a reference,
/// suggesting to remove the reference and deref the matched expression
/// instead. It also checks for `if let &foo = bar` blocks.
///
/// **Why is this bad?** It just makes the code less readable. That reference
/// destructuring adds nothing to the code.
///
/// **Known problems:** None.
///
/// **Example:**
/// ```rust,ignore
/// match x {
/// &A(ref y) => foo(y),
/// &B => bar(),
/// _ => frob(&x),
/// }
/// ```
pub MATCH_REF_PATS,
2018-03-28 13:24:26 +00:00
style,
2020-01-06 06:30:43 +00:00
"a `match` or `if let` with all arms prefixed with `&` instead of deref-ing the match expression"
}
2015-12-23 00:14:10 +00:00
2018-03-28 13:24:26 +00:00
declare_clippy_lint! {
/// **What it does:** Checks for matches where match expression is a `bool`. It
/// suggests to replace the expression with an `if...else` block.
///
/// **Why is this bad?** It makes the code less readable.
///
/// **Known problems:** None.
///
/// **Example:**
/// ```rust
/// # fn foo() {}
/// # fn bar() {}
/// let condition: bool = true;
/// match condition {
/// true => foo(),
/// false => bar(),
/// }
/// ```
/// Use if/else instead:
/// ```rust
/// # fn foo() {}
/// # fn bar() {}
/// let condition: bool = true;
/// if condition {
/// foo();
/// } else {
/// bar();
/// }
/// ```
pub MATCH_BOOL,
2018-03-28 13:24:26 +00:00
style,
2020-01-06 06:30:43 +00:00
"a `match` on a boolean expression instead of an `if..else` block"
}
2018-03-28 13:24:26 +00:00
declare_clippy_lint! {
/// **What it does:** Checks for overlapping match arms.
///
/// **Why is this bad?** It is likely to be an error and if not, makes the code
/// less obvious.
///
/// **Known problems:** None.
///
/// **Example:**
/// ```rust
/// let x = 5;
/// match x {
/// 1...10 => println!("1 ... 10"),
/// 5...15 => println!("5 ... 15"),
/// _ => (),
/// }
/// ```
pub MATCH_OVERLAPPING_ARM,
2018-03-28 13:24:26 +00:00
style,
2020-01-06 06:30:43 +00:00
"a `match` with overlapping arms"
}
2015-12-23 00:14:10 +00:00
2018-03-28 13:24:26 +00:00
declare_clippy_lint! {
/// **What it does:** Checks for arm which matches all errors with `Err(_)`
/// and take drastic actions like `panic!`.
///
/// **Why is this bad?** It is generally a bad practice, just like
/// catching all exceptions in java with `catch(Exception)`
///
/// **Known problems:** None.
///
/// **Example:**
/// ```rust
2019-03-05 22:23:50 +00:00
/// let x: Result<i32, &str> = Ok(3);
/// match x {
/// Ok(_) => println!("ok"),
/// Err(_) => panic!("err"),
/// }
/// ```
2017-02-11 06:57:50 +00:00
pub MATCH_WILD_ERR_ARM,
2018-03-28 13:24:26 +00:00
style,
2020-01-06 06:30:43 +00:00
"a `match` with `Err(_)` arm and take drastic actions"
2017-02-11 06:57:50 +00:00
}
2018-03-28 13:24:26 +00:00
declare_clippy_lint! {
/// **What it does:** Checks for match which is used to add a reference to an
/// `Option` value.
///
/// **Why is this bad?** Using `as_ref()` or `as_mut()` instead is shorter.
///
/// **Known problems:** None.
///
/// **Example:**
/// ```rust
/// let x: Option<()> = None;
/// let r: Option<&()> = match x {
/// None => None,
/// Some(ref v) => Some(v),
/// };
/// ```
2017-12-19 22:22:16 +00:00
pub MATCH_AS_REF,
2018-03-28 13:24:26 +00:00
complexity,
2020-01-06 06:30:43 +00:00
"a `match` on an Option value instead of using `as_ref()` or `as_mut`"
2017-12-19 22:22:16 +00:00
}
declare_clippy_lint! {
/// **What it does:** Checks for wildcard enum matches using `_`.
///
/// **Why is this bad?** New enum variants added by library updates can be missed.
///
/// **Known problems:** Suggested replacements may be incorrect if guards exhaustively cover some
/// variants, and also may not use correct path to enum if it's not present in the current scope.
///
/// **Example:**
/// ```rust
/// # enum Foo { A(usize), B(usize) }
/// # let x = Foo::B(1);
/// match x {
/// A => {},
/// _ => {},
/// }
/// ```
pub WILDCARD_ENUM_MATCH_ARM,
restriction,
"a wildcard enum match arm using `_`"
}
declare_clippy_lint! {
/// **What it does:** Checks for wildcard pattern used with others patterns in same match arm.
///
/// **Why is this bad?** Wildcard pattern already covers any other pattern as it will match anyway.
/// It makes the code less readable, especially to spot wildcard pattern use in match arm.
///
/// **Known problems:** None.
///
/// **Example:**
/// ```rust
/// match "foo" {
/// "a" => {},
/// "bar" | _ => {},
/// }
/// ```
pub WILDCARD_IN_OR_PATTERNS,
2019-12-27 01:03:16 +00:00
complexity,
"a wildcard pattern used with others patterns in same match arm"
}
declare_clippy_lint! {
/// **What it does:** Checks for matches being used to destructure a single-variant enum
/// or tuple struct where a `let` will suffice.
///
/// **Why is this bad?** Just readability `let` doesn't nest, whereas a `match` does.
///
/// **Known problems:** None.
///
/// **Example:**
/// ```rust
/// enum Wrapper {
/// Data(i32),
/// }
///
/// let wrapper = Wrapper::Data(42);
///
/// let data = match wrapper {
/// Wrapper::Data(i) => i,
/// };
/// ```
///
/// The correct use would be:
/// ```rust
/// enum Wrapper {
/// Data(i32),
/// }
///
/// let wrapper = Wrapper::Data(42);
/// let Wrapper::Data(data) = wrapper;
/// ```
pub INFALLIBLE_DESTRUCTURING_MATCH,
style,
"a `match` statement with a single infallible arm instead of a `let`"
}
declare_clippy_lint! {
/// **What it does:** Checks for useless match that binds to only one value.
///
/// **Why is this bad?** Readability and needless complexity.
///
/// **Known problems:** Suggested replacements may be incorrect when `match`
/// is actually binding temporary value, bringing a 'dropped while borrowed' error.
///
/// **Example:**
/// ```rust
/// # let a = 1;
/// # let b = 2;
///
/// // Bad
/// match (a, b) {
/// (c, d) => {
/// // useless match
/// }
/// }
///
/// // Good
/// let (c, d) = (a, b);
/// ```
pub MATCH_SINGLE_BINDING,
complexity,
"a match with a single binding instead of using `let` statement"
}
declare_clippy_lint! {
/// **What it does:** Checks for unnecessary '..' pattern binding on struct when all fields are explicitly matched.
///
/// **Why is this bad?** Correctness and readability. It's like having a wildcard pattern after
/// matching all enum variants explicitly.
///
/// **Known problems:** None.
///
/// **Example:**
/// ```rust
/// # struct A { a: i32 }
/// let a = A { a: 5 };
///
/// // Bad
/// match a {
/// A { a: 5, .. } => {},
/// _ => {},
/// }
///
/// // Good
/// match a {
/// A { a: 5 } => {},
/// _ => {},
/// }
/// ```
pub REST_PAT_IN_FULLY_BOUND_STRUCTS,
restriction,
"a match on a struct that binds all fields but still uses the wildcard pattern"
}
#[derive(Default)]
pub struct Matches {
infallible_destructuring_match_linted: bool,
}
impl_lint_pass!(Matches => [
2019-04-08 20:43:55 +00:00
SINGLE_MATCH,
MATCH_REF_PATS,
MATCH_BOOL,
SINGLE_MATCH_ELSE,
MATCH_OVERLAPPING_ARM,
MATCH_WILD_ERR_ARM,
MATCH_AS_REF,
WILDCARD_ENUM_MATCH_ARM,
WILDCARD_IN_OR_PATTERNS,
MATCH_SINGLE_BINDING,
INFALLIBLE_DESTRUCTURING_MATCH,
REST_PAT_IN_FULLY_BOUND_STRUCTS
2019-04-08 20:43:55 +00:00
]);
2019-04-08 20:43:55 +00:00
impl<'a, 'tcx> LateLintPass<'a, 'tcx> for Matches {
2019-12-27 07:12:26 +00:00
fn check_expr(&mut self, cx: &LateContext<'a, 'tcx>, expr: &'tcx Expr<'_>) {
2018-07-24 06:55:38 +00:00
if in_external_macro(cx.sess(), expr.span) {
2016-01-04 04:26:12 +00:00
return;
}
2019-09-27 15:16:06 +00:00
if let ExprKind::Match(ref ex, ref arms, MatchSource::Normal) = expr.kind {
check_single_match(cx, ex, arms, expr);
check_match_bool(cx, ex, arms, expr);
check_overlapping_arms(cx, ex, arms);
2017-02-11 06:57:50 +00:00
check_wild_err_arm(cx, ex, arms);
check_wild_enum_match(cx, ex, arms);
2017-12-19 22:22:16 +00:00
check_match_as_ref(cx, ex, arms, expr);
2020-01-07 17:13:31 +00:00
check_wild_in_or_pats(cx, arms);
if self.infallible_destructuring_match_linted {
self.infallible_destructuring_match_linted = false;
} else {
check_match_single_binding(cx, ex, arms, expr);
}
}
2019-09-27 15:16:06 +00:00
if let ExprKind::Match(ref ex, ref arms, _) = expr.kind {
2018-02-04 12:41:54 +00:00
check_match_ref_pats(cx, ex, arms, expr);
}
}
fn check_local(&mut self, cx: &LateContext<'a, 'tcx>, local: &'tcx Local<'_>) {
if_chain! {
if let Some(ref expr) = local.init;
if let ExprKind::Match(ref target, ref arms, MatchSource::Normal) = expr.kind;
if arms.len() == 1 && arms[0].guard.is_none();
if let PatKind::TupleStruct(
QPath::Resolved(None, ref variant_name), ref args, _) = arms[0].pat.kind;
if args.len() == 1;
if let Some(arg) = get_arg_name(&args[0]);
let body = remove_blocks(&arms[0].body);
if match_var(body, arg);
then {
let mut applicability = Applicability::MachineApplicable;
self.infallible_destructuring_match_linted = true;
span_lint_and_sugg(
cx,
INFALLIBLE_DESTRUCTURING_MATCH,
local.span,
"you seem to be trying to use `match` to destructure a single infallible pattern. \
Consider using `let`",
"try this",
format!(
"let {}({}) = {};",
snippet_with_applicability(cx, variant_name.span, "..", &mut applicability),
snippet_with_applicability(cx, local.pat.span, "..", &mut applicability),
snippet_with_applicability(cx, target.span, "..", &mut applicability),
),
applicability,
);
}
}
}
fn check_pat(&mut self, cx: &LateContext<'a, 'tcx>, pat: &'tcx Pat<'_>) {
if_chain! {
if let PatKind::Struct(ref qpath, fields, true) = pat.kind;
if let QPath::Resolved(_, ref path) = qpath;
if let Some(def_id) = path.res.opt_def_id();
let ty = cx.tcx.type_of(def_id);
if let ty::Adt(def, _) = ty.kind;
if def.is_struct() || def.is_union();
if fields.len() == def.non_enum_variant().fields.len();
then {
span_lint_and_help(
cx,
REST_PAT_IN_FULLY_BOUND_STRUCTS,
pat.span,
"unnecessary use of `..` pattern in struct binding. All fields were already bound",
"consider removing `..` from this binding",
);
}
}
}
}
2018-05-30 16:24:44 +00:00
#[rustfmt::skip]
2019-12-27 07:12:26 +00:00
fn check_single_match(cx: &LateContext<'_, '_>, ex: &Expr<'_>, arms: &[Arm<'_>], expr: &Expr<'_>) {
2019-09-25 19:00:17 +00:00
if arms.len() == 2 && arms[0].guard.is_none() && arms[1].guard.is_none() {
2020-03-31 10:20:15 +00:00
if in_macro(expr.span) {
// Don't lint match expressions present in
// macro_rules! block
return;
}
2019-09-27 15:16:06 +00:00
if let PatKind::Or(..) = arms[0].pat.kind {
2019-09-25 20:34:55 +00:00
// don't lint for or patterns for now, this makes
// the lint noisy in unnecessary situations
return;
}
let els = remove_blocks(&arms[1].body);
let els = if is_unit_expr(els) {
2016-02-24 16:38:57 +00:00
None
2019-09-27 15:16:06 +00:00
} else if let ExprKind::Block(_, _) = els.kind {
2016-02-24 16:38:57 +00:00
// matches with blocks that contain statements are prettier as `if let + else`
Some(els)
2016-02-24 16:38:57 +00:00
} else {
// allow match arms with just expressions
return;
};
2017-01-13 16:04:56 +00:00
let ty = cx.tables.expr_ty(ex);
if ty.kind != ty::Bool || is_allowed(cx, MATCH_BOOL, ex.hir_id) {
2016-02-24 16:38:57 +00:00
check_single_match_single_pattern(cx, ex, arms, expr, els);
check_single_match_opt_like(cx, ex, arms, expr, ty, els);
}
2016-01-13 00:19:27 +00:00
}
}
2018-11-27 20:14:15 +00:00
fn check_single_match_single_pattern(
cx: &LateContext<'_, '_>,
2019-12-27 07:12:26 +00:00
ex: &Expr<'_>,
arms: &[Arm<'_>],
expr: &Expr<'_>,
els: Option<&Expr<'_>>,
2018-11-27 20:14:15 +00:00
) {
2019-09-25 19:00:17 +00:00
if is_wild(&arms[1].pat) {
report_single_match_single_pattern(cx, ex, arms, expr, els);
}
}
2018-11-27 20:14:15 +00:00
fn report_single_match_single_pattern(
cx: &LateContext<'_, '_>,
2019-12-27 07:12:26 +00:00
ex: &Expr<'_>,
arms: &[Arm<'_>],
expr: &Expr<'_>,
els: Option<&Expr<'_>>,
2018-11-27 20:14:15 +00:00
) {
let lint = if els.is_some() { SINGLE_MATCH_ELSE } else { SINGLE_MATCH };
let els_str = els.map_or(String::new(), |els| {
format!(" else {}", expr_block(cx, els, None, "..", Some(expr.span)))
2018-11-27 20:14:15 +00:00
});
2017-08-09 07:30:56 +00:00
span_lint_and_sugg(
cx,
lint,
expr.span,
"you seem to be trying to use match for destructuring a single pattern. Consider using `if \
2017-09-05 09:33:04 +00:00
let`",
2017-08-09 07:30:56 +00:00
"try this",
format!(
"if let {} = {} {}{}",
2019-09-25 19:00:17 +00:00
snippet(cx, arms[0].pat.span, ".."),
2017-08-09 07:30:56 +00:00
snippet(cx, ex.span, ".."),
expr_block(cx, &arms[0].body, None, "..", Some(expr.span)),
els_str,
2017-08-09 07:30:56 +00:00
),
Applicability::HasPlaceholders,
2017-08-09 07:30:56 +00:00
);
}
2018-11-27 20:14:15 +00:00
fn check_single_match_opt_like(
cx: &LateContext<'_, '_>,
2019-12-27 07:12:26 +00:00
ex: &Expr<'_>,
arms: &[Arm<'_>],
expr: &Expr<'_>,
2018-11-27 20:14:15 +00:00
ty: Ty<'_>,
2019-12-27 07:12:26 +00:00
els: Option<&Expr<'_>>,
2018-11-27 20:14:15 +00:00
) {
2019-03-10 17:19:47 +00:00
// list of candidate `Enum`s we know will never get any more members
2017-08-09 07:30:56 +00:00
let candidates = &[
2019-05-17 21:53:54 +00:00
(&paths::COW, "Borrowed"),
(&paths::COW, "Cow::Borrowed"),
(&paths::COW, "Cow::Owned"),
(&paths::COW, "Owned"),
(&paths::OPTION, "None"),
(&paths::RESULT, "Err"),
(&paths::RESULT, "Ok"),
2017-08-09 07:30:56 +00:00
];
2016-01-13 00:19:27 +00:00
2019-09-27 15:16:06 +00:00
let path = match arms[1].pat.kind {
PatKind::TupleStruct(ref path, ref inner, _) => {
2019-03-10 17:19:47 +00:00
// Contains any non wildcard patterns (e.g., `Err(err)`)?
if !inner.iter().all(is_wild) {
return;
}
rustc_hir_pretty::to_string(rustc_hir_pretty::NO_ANN, |s| s.print_qpath(path, false))
2016-12-20 17:21:30 +00:00
},
PatKind::Binding(BindingAnnotation::Unannotated, .., ident, None) => ident.to_string(),
PatKind::Path(ref path) => {
rustc_hir_pretty::to_string(rustc_hir_pretty::NO_ANN, |s| s.print_qpath(path, false))
},
2016-01-30 12:48:39 +00:00
_ => return,
2016-01-13 00:19:27 +00:00
};
for &(ty_path, pat_path) in candidates {
2017-03-09 09:58:31 +00:00
if path == *pat_path && match_type(cx, ty, ty_path) {
report_single_match_single_pattern(cx, ex, arms, expr, els);
2016-01-13 00:19:27 +00:00
}
}
}
2019-12-27 07:12:26 +00:00
fn check_match_bool(cx: &LateContext<'_, '_>, ex: &Expr<'_>, arms: &[Arm<'_>], expr: &Expr<'_>) {
2019-03-10 17:19:47 +00:00
// Type of expression is `bool`.
if cx.tables.expr_ty(ex).kind == ty::Bool {
2017-08-09 07:30:56 +00:00
span_lint_and_then(
cx,
MATCH_BOOL,
expr.span,
"you seem to be trying to match on a boolean expression",
move |db| {
2019-09-25 19:00:17 +00:00
if arms.len() == 2 {
2017-08-09 07:30:56 +00:00
// no guards
2019-09-27 15:16:06 +00:00
let exprs = if let PatKind::Lit(ref arm_bool) = arms[0].pat.kind {
if let ExprKind::Lit(ref lit) = arm_bool.kind {
2017-08-09 07:30:56 +00:00
match lit.node {
LitKind::Bool(true) => Some((&*arms[0].body, &*arms[1].body)),
LitKind::Bool(false) => Some((&*arms[1].body, &*arms[0].body)),
_ => None,
}
} else {
None
}
} else {
None
};
2017-08-09 07:30:56 +00:00
if let Some((true_expr, false_expr)) = exprs {
let sugg = match (is_unit_expr(true_expr), is_unit_expr(false_expr)) {
2017-09-05 09:33:04 +00:00
(false, false) => Some(format!(
"if {} {} else {}",
snippet(cx, ex.span, "b"),
expr_block(cx, true_expr, None, "..", Some(expr.span)),
expr_block(cx, false_expr, None, "..", Some(expr.span))
2017-09-05 09:33:04 +00:00
)),
(false, true) => Some(format!(
"if {} {}",
snippet(cx, ex.span, "b"),
expr_block(cx, true_expr, None, "..", Some(expr.span))
2017-09-05 09:33:04 +00:00
)),
2017-08-09 07:30:56 +00:00
(true, false) => {
let test = Sugg::hir(cx, ex, "..");
Some(format!(
"if {} {}",
!test,
expr_block(cx, false_expr, None, "..", Some(expr.span))
))
2017-08-09 07:30:56 +00:00
},
(true, true) => None,
};
if let Some(sugg) = sugg {
db.span_suggestion(
2018-09-18 15:07:54 +00:00
expr.span,
2020-01-06 06:30:43 +00:00
"consider using an `if`/`else` expression",
2018-09-18 15:07:54 +00:00
sugg,
Applicability::HasPlaceholders,
2018-09-18 15:07:54 +00:00
);
2017-08-09 07:30:56 +00:00
}
2016-04-14 18:14:03 +00:00
}
2015-10-21 06:24:56 +00:00
}
2017-08-09 07:30:56 +00:00
},
);
}
}
2015-12-23 00:14:10 +00:00
2019-12-27 07:12:26 +00:00
fn check_overlapping_arms<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, ex: &'tcx Expr<'_>, arms: &'tcx [Arm<'_>]) {
2017-01-13 16:04:56 +00:00
if arms.len() >= 2 && cx.tables.expr_ty(ex).is_integral() {
2020-01-11 10:39:43 +00:00
let ranges = all_ranges(cx, arms, cx.tables.expr_ty(ex));
2016-03-15 19:09:53 +00:00
let type_ranges = type_ranges(&ranges);
if !type_ranges.is_empty() {
if let Some((start, end)) = overlapping(&type_ranges) {
span_lint_and_note(
2017-08-09 07:30:56 +00:00
cx,
MATCH_OVERLAPPING_ARM,
start.span,
"some ranges overlap",
end.span,
"overlaps with this",
);
2016-03-15 19:09:53 +00:00
}
}
}
}
2019-12-27 07:12:26 +00:00
fn check_wild_err_arm(cx: &LateContext<'_, '_>, ex: &Expr<'_>, arms: &[Arm<'_>]) {
2017-02-11 06:57:50 +00:00
let ex_ty = walk_ptrs_ty(cx.tables.expr_ty(ex));
2019-05-17 21:53:54 +00:00
if match_type(cx, ex_ty, &paths::RESULT) {
2017-02-11 06:57:50 +00:00
for arm in arms {
2019-09-27 15:16:06 +00:00
if let PatKind::TupleStruct(ref path, ref inner, _) = arm.pat.kind {
let path_str = rustc_hir_pretty::to_string(rustc_hir_pretty::NO_ANN, |s| s.print_qpath(path, false));
2020-01-10 09:56:09 +00:00
if path_str == "Err" {
let mut matching_wild = inner.iter().any(is_wild);
let mut ident_bind_name = String::from("_");
if !matching_wild {
// Looking for unused bindings (i.e.: `_e`)
inner.iter().for_each(|pat| {
if let PatKind::Binding(.., ident, None) = &pat.kind {
if ident.as_str().starts_with('_') && is_unused(ident, arm.body) {
ident_bind_name = (&ident.name.as_str()).to_string();
matching_wild = true;
}
}
});
}
if_chain! {
if matching_wild;
if let ExprKind::Block(ref block, _) = arm.body.kind;
if is_panic_block(block);
then {
// `Err(_)` or `Err(_e)` arm with `panic!` found
span_lint_and_note(cx,
2020-01-10 14:09:37 +00:00
MATCH_WILD_ERR_ARM,
arm.pat.span,
2020-01-10 14:12:21 +00:00
&format!("`Err({})` matches all errors", &ident_bind_name),
2020-01-10 14:09:37 +00:00
arm.pat.span,
2020-01-10 14:12:21 +00:00
"match each error separately or use the error output",
2020-01-10 14:09:37 +00:00
);
2020-01-10 09:56:09 +00:00
}
}
}
2017-02-11 06:57:50 +00:00
}
}
}
}
2019-12-27 07:12:26 +00:00
fn check_wild_enum_match(cx: &LateContext<'_, '_>, ex: &Expr<'_>, arms: &[Arm<'_>]) {
let ty = cx.tables.expr_ty(ex);
if !ty.is_enum() {
// If there isn't a nice closed set of possible values that can be conveniently enumerated,
// don't complain about not enumerating the mall.
return;
}
// First pass - check for violation, but don't do much book-keeping because this is hopefully
// the uncommon case, and the book-keeping is slightly expensive.
let mut wildcard_span = None;
let mut wildcard_ident = None;
for arm in arms {
2019-09-27 15:16:06 +00:00
if let PatKind::Wild = arm.pat.kind {
2019-09-25 19:00:17 +00:00
wildcard_span = Some(arm.pat.span);
2019-09-27 15:16:06 +00:00
} else if let PatKind::Binding(_, _, ident, None) = arm.pat.kind {
2019-09-25 19:00:17 +00:00
wildcard_span = Some(arm.pat.span);
wildcard_ident = Some(ident);
}
}
if let Some(wildcard_span) = wildcard_span {
// Accumulate the variants which should be put in place of the wildcard because they're not
// already covered.
let mut missing_variants = vec![];
if let ty::Adt(def, _) = ty.kind {
for variant in &def.variants {
missing_variants.push(variant);
}
}
for arm in arms {
if arm.guard.is_some() {
// Guards mean that this case probably isn't exhaustively covered. Technically
// this is incorrect, as we should really check whether each variant is exhaustively
// covered by the set of guards that cover it, but that's really hard to do.
continue;
}
2019-09-27 15:16:06 +00:00
if let PatKind::Path(ref path) = arm.pat.kind {
2019-09-25 19:00:17 +00:00
if let QPath::Resolved(_, p) = path {
missing_variants.retain(|e| e.ctor_def_id != Some(p.res.def_id()));
}
2019-09-27 15:16:06 +00:00
} else if let PatKind::TupleStruct(ref path, ..) = arm.pat.kind {
2019-09-25 19:00:17 +00:00
if let QPath::Resolved(_, p) = path {
missing_variants.retain(|e| e.ctor_def_id != Some(p.res.def_id()));
}
}
}
let mut suggestion: Vec<String> = missing_variants
.iter()
.map(|v| {
let suffix = match v.ctor_kind {
CtorKind::Fn => "(..)",
CtorKind::Const | CtorKind::Fictive => "",
};
let ident_str = if let Some(ident) = wildcard_ident {
format!("{} @ ", ident.name)
} else {
String::new()
};
// This path assumes that the enum type is imported into scope.
2019-03-26 09:55:03 +00:00
format!("{}{}{}", ident_str, cx.tcx.def_path_str(v.def_id), suffix)
})
.collect();
2019-02-18 22:55:16 +00:00
if suggestion.is_empty() {
return;
}
2019-12-22 11:51:39 +00:00
let mut message = "wildcard match will miss any future added variants";
if let ty::Adt(def, _) = ty.kind {
if def.is_variant_list_non_exhaustive() {
2019-12-22 11:51:39 +00:00
message = "match on non-exhaustive enum doesn't explicitly match all known variants";
suggestion.push(String::from("_"));
}
}
span_lint_and_sugg(
cx,
WILDCARD_ENUM_MATCH_ARM,
wildcard_span,
message,
"try this",
suggestion.join(" | "),
Applicability::MachineApplicable,
)
}
}
2017-02-11 13:42:42 +00:00
// If the block contains only a `panic!` macro (as expression or statement)
2019-12-27 07:12:26 +00:00
fn is_panic_block(block: &Block<'_>) -> bool {
2017-02-11 06:57:50 +00:00
match (&block.expr, block.stmts.len(), block.stmts.first()) {
2017-02-11 13:47:26 +00:00
(&Some(ref exp), 0, _) => {
2019-05-17 21:53:54 +00:00
is_expn_of(exp.span, "panic").is_some() && is_expn_of(exp.span, "unreachable").is_none()
2017-02-11 13:47:26 +00:00
},
2017-02-12 01:16:37 +00:00
(&None, 1, Some(stmt)) => {
2019-05-17 21:53:54 +00:00
is_expn_of(stmt.span, "panic").is_some() && is_expn_of(stmt.span, "unreachable").is_none()
2017-02-11 13:47:26 +00:00
},
_ => false,
2017-02-11 06:57:50 +00:00
}
}
2019-12-27 07:12:26 +00:00
fn check_match_ref_pats(cx: &LateContext<'_, '_>, ex: &Expr<'_>, arms: &[Arm<'_>], expr: &Expr<'_>) {
if has_only_ref_pats(arms) {
2020-02-18 11:50:10 +00:00
let mut suggs = Vec::with_capacity(arms.len() + 1);
let (title, msg) = if let ExprKind::AddrOf(BorrowKind::Ref, Mutability::Not, ref inner) = ex.kind {
2019-02-16 18:35:15 +00:00
let span = ex.span.source_callsite();
suggs.push((span, Sugg::hir_with_macro_callsite(cx, inner, "..").to_string()));
2018-02-04 12:41:54 +00:00
(
2017-09-05 09:33:04 +00:00
"you don't need to add `&` to both the expression and the patterns",
2018-02-04 12:41:54 +00:00
"try",
)
} else {
2019-02-16 18:35:15 +00:00
let span = ex.span.source_callsite();
suggs.push((span, Sugg::hir_with_macro_callsite(cx, ex, "..").deref().to_string()));
2018-02-04 12:41:54 +00:00
(
2017-08-09 07:30:56 +00:00
"you don't need to add `&` to all patterns",
2018-02-04 12:41:54 +00:00
"instead of prefixing all patterns with `&`, you can dereference the expression",
)
};
2019-09-25 19:00:17 +00:00
suggs.extend(arms.iter().filter_map(|a| {
2019-09-27 15:16:06 +00:00
if let PatKind::Ref(ref refp, _) = a.pat.kind {
2019-09-25 19:00:17 +00:00
Some((a.pat.span, snippet(cx, refp.span, "..").to_string()))
2018-02-04 12:41:54 +00:00
} else {
None
}
}));
span_lint_and_then(cx, MATCH_REF_PATS, expr.span, title, |db| {
2019-08-19 16:30:32 +00:00
if !expr.span.from_expansion() {
multispan_sugg(db, msg.to_owned(), suggs);
}
2018-02-04 12:41:54 +00:00
});
}
}
2019-12-27 07:12:26 +00:00
fn check_match_as_ref(cx: &LateContext<'_, '_>, ex: &Expr<'_>, arms: &[Arm<'_>], expr: &Expr<'_>) {
2019-09-25 19:00:17 +00:00
if arms.len() == 2 && arms[0].guard.is_none() && arms[1].guard.is_none() {
2017-12-20 09:39:48 +00:00
let arm_ref: Option<BindingAnnotation> = if is_none_arm(&arms[0]) {
is_ref_some_arm(&arms[1])
} else if is_none_arm(&arms[1]) {
is_ref_some_arm(&arms[0])
} else {
None
};
if let Some(rb) = arm_ref {
2018-11-27 20:14:15 +00:00
let suggestion = if rb == BindingAnnotation::Ref {
"as_ref"
} else {
"as_mut"
};
let output_ty = cx.tables.expr_ty(expr);
let input_ty = cx.tables.expr_ty(ex);
let cast = if_chain! {
if let ty::Adt(_, substs) = input_ty.kind;
let input_ty = substs.type_at(0);
if let ty::Adt(_, substs) = output_ty.kind;
let output_ty = substs.type_at(0);
if let ty::Ref(_, output_ty, _) = output_ty.kind;
if input_ty != output_ty;
then {
".map(|x| x as _)"
} else {
""
}
};
let mut applicability = Applicability::MachineApplicable;
2017-12-19 22:22:16 +00:00
span_lint_and_sugg(
cx,
MATCH_AS_REF,
expr.span,
2020-01-06 06:30:43 +00:00
&format!("use `{}()` instead", suggestion),
2017-12-19 22:22:16 +00:00
"try this",
2018-11-27 20:14:15 +00:00
format!(
"{}.{}(){}",
2018-11-27 20:14:15 +00:00
snippet_with_applicability(cx, ex.span, "_", &mut applicability),
suggestion,
cast,
2018-11-27 20:14:15 +00:00
),
applicability,
2017-12-19 22:22:16 +00:00
)
}
}
}
2020-01-07 17:13:31 +00:00
fn check_wild_in_or_pats(cx: &LateContext<'_, '_>, arms: &[Arm<'_>]) {
for arm in arms {
if let PatKind::Or(ref fields) = arm.pat.kind {
2020-01-02 19:00:27 +00:00
// look for multiple fields in this arm that contains at least one Wild pattern
if fields.len() > 1 && fields.iter().any(is_wild) {
span_lint_and_help(
cx,
WILDCARD_IN_OR_PATTERNS,
arm.pat.span,
2020-01-02 19:00:27 +00:00
"wildcard pattern covers any other pattern as it will match anyway.",
2020-01-07 17:13:31 +00:00
"Consider handling `_` separately.",
2020-01-02 19:00:27 +00:00
);
}
}
}
}
fn check_match_single_binding<'a>(cx: &LateContext<'_, 'a>, ex: &Expr<'a>, arms: &[Arm<'_>], expr: &Expr<'_>) {
2020-01-26 16:03:39 +00:00
if in_macro(expr.span) || arms.len() != 1 || is_refutable(cx, arms[0].pat) {
return;
}
2020-01-26 16:03:39 +00:00
let matched_vars = ex.span;
let bind_names = arms[0].pat.span;
let match_body = remove_blocks(&arms[0].body);
let mut snippet_body = if match_body.span.from_expansion() {
Sugg::hir_with_macro_callsite(cx, match_body, "..").to_string()
} else {
2020-02-05 08:55:48 +00:00
snippet_block(cx, match_body.span, "..", Some(expr.span)).to_string()
2020-01-26 16:03:39 +00:00
};
// Do we need to add ';' to suggestion ?
match match_body.kind {
ExprKind::Block(block, _) => {
// macro + expr_ty(body) == ()
if block.span.from_expansion() && cx.tables.expr_ty(&match_body).is_unit() {
snippet_body.push(';');
2020-01-26 16:03:39 +00:00
}
},
_ => {
// expr_ty(body) == ()
if cx.tables.expr_ty(&match_body).is_unit() {
snippet_body.push(';');
}
},
}
2020-01-26 16:03:39 +00:00
let mut applicability = Applicability::MaybeIncorrect;
2020-01-26 16:03:39 +00:00
match arms[0].pat.kind {
PatKind::Binding(..) | PatKind::Tuple(_, _) | PatKind::Struct(..) => {
// If this match is in a local (`let`) stmt
let (target_span, sugg) = if let Some(parent_let_node) = opt_parent_let(cx, ex) {
(
parent_let_node.span,
format!(
"let {} = {};\n{}let {} = {};",
snippet_with_applicability(cx, bind_names, "..", &mut applicability),
snippet_with_applicability(cx, matched_vars, "..", &mut applicability),
" ".repeat(indent_of(cx, expr.span).unwrap_or(0)),
snippet_with_applicability(cx, parent_let_node.pat.span, "..", &mut applicability),
snippet_body
),
)
} else {
2020-03-21 19:26:55 +00:00
// If we are in closure, we need curly braces around suggestion
let mut indent = " ".repeat(indent_of(cx, ex.span).unwrap_or(0));
let (mut cbrace_start, mut cbrace_end) = ("".to_string(), "".to_string());
if let Some(parent_expr) = get_parent_expr(cx, expr) {
if let ExprKind::Closure(..) = parent_expr.kind {
cbrace_end = format!("\n{}}}", indent);
// Fix body indent due to the closure
indent = " ".repeat(indent_of(cx, bind_names).unwrap_or(0));
cbrace_start = format!("{{\n{}", indent);
}
};
(
expr.span,
format!(
2020-03-21 19:26:55 +00:00
"{}let {} = {};\n{}{}{}",
cbrace_start,
snippet_with_applicability(cx, bind_names, "..", &mut applicability),
snippet_with_applicability(cx, matched_vars, "..", &mut applicability),
2020-03-21 19:26:55 +00:00
indent,
snippet_body,
cbrace_end
),
)
};
2020-01-26 16:03:39 +00:00
span_lint_and_sugg(
cx,
MATCH_SINGLE_BINDING,
target_span,
2020-01-26 16:03:39 +00:00
"this match could be written as a `let` statement",
"consider using `let` statement",
sugg,
applicability,
2020-01-26 16:03:39 +00:00
);
},
PatKind::Wild => {
span_lint_and_sugg(
cx,
MATCH_SINGLE_BINDING,
expr.span,
"this match could be replaced by its body itself",
"consider using the match body instead",
snippet_body,
Applicability::MachineApplicable,
);
},
_ => (),
}
}
/// Returns true if the `ex` match expression is in a local (`let`) statement
fn opt_parent_let<'a>(cx: &LateContext<'_, 'a>, ex: &Expr<'a>) -> Option<&'a Local<'a>> {
if_chain! {
let map = &cx.tcx.hir();
if let Some(Node::Expr(parent_arm_expr)) = map.find(map.get_parent_node(ex.hir_id));
if let Some(Node::Local(parent_let_expr)) = map.find(map.get_parent_node(parent_arm_expr.hir_id));
then {
return Some(parent_let_expr);
}
}
None
}
2019-01-31 01:15:29 +00:00
/// Gets all arms that are unbounded `PatRange`s.
2020-01-11 10:39:43 +00:00
fn all_ranges<'a, 'tcx>(
cx: &LateContext<'a, 'tcx>,
arms: &'tcx [Arm<'_>],
ty: Ty<'tcx>,
) -> Vec<SpannedRange<Constant>> {
2015-12-23 00:14:10 +00:00
arms.iter()
2016-06-21 11:51:44 +00:00
.flat_map(|arm| {
2017-08-09 07:30:56 +00:00
if let Arm {
2019-09-25 19:00:17 +00:00
ref pat, guard: None, ..
2017-08-09 07:30:56 +00:00
} = *arm
{
2020-01-11 10:39:43 +00:00
if let PatKind::Range(ref lhs, ref rhs, range_end) = pat.kind {
2020-01-11 14:21:09 +00:00
let lhs = match lhs {
Some(lhs) => constant(cx, cx.tables, lhs)?.0,
None => miri_to_const(ty.numeric_min_val(cx.tcx)?)?,
};
let rhs = match rhs {
Some(rhs) => constant(cx, cx.tables, rhs)?.0,
None => miri_to_const(ty.numeric_max_val(cx.tcx)?)?,
};
let rhs = match range_end {
RangeEnd::Included => Bound::Included(rhs),
RangeEnd::Excluded => Bound::Excluded(rhs),
};
return Some(SpannedRange {
span: pat.span,
node: (lhs, rhs),
});
}
2015-12-23 00:14:10 +00:00
2019-09-27 15:16:06 +00:00
if let PatKind::Lit(ref value) = pat.kind {
2018-05-13 11:16:31 +00:00
let value = constant(cx, cx.tables, value)?.0;
2018-11-27 20:14:15 +00:00
return Some(SpannedRange {
span: pat.span,
node: (value.clone(), Bound::Included(value)),
});
}
2019-09-25 19:00:17 +00:00
}
None
2015-12-23 00:14:10 +00:00
})
.collect()
}
#[derive(Debug, Eq, PartialEq)]
2015-12-23 16:48:30 +00:00
pub struct SpannedRange<T> {
pub span: Span,
pub node: (T, Bound<T>),
2015-12-23 00:14:10 +00:00
}
2018-03-13 10:38:11 +00:00
type TypedRanges = Vec<SpannedRange<u128>>;
2015-12-23 00:14:10 +00:00
2019-01-31 01:15:29 +00:00
/// Gets all `Int` ranges or all `Uint` ranges. Mixed types are an error anyway
2017-08-09 07:30:56 +00:00
/// and other types than
2015-12-23 00:14:10 +00:00
/// `Uint` and `Int` probably don't make sense.
2018-03-13 10:38:11 +00:00
fn type_ranges(ranges: &[SpannedRange<Constant>]) -> TypedRanges {
2017-08-09 07:30:56 +00:00
ranges
.iter()
.filter_map(|range| match range.node {
2018-11-27 20:14:15 +00:00
(Constant::Int(start), Bound::Included(Constant::Int(end))) => Some(SpannedRange {
2017-09-05 09:33:04 +00:00
span: range.span,
node: (start, Bound::Included(end)),
}),
2018-11-27 20:14:15 +00:00
(Constant::Int(start), Bound::Excluded(Constant::Int(end))) => Some(SpannedRange {
2017-09-05 09:33:04 +00:00
span: range.span,
node: (start, Bound::Excluded(end)),
}),
2018-11-27 20:14:15 +00:00
(Constant::Int(start), Bound::Unbounded) => Some(SpannedRange {
2017-09-05 09:33:04 +00:00
span: range.span,
node: (start, Bound::Unbounded),
}),
_ => None,
2016-12-20 17:21:30 +00:00
})
.collect()
2015-12-23 00:14:10 +00:00
}
2019-12-27 07:12:26 +00:00
fn is_unit_expr(expr: &Expr<'_>) -> bool {
2019-09-27 15:16:06 +00:00
match expr.kind {
2018-07-12 07:30:57 +00:00
ExprKind::Tup(ref v) if v.is_empty() => true,
ExprKind::Block(ref b, _) if b.stmts.is_empty() && b.expr.is_none() => true,
_ => false,
}
}
2017-12-19 22:22:16 +00:00
// Checks if arm has the form `None => None`
2019-12-27 07:12:26 +00:00
fn is_none_arm(arm: &Arm<'_>) -> bool {
2019-09-27 15:16:06 +00:00
match arm.pat.kind {
2019-05-17 21:53:54 +00:00
PatKind::Path(ref path) if match_qpath(path, &paths::OPTION_NONE) => true,
2017-12-19 22:22:16 +00:00
_ => false,
}
}
// Checks if arm has the form `Some(ref v) => Some(v)` (checks for `ref` and `ref mut`)
2019-12-27 07:12:26 +00:00
fn is_ref_some_arm(arm: &Arm<'_>) -> Option<BindingAnnotation> {
2017-12-19 22:22:16 +00:00
if_chain! {
2019-09-27 15:16:06 +00:00
if let PatKind::TupleStruct(ref path, ref pats, _) = arm.pat.kind;
2019-05-17 21:53:54 +00:00
if pats.len() == 1 && match_qpath(path, &paths::OPTION_SOME);
2019-09-27 15:16:06 +00:00
if let PatKind::Binding(rb, .., ident, _) = pats[0].kind;
2017-12-19 22:22:16 +00:00
if rb == BindingAnnotation::Ref || rb == BindingAnnotation::RefMut;
2019-09-27 15:16:06 +00:00
if let ExprKind::Call(ref e, ref args) = remove_blocks(&arm.body).kind;
if let ExprKind::Path(ref some_path) = e.kind;
2019-05-17 21:53:54 +00:00
if match_qpath(some_path, &paths::OPTION_SOME) && args.len() == 1;
2019-09-27 15:16:06 +00:00
if let ExprKind::Path(ref qpath) = args[0].kind;
2017-12-19 22:22:16 +00:00
if let &QPath::Resolved(_, ref path2) = qpath;
2018-06-28 13:46:58 +00:00
if path2.segments.len() == 1 && ident.name == path2.segments[0].ident.name;
2017-12-19 22:22:16 +00:00
then {
2017-12-20 09:39:48 +00:00
return Some(rb)
2017-12-19 22:22:16 +00:00
}
}
2017-12-20 09:39:48 +00:00
None
2017-12-19 22:22:16 +00:00
}
2019-12-27 07:12:26 +00:00
fn has_only_ref_pats(arms: &[Arm<'_>]) -> bool {
2018-11-27 20:14:15 +00:00
let mapped = arms
.iter()
2019-09-25 19:00:17 +00:00
.map(|a| {
2019-09-27 15:16:06 +00:00
match a.pat.kind {
2017-09-05 09:33:04 +00:00
PatKind::Ref(..) => Some(true), // &-patterns
2016-12-20 17:21:30 +00:00
PatKind::Wild => Some(false), // an "anything" wildcard is also fine
2017-09-05 09:33:04 +00:00
_ => None, // any other pattern is not fine
2016-12-20 17:21:30 +00:00
}
})
.collect::<Option<Vec<bool>>>();
// look for Some(v) where there's at least one true element
mapped.map_or(false, |v| v.iter().any(|el| *el))
}
2015-12-23 16:48:30 +00:00
pub fn overlapping<T>(ranges: &[SpannedRange<T>]) -> Option<(&SpannedRange<T>, &SpannedRange<T>)>
2017-08-09 07:30:56 +00:00
where
T: Copy + Ord,
2016-01-04 04:26:12 +00:00
{
2015-12-23 00:14:10 +00:00
#[derive(Copy, Clone, Debug, Eq, PartialEq)]
enum Kind<'a, T> {
2015-12-23 00:14:10 +00:00
Start(T, &'a SpannedRange<T>),
End(Bound<T>, &'a SpannedRange<T>),
2015-12-23 00:14:10 +00:00
}
impl<'a, T: Copy> Kind<'a, T> {
fn range(&self) -> &'a SpannedRange<T> {
match *self {
2017-09-05 09:33:04 +00:00
Kind::Start(_, r) | Kind::End(_, r) => r,
2015-12-23 00:14:10 +00:00
}
}
fn value(self) -> Bound<T> {
2015-12-23 00:14:10 +00:00
match self {
Kind::Start(t, _) => Bound::Included(t),
2016-04-14 18:14:03 +00:00
Kind::End(t, _) => t,
2015-12-23 00:14:10 +00:00
}
}
}
impl<'a, T: Copy + Ord> PartialOrd for Kind<'a, T> {
fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
Some(self.cmp(other))
}
}
impl<'a, T: Copy + Ord> Ord for Kind<'a, T> {
fn cmp(&self, other: &Self) -> Ordering {
match (self.value(), other.value()) {
2017-09-05 09:33:04 +00:00
(Bound::Included(a), Bound::Included(b)) | (Bound::Excluded(a), Bound::Excluded(b)) => a.cmp(&b),
2017-01-31 07:08:54 +00:00
// Range patterns cannot be unbounded (yet)
2017-09-05 09:33:04 +00:00
(Bound::Unbounded, _) | (_, Bound::Unbounded) => unimplemented!(),
(Bound::Included(a), Bound::Excluded(b)) => match a.cmp(&b) {
Ordering::Equal => Ordering::Greater,
other => other,
},
2017-09-05 09:33:04 +00:00
(Bound::Excluded(a), Bound::Included(b)) => match a.cmp(&b) {
Ordering::Equal => Ordering::Less,
other => other,
},
}
2015-12-23 00:14:10 +00:00
}
}
2016-01-04 04:26:12 +00:00
let mut values = Vec::with_capacity(2 * ranges.len());
2015-12-23 00:14:10 +00:00
for r in ranges {
2016-04-26 15:05:39 +00:00
values.push(Kind::Start(r.node.0, r));
values.push(Kind::End(r.node.1, r));
2015-12-23 00:14:10 +00:00
}
values.sort();
for (a, b) in values.iter().zip(values.iter().skip(1)) {
match (a, b) {
2018-11-27 20:14:15 +00:00
(&Kind::Start(_, ra), &Kind::End(_, rb)) => {
if ra.node != rb.node {
return Some((ra, rb));
}
2016-12-20 17:21:30 +00:00
},
(&Kind::End(a, _), &Kind::Start(b, _)) if a != Bound::Included(b) => (),
2016-04-26 15:05:39 +00:00
_ => return Some((a.range(), b.range())),
2015-12-23 00:14:10 +00:00
}
}
None
}
2020-04-03 19:31:47 +00:00
#[test]
fn test_overlapping() {
use rustc_span::source_map::DUMMY_SP;
let sp = |s, e| SpannedRange {
span: DUMMY_SP,
node: (s, e),
};
assert_eq!(None, overlapping::<u8>(&[]));
assert_eq!(None, overlapping(&[sp(1, Bound::Included(4))]));
assert_eq!(
None,
overlapping(&[sp(1, Bound::Included(4)), sp(5, Bound::Included(6))])
);
assert_eq!(
None,
overlapping(&[
sp(1, Bound::Included(4)),
sp(5, Bound::Included(6)),
sp(10, Bound::Included(11))
],)
);
assert_eq!(
Some((&sp(1, Bound::Included(4)), &sp(3, Bound::Included(6)))),
overlapping(&[sp(1, Bound::Included(4)), sp(3, Bound::Included(6))])
);
assert_eq!(
Some((&sp(5, Bound::Included(6)), &sp(6, Bound::Included(11)))),
overlapping(&[
sp(1, Bound::Included(4)),
sp(5, Bound::Included(6)),
sp(6, Bound::Included(11))
],)
);
}