|
1 | | -use clippy_utils::diagnostics::span_lint_and_sugg; |
| 1 | +use clippy_utils::diagnostics::span_lint_and_then; |
| 2 | +use clippy_utils::source::snippet_opt; |
2 | 3 | use rustc_ast::LitKind; |
3 | 4 | use rustc_data_structures::fx::FxHashSet; |
4 | 5 | use rustc_errors::Applicability; |
5 | 6 | use rustc_hir::{Expr, ExprKind, PatKind, RangeEnd, UnOp}; |
6 | 7 | use rustc_lint::{LateContext, LateLintPass, LintContext}; |
7 | 8 | use rustc_middle::lint::in_external_macro; |
8 | 9 | use rustc_session::{declare_lint_pass, declare_tool_lint}; |
| 10 | +use rustc_span::{Span, DUMMY_SP}; |
9 | 11 |
|
10 | 12 | declare_clippy_lint! { |
11 | 13 | /// ### What it does |
@@ -49,78 +51,113 @@ fn expr_as_i128(expr: &Expr<'_>) -> Option<i128> { |
49 | 51 | } |
50 | 52 | } |
51 | 53 |
|
| 54 | +#[derive(Copy, Clone)] |
| 55 | +struct Num { |
| 56 | + val: i128, |
| 57 | + span: Span, |
| 58 | +} |
| 59 | + |
| 60 | +impl Num { |
| 61 | + fn new(expr: &Expr<'_>) -> Option<Self> { |
| 62 | + Some(Self { |
| 63 | + val: expr_as_i128(expr)?, |
| 64 | + span: expr.span, |
| 65 | + }) |
| 66 | + } |
| 67 | + |
| 68 | + fn dummy(val: i128) -> Self { |
| 69 | + Self { val, span: DUMMY_SP } |
| 70 | + } |
| 71 | + |
| 72 | + fn min(self, other: Self) -> Self { |
| 73 | + if self.val < other.val { self } else { other } |
| 74 | + } |
| 75 | +} |
| 76 | + |
52 | 77 | impl LateLintPass<'_> for ManualRangePatterns { |
53 | 78 | fn check_pat(&mut self, cx: &LateContext<'_>, pat: &'_ rustc_hir::Pat<'_>) { |
54 | 79 | if in_external_macro(cx.sess(), pat.span) { |
55 | 80 | return; |
56 | 81 | } |
57 | 82 |
|
58 | 83 | // a pattern like 1 | 2 seems fine, lint if there are at least 3 alternatives |
| 84 | + // or at least one range |
59 | 85 | if let PatKind::Or(pats) = pat.kind |
60 | | - && pats.len() >= 3 |
| 86 | + && (pats.len() >= 3 || pats.iter().any(|p| matches!(p.kind, PatKind::Range(..)))) |
61 | 87 | { |
62 | | - let mut min = i128::MAX; |
63 | | - let mut max = i128::MIN; |
| 88 | + let mut min = Num::dummy(i128::MAX); |
| 89 | + let mut max = Num::dummy(i128::MIN); |
| 90 | + let mut range_kind = RangeEnd::Included; |
64 | 91 | let mut numbers_found = FxHashSet::default(); |
65 | 92 | let mut ranges_found = Vec::new(); |
66 | 93 |
|
67 | 94 | for pat in pats { |
68 | 95 | if let PatKind::Lit(lit) = pat.kind |
69 | | - && let Some(num) = expr_as_i128(lit) |
| 96 | + && let Some(num) = Num::new(lit) |
70 | 97 | { |
71 | | - numbers_found.insert(num); |
| 98 | + numbers_found.insert(num.val); |
72 | 99 |
|
73 | 100 | min = min.min(num); |
74 | | - max = max.max(num); |
| 101 | + if num.val >= max.val { |
| 102 | + max = num; |
| 103 | + range_kind = RangeEnd::Included; |
| 104 | + } |
75 | 105 | } else if let PatKind::Range(Some(left), Some(right), end) = pat.kind |
76 | | - && let Some(left) = expr_as_i128(left) |
77 | | - && let Some(right) = expr_as_i128(right) |
78 | | - && right >= left |
| 106 | + && let Some(left) = Num::new(left) |
| 107 | + && let Some(mut right) = Num::new(right) |
79 | 108 | { |
| 109 | + if let RangeEnd::Excluded = end { |
| 110 | + right.val -= 1; |
| 111 | + } |
| 112 | + |
80 | 113 | min = min.min(left); |
81 | | - max = max.max(right); |
82 | | - ranges_found.push(left..=match end { |
83 | | - RangeEnd::Included => right, |
84 | | - RangeEnd::Excluded => right - 1, |
85 | | - }); |
| 114 | + if right.val > max.val { |
| 115 | + max = right; |
| 116 | + range_kind = end; |
| 117 | + } |
| 118 | + ranges_found.push(left.val..=right.val); |
86 | 119 | } else { |
87 | 120 | return; |
88 | 121 | } |
89 | 122 | } |
90 | 123 |
|
91 | | - let contains_whole_range = 'contains: { |
92 | | - let mut num = min; |
93 | | - while num <= max { |
94 | | - if numbers_found.contains(&num) { |
95 | | - num += 1; |
96 | | - } |
97 | | - // Given a list of (potentially overlapping) ranges like: |
98 | | - // 1..=5, 3..=7, 6..=10 |
99 | | - // We want to find the range with the highest end that still contains the current number |
100 | | - else if let Some(range) = ranges_found |
101 | | - .iter() |
102 | | - .filter(|range| range.contains(&num)) |
103 | | - .max_by_key(|range| range.end()) |
104 | | - { |
105 | | - num = range.end() + 1; |
106 | | - } else { |
107 | | - break 'contains false; |
108 | | - } |
| 124 | + let mut num = min.val; |
| 125 | + while num <= max.val { |
| 126 | + if numbers_found.contains(&num) { |
| 127 | + num += 1; |
| 128 | + } |
| 129 | + // Given a list of (potentially overlapping) ranges like: |
| 130 | + // 1..=5, 3..=7, 6..=10 |
| 131 | + // We want to find the range with the highest end that still contains the current number |
| 132 | + else if let Some(range) = ranges_found |
| 133 | + .iter() |
| 134 | + .filter(|range| range.contains(&num)) |
| 135 | + .max_by_key(|range| range.end()) |
| 136 | + { |
| 137 | + num = range.end() + 1; |
| 138 | + } else { |
| 139 | + return; |
109 | 140 | } |
110 | | - break 'contains true; |
111 | | - }; |
112 | | - |
113 | | - if contains_whole_range { |
114 | | - span_lint_and_sugg( |
115 | | - cx, |
116 | | - MANUAL_RANGE_PATTERNS, |
117 | | - pat.span, |
118 | | - "this OR pattern can be rewritten using a range", |
119 | | - "try", |
120 | | - format!("{min}..={max}"), |
121 | | - Applicability::MachineApplicable, |
122 | | - ); |
123 | 141 | } |
| 142 | + |
| 143 | + span_lint_and_then( |
| 144 | + cx, |
| 145 | + MANUAL_RANGE_PATTERNS, |
| 146 | + pat.span, |
| 147 | + "this OR pattern can be rewritten using a range", |
| 148 | + |diag| { |
| 149 | + if let Some(min) = snippet_opt(cx, min.span) |
| 150 | + && let Some(max) = snippet_opt(cx, max.span) |
| 151 | + { |
| 152 | + diag.span_suggestion( |
| 153 | + pat.span, |
| 154 | + "try", |
| 155 | + format!("{min}{range_kind}{max}"), |
| 156 | + Applicability::MachineApplicable, |
| 157 | + ); |
| 158 | + } |
| 159 | + }, |
| 160 | + ); |
124 | 161 | } |
125 | 162 | } |
126 | 163 | } |
0 commit comments