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
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
mod const_exprs;
mod style;
pub use const_exprs::*;
pub use style::*;
use crate::rule_prelude::*;
use ast::*;
use rslint_parser::TextRange;
use std::borrow::Borrow;
use std::cmp;
use std::cmp::{Eq, Ord, Reverse};
use std::collections::{BinaryHeap, HashMap};
use std::hash::Hash;
use SyntaxKind::*;
#[rustfmt::skip]
pub fn most_frequent<T>(items: Vec<T>) -> T
where
T: Hash + Eq + Ord + Clone,
{
let mut map = HashMap::new();
for x in items {
*map.entry(x).or_insert(0) += 1;
}
let mut heap = BinaryHeap::with_capacity(2);
for (x, count) in map.into_iter() {
heap.push(Reverse((count, x)));
if heap.len() > 1 {
heap.pop();
}
}
heap.into_sorted_vec()[0].0.1.to_owned()
}
pub fn get_assignment_expr_value(expr: AssignExpr) -> std::string::String {
assert!(expr.op().is_some());
let tok = expr.syntax().first_lossy_token().unwrap();
let op_str = tok.text();
if op_str == "=" {
expr.rhs()
.map(|e| e.syntax().trimmed_text().to_string())
.unwrap_or_default()
} else {
format!(
"{} {} {}",
expr.lhs()
.map(|e| e.syntax().trimmed_text().to_string())
.unwrap_or_default(),
op_str[..op_str.len() - 1].to_string(),
expr.rhs()
.map(|e| e.syntax().trimmed_text().to_string())
.unwrap_or_default()
)
}
}
pub fn multi_node_range(mut nodes: impl Iterator<Item = SyntaxNode>) -> TextRange {
TextRange::new(
nodes
.next()
.map(|x| x.trimmed_range().start())
.unwrap_or_else(|| 0.into()),
nodes
.last()
.map(|x| x.trimmed_range().end())
.unwrap_or_else(|| 0.into()),
)
}
pub fn token_list_range<I>(items: I) -> TextRange
where
I: IntoIterator,
I::Item: Borrow<SyntaxToken>,
{
let collection = items
.into_iter()
.map(|x| x.borrow().clone())
.collect::<Vec<_>>();
let start = collection
.first()
.expect("Empty token list")
.text_range()
.start();
let end = collection
.last()
.expect("Empty token list")
.text_range()
.end();
TextRange::new(start, end)
}
pub fn string_token_eq<L, R>(left: L, right: R) -> bool
where
L: IntoIterator,
R: IntoIterator,
L::Item: Borrow<SyntaxToken>,
R::Item: Borrow<SyntaxToken>,
{
let left_vec: Vec<L::Item> = left.into_iter().collect();
let right_vec: Vec<R::Item> = right.into_iter().collect();
if left_vec.len() != right_vec.len() {
return false;
}
left_vec
.into_iter()
.zip(right_vec.into_iter())
.all(|(l, r)| l.borrow().to_string() == r.borrow().to_string())
}
pub fn levenshtein_distance(a: &str, b: &str) -> usize {
if a.is_empty() {
return b.chars().count();
} else if b.is_empty() {
return a.chars().count();
}
let mut dcol: Vec<_> = (0..=b.len()).collect();
let mut t_last = 0;
for (i, sc) in a.chars().enumerate() {
let mut current = i;
dcol[0] = current + 1;
for (j, tc) in b.chars().enumerate() {
let next = dcol[j + 1];
if sc == tc {
dcol[j + 1] = current;
} else {
dcol[j + 1] = cmp::min(current, next);
dcol[j + 1] = cmp::min(dcol[j + 1], dcol[j]) + 1;
}
current = next;
t_last = j;
}
}
dcol[t_last + 1]
}
pub fn find_best_match_for_name<'a>(
iter_names: impl Iterator<Item = &'a str>,
lookup: &str,
dist: impl Into<Option<usize>>,
) -> Option<&'a str> {
let max_dist = dist
.into()
.map_or_else(|| cmp::max(lookup.len(), 3) / 3, |d| d);
let name_vec = iter_names.collect::<Vec<_>>();
let (case_insensitive_match, levenshtein_match) = name_vec
.iter()
.filter_map(|&name| {
let dist = levenshtein_distance(lookup, name);
if dist <= max_dist {
Some((name, dist))
} else {
None
}
})
.fold((None, None), |result, (candidate, dist)| {
(
if candidate.to_uppercase() == lookup.to_uppercase() {
Some(candidate)
} else {
result.0
},
match result.1 {
None => Some((candidate, dist)),
Some((c, d)) => Some(if dist < d { (candidate, dist) } else { (c, d) }),
},
)
});
if let Some(candidate) = case_insensitive_match {
Some(candidate)
} else if levenshtein_match.is_some() {
levenshtein_match.map(|x| x.0)
} else {
find_match_by_sorted_words(name_vec, lookup)
}
}
fn find_match_by_sorted_words<'a>(iter_names: Vec<&'a str>, lookup: &str) -> Option<&'a str> {
iter_names.iter().fold(None, |result, candidate| {
if sort_by_words(candidate) == sort_by_words(lookup) {
Some(candidate)
} else {
result
}
})
}
fn sort_by_words(name: &str) -> std::string::String {
let mut split_words: Vec<&str> = name.split('_').collect();
split_words.sort_unstable();
split_words.join("_")
}
pub fn constructor_or_call_with_callee(
node: impl Borrow<SyntaxNode>,
name: impl AsRef<str>,
) -> bool {
let node = node.borrow();
match node.kind() {
NEW_EXPR | CALL_EXPR => node.children().any(|child| child.text() == name.as_ref()),
_ => false,
}
}
pub fn outer_function(node: impl Borrow<SyntaxNode>) -> Option<SyntaxNode> {
node.borrow()
.ancestors()
.skip(1)
.find(|ancestor| matches!(ancestor.kind(), ARROW_EXPR | FN_DECL | FN_EXPR))
}