1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
|
use itertools::Itertools;
use rustc_hash::FxHashMap;
use hir::{PathResolution, Semantics};
use ide_db::RootDatabase;
use syntax::{
ast::{self, NameOwner},
ted, AstNode,
};
use crate::{AssistContext, AssistId, AssistKind, Assists};
// Assist: reorder_impl
//
// Reorder the methods of an `impl Trait`. The methods will be ordered
// in the same order as in the trait definition.
//
// ```
// trait Foo {
// fn a() {}
// fn b() {}
// fn c() {}
// }
//
// struct Bar;
// $0impl Foo for Bar {
// fn b() {}
// fn c() {}
// fn a() {}
// }
// ```
// ->
// ```
// trait Foo {
// fn a() {}
// fn b() {}
// fn c() {}
// }
//
// struct Bar;
// impl Foo for Bar {
// fn a() {}
// fn b() {}
// fn c() {}
// }
// ```
//
pub(crate) fn reorder_impl(acc: &mut Assists, ctx: &AssistContext) -> Option<()> {
let impl_ast = ctx.find_node_at_offset::<ast::Impl>()?;
let items = impl_ast.assoc_item_list()?;
let methods = get_methods(&items);
let path = impl_ast
.trait_()
.and_then(|t| match t {
ast::Type::PathType(path) => Some(path),
_ => None,
})?
.path()?;
let ranks = compute_method_ranks(&path, ctx)?;
let sorted: Vec<_> = methods
.iter()
.cloned()
.sorted_by_key(|f| {
f.name().and_then(|n| ranks.get(&n.to_string()).copied()).unwrap_or(usize::max_value())
})
.collect();
// Don't edit already sorted methods:
if methods == sorted {
cov_mark::hit!(not_applicable_if_sorted);
return None;
}
let target = items.syntax().text_range();
acc.add(
AssistId("reorder_impl", AssistKind::RefactorRewrite),
"Sort methods",
target,
|builder| {
methods.into_iter().zip(sorted).for_each(|(old, new)| {
ted::replace(builder.make_ast_mut(old).syntax(), new.clone_for_update().syntax())
});
},
)
}
fn compute_method_ranks(path: &ast::Path, ctx: &AssistContext) -> Option<FxHashMap<String, usize>> {
let td = trait_definition(path, &ctx.sema)?;
Some(
td.items(ctx.db())
.iter()
.flat_map(|i| match i {
hir::AssocItem::Function(f) => Some(f),
_ => None,
})
.enumerate()
.map(|(idx, func)| (func.name(ctx.db()).to_string(), idx))
.collect(),
)
}
fn trait_definition(path: &ast::Path, sema: &Semantics<RootDatabase>) -> Option<hir::Trait> {
match sema.resolve_path(path)? {
PathResolution::Def(hir::ModuleDef::Trait(trait_)) => Some(trait_),
_ => None,
}
}
fn get_methods(items: &ast::AssocItemList) -> Vec<ast::Fn> {
items
.assoc_items()
.flat_map(|i| match i {
ast::AssocItem::Fn(f) => Some(f),
_ => None,
})
.filter(|f| f.name().is_some())
.collect()
}
#[cfg(test)]
mod tests {
use crate::tests::{check_assist, check_assist_not_applicable};
use super::*;
#[test]
fn not_applicable_if_sorted() {
cov_mark::check!(not_applicable_if_sorted);
check_assist_not_applicable(
reorder_impl,
r#"
trait Bar {
fn a() {}
fn z() {}
fn b() {}
}
struct Foo;
$0impl Bar for Foo {
fn a() {}
fn z() {}
fn b() {}
}
"#,
)
}
#[test]
fn not_applicable_if_empty() {
check_assist_not_applicable(
reorder_impl,
r#"
trait Bar {};
struct Foo;
$0impl Bar for Foo {}
"#,
)
}
#[test]
fn reorder_impl_trait_methods() {
check_assist(
reorder_impl,
r#"
trait Bar {
fn a() {}
fn c() {}
fn b() {}
fn d() {}
}
struct Foo;
$0impl Bar for Foo {
fn d() {}
fn b() {}
fn c() {}
fn a() {}
}
"#,
r#"
trait Bar {
fn a() {}
fn c() {}
fn b() {}
fn d() {}
}
struct Foo;
impl Bar for Foo {
fn a() {}
fn c() {}
fn b() {}
fn d() {}
}
"#,
)
}
}
|
