]> git.lizzy.rs Git - rust.git/blob - src/tools/clippy/clippy_lints/src/unnecessary_sort_by.rs
Rollup merge of #92802 - compiler-errors:deduplicate-stack-trace, r=oli-obk
[rust.git] / src / tools / clippy / clippy_lints / src / unnecessary_sort_by.rs
1 use clippy_utils::diagnostics::span_lint_and_sugg;
2 use clippy_utils::sugg::Sugg;
3 use clippy_utils::ty::{implements_trait, is_type_diagnostic_item};
4 use if_chain::if_chain;
5 use rustc_errors::Applicability;
6 use rustc_hir::{Expr, ExprKind, Mutability, Param, Pat, PatKind, Path, PathSegment, QPath};
7 use rustc_lint::{LateContext, LateLintPass};
8 use rustc_middle::ty::{self, subst::GenericArgKind};
9 use rustc_session::{declare_lint_pass, declare_tool_lint};
10 use rustc_span::sym;
11 use rustc_span::symbol::Ident;
12 use std::iter;
13
14 declare_clippy_lint! {
15     /// ### What it does
16     /// Detects uses of `Vec::sort_by` passing in a closure
17     /// which compares the two arguments, either directly or indirectly.
18     ///
19     /// ### Why is this bad?
20     /// It is more clear to use `Vec::sort_by_key` (or `Vec::sort` if
21     /// possible) than to use `Vec::sort_by` and a more complicated
22     /// closure.
23     ///
24     /// ### Known problems
25     /// If the suggested `Vec::sort_by_key` uses Reverse and it isn't already
26     /// imported by a use statement, then it will need to be added manually.
27     ///
28     /// ### Example
29     /// ```rust
30     /// # struct A;
31     /// # impl A { fn foo(&self) {} }
32     /// # let mut vec: Vec<A> = Vec::new();
33     /// vec.sort_by(|a, b| a.foo().cmp(&b.foo()));
34     /// ```
35     /// Use instead:
36     /// ```rust
37     /// # struct A;
38     /// # impl A { fn foo(&self) {} }
39     /// # let mut vec: Vec<A> = Vec::new();
40     /// vec.sort_by_key(|a| a.foo());
41     /// ```
42     #[clippy::version = "1.46.0"]
43     pub UNNECESSARY_SORT_BY,
44     complexity,
45     "Use of `Vec::sort_by` when `Vec::sort_by_key` or `Vec::sort` would be clearer"
46 }
47
48 declare_lint_pass!(UnnecessarySortBy => [UNNECESSARY_SORT_BY]);
49
50 enum LintTrigger {
51     Sort(SortDetection),
52     SortByKey(SortByKeyDetection),
53 }
54
55 struct SortDetection {
56     vec_name: String,
57     unstable: bool,
58 }
59
60 struct SortByKeyDetection {
61     vec_name: String,
62     closure_arg: String,
63     closure_body: String,
64     reverse: bool,
65     unstable: bool,
66 }
67
68 /// Detect if the two expressions are mirrored (identical, except one
69 /// contains a and the other replaces it with b)
70 fn mirrored_exprs(
71     cx: &LateContext<'_>,
72     a_expr: &Expr<'_>,
73     a_ident: &Ident,
74     b_expr: &Expr<'_>,
75     b_ident: &Ident,
76 ) -> bool {
77     match (&a_expr.kind, &b_expr.kind) {
78         // Two boxes with mirrored contents
79         (ExprKind::Box(left_expr), ExprKind::Box(right_expr)) => {
80             mirrored_exprs(cx, left_expr, a_ident, right_expr, b_ident)
81         },
82         // Two arrays with mirrored contents
83         (ExprKind::Array(left_exprs), ExprKind::Array(right_exprs)) => {
84             iter::zip(*left_exprs, *right_exprs).all(|(left, right)| mirrored_exprs(cx, left, a_ident, right, b_ident))
85         },
86         // The two exprs are function calls.
87         // Check to see that the function itself and its arguments are mirrored
88         (ExprKind::Call(left_expr, left_args), ExprKind::Call(right_expr, right_args)) => {
89             mirrored_exprs(cx, left_expr, a_ident, right_expr, b_ident)
90                 && iter::zip(*left_args, *right_args)
91                     .all(|(left, right)| mirrored_exprs(cx, left, a_ident, right, b_ident))
92         },
93         // The two exprs are method calls.
94         // Check to see that the function is the same and the arguments are mirrored
95         // This is enough because the receiver of the method is listed in the arguments
96         (ExprKind::MethodCall(left_segment, left_args, _), ExprKind::MethodCall(right_segment, right_args, _)) => {
97             left_segment.ident == right_segment.ident
98                 && iter::zip(*left_args, *right_args)
99                     .all(|(left, right)| mirrored_exprs(cx, left, a_ident, right, b_ident))
100         },
101         // Two tuples with mirrored contents
102         (ExprKind::Tup(left_exprs), ExprKind::Tup(right_exprs)) => {
103             iter::zip(*left_exprs, *right_exprs).all(|(left, right)| mirrored_exprs(cx, left, a_ident, right, b_ident))
104         },
105         // Two binary ops, which are the same operation and which have mirrored arguments
106         (ExprKind::Binary(left_op, left_left, left_right), ExprKind::Binary(right_op, right_left, right_right)) => {
107             left_op.node == right_op.node
108                 && mirrored_exprs(cx, left_left, a_ident, right_left, b_ident)
109                 && mirrored_exprs(cx, left_right, a_ident, right_right, b_ident)
110         },
111         // Two unary ops, which are the same operation and which have the same argument
112         (ExprKind::Unary(left_op, left_expr), ExprKind::Unary(right_op, right_expr)) => {
113             left_op == right_op && mirrored_exprs(cx, left_expr, a_ident, right_expr, b_ident)
114         },
115         // The two exprs are literals of some kind
116         (ExprKind::Lit(left_lit), ExprKind::Lit(right_lit)) => left_lit.node == right_lit.node,
117         (ExprKind::Cast(left, _), ExprKind::Cast(right, _)) => mirrored_exprs(cx, left, a_ident, right, b_ident),
118         (ExprKind::DropTemps(left_block), ExprKind::DropTemps(right_block)) => {
119             mirrored_exprs(cx, left_block, a_ident, right_block, b_ident)
120         },
121         (ExprKind::Field(left_expr, left_ident), ExprKind::Field(right_expr, right_ident)) => {
122             left_ident.name == right_ident.name && mirrored_exprs(cx, left_expr, a_ident, right_expr, right_ident)
123         },
124         // Two paths: either one is a and the other is b, or they're identical to each other
125         (
126             ExprKind::Path(QPath::Resolved(
127                 _,
128                 Path {
129                     segments: left_segments,
130                     ..
131                 },
132             )),
133             ExprKind::Path(QPath::Resolved(
134                 _,
135                 Path {
136                     segments: right_segments,
137                     ..
138                 },
139             )),
140         ) => {
141             (iter::zip(*left_segments, *right_segments).all(|(left, right)| left.ident == right.ident)
142                 && left_segments
143                     .iter()
144                     .all(|seg| &seg.ident != a_ident && &seg.ident != b_ident))
145                 || (left_segments.len() == 1
146                     && &left_segments[0].ident == a_ident
147                     && right_segments.len() == 1
148                     && &right_segments[0].ident == b_ident)
149         },
150         // Matching expressions, but one or both is borrowed
151         (
152             ExprKind::AddrOf(left_kind, Mutability::Not, left_expr),
153             ExprKind::AddrOf(right_kind, Mutability::Not, right_expr),
154         ) => left_kind == right_kind && mirrored_exprs(cx, left_expr, a_ident, right_expr, b_ident),
155         (_, ExprKind::AddrOf(_, Mutability::Not, right_expr)) => {
156             mirrored_exprs(cx, a_expr, a_ident, right_expr, b_ident)
157         },
158         (ExprKind::AddrOf(_, Mutability::Not, left_expr), _) => mirrored_exprs(cx, left_expr, a_ident, b_expr, b_ident),
159         _ => false,
160     }
161 }
162
163 fn detect_lint(cx: &LateContext<'_>, expr: &Expr<'_>) -> Option<LintTrigger> {
164     if_chain! {
165         if let ExprKind::MethodCall(name_ident, args, _) = &expr.kind;
166         if let name = name_ident.ident.name.to_ident_string();
167         if name == "sort_by" || name == "sort_unstable_by";
168         if let [vec, Expr { kind: ExprKind::Closure(_, _, closure_body_id, _, _), .. }] = args;
169         if is_type_diagnostic_item(cx, cx.typeck_results().expr_ty(vec), sym::Vec);
170         if let closure_body = cx.tcx.hir().body(*closure_body_id);
171         if let &[
172             Param { pat: Pat { kind: PatKind::Binding(_, _, left_ident, _), .. }, ..},
173             Param { pat: Pat { kind: PatKind::Binding(_, _, right_ident, _), .. }, .. }
174         ] = &closure_body.params;
175         if let ExprKind::MethodCall(method_path, [ref left_expr, ref right_expr], _) = &closure_body.value.kind;
176         if method_path.ident.name == sym::cmp;
177         then {
178             let (closure_body, closure_arg, reverse) = if mirrored_exprs(
179                 cx,
180                 left_expr,
181                 left_ident,
182                 right_expr,
183                 right_ident
184             ) {
185                 (Sugg::hir(cx, left_expr, "..").to_string(), left_ident.name.to_string(), false)
186             } else if mirrored_exprs(cx, left_expr, right_ident, right_expr, left_ident) {
187                 (Sugg::hir(cx, left_expr, "..").to_string(), right_ident.name.to_string(), true)
188             } else {
189                 return None;
190             };
191             let vec_name = Sugg::hir(cx, &args[0], "..").to_string();
192             let unstable = name == "sort_unstable_by";
193
194             if_chain! {
195             if let ExprKind::Path(QPath::Resolved(_, Path {
196                 segments: [PathSegment { ident: left_name, .. }], ..
197             })) = &left_expr.kind;
198             if left_name == left_ident;
199             if cx.tcx.get_diagnostic_item(sym::Ord).map_or(false, |id| {
200                 implements_trait(cx, cx.typeck_results().expr_ty(left_expr), id, &[])
201             });
202                 then {
203                     return Some(LintTrigger::Sort(SortDetection { vec_name, unstable }));
204                 }
205             }
206
207             if !expr_borrows(cx, left_expr) {
208                 return Some(LintTrigger::SortByKey(SortByKeyDetection {
209                     vec_name,
210                     closure_arg,
211                     closure_body,
212                     reverse,
213                     unstable,
214                 }));
215             }
216         }
217     }
218
219     None
220 }
221
222 fn expr_borrows(cx: &LateContext<'_>, expr: &Expr<'_>) -> bool {
223     let ty = cx.typeck_results().expr_ty(expr);
224     matches!(ty.kind(), ty::Ref(..)) || ty.walk().any(|arg| matches!(arg.unpack(), GenericArgKind::Lifetime(_)))
225 }
226
227 impl LateLintPass<'_> for UnnecessarySortBy {
228     fn check_expr(&mut self, cx: &LateContext<'_>, expr: &Expr<'_>) {
229         match detect_lint(cx, expr) {
230             Some(LintTrigger::SortByKey(trigger)) => span_lint_and_sugg(
231                 cx,
232                 UNNECESSARY_SORT_BY,
233                 expr.span,
234                 "use Vec::sort_by_key here instead",
235                 "try",
236                 format!(
237                     "{}.sort{}_by_key(|{}| {})",
238                     trigger.vec_name,
239                     if trigger.unstable { "_unstable" } else { "" },
240                     trigger.closure_arg,
241                     if trigger.reverse {
242                         format!("Reverse({})", trigger.closure_body)
243                     } else {
244                         trigger.closure_body.to_string()
245                     },
246                 ),
247                 if trigger.reverse {
248                     Applicability::MaybeIncorrect
249                 } else {
250                     Applicability::MachineApplicable
251                 },
252             ),
253             Some(LintTrigger::Sort(trigger)) => span_lint_and_sugg(
254                 cx,
255                 UNNECESSARY_SORT_BY,
256                 expr.span,
257                 "use Vec::sort here instead",
258                 "try",
259                 format!(
260                     "{}.sort{}()",
261                     trigger.vec_name,
262                     if trigger.unstable { "_unstable" } else { "" },
263                 ),
264                 Applicability::MachineApplicable,
265             ),
266             None => {},
267         }
268     }
269 }