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
|
use std::cmp::Ordering;
/// Implementation guts for `min_set`, `min_set_by`, and `min_set_by_key`.
pub fn min_set_impl<I, K, F, Compare>(
mut it: I,
mut key_for: F,
mut compare: Compare,
) -> Vec<I::Item>
where
I: Iterator,
F: FnMut(&I::Item) -> K,
Compare: FnMut(&I::Item, &I::Item, &K, &K) -> Ordering,
{
match it.next() {
None => Vec::new(),
Some(element) => {
let mut current_key = key_for(&element);
let mut result = vec![element];
it.for_each(|element| {
let key = key_for(&element);
match compare(&element, &result[0], &key, ¤t_key) {
Ordering::Less => {
result.clear();
result.push(element);
current_key = key;
}
Ordering::Equal => {
result.push(element);
}
Ordering::Greater => {}
}
});
result
}
}
}
/// Implementation guts for `ax_set`, `max_set_by`, and `max_set_by_key`.
pub fn max_set_impl<I, K, F, Compare>(it: I, key_for: F, mut compare: Compare) -> Vec<I::Item>
where
I: Iterator,
F: FnMut(&I::Item) -> K,
Compare: FnMut(&I::Item, &I::Item, &K, &K) -> Ordering,
{
min_set_impl(it, key_for, |it1, it2, key1, key2| {
compare(it2, it1, key2, key1)
})
}
|
