algorist 0.10.2

Algorithms and data structures for competitive programming
Documentation 
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

pub trait Sorted<T> {
    #[must_use]
    fn sorted(self) -> Self;

    #[must_use]
    fn sorted_by_key<K, F>(self, f: F) -> Self
    where
        K: Ord,
        F: FnMut(&T) -> K;

    #[must_use]
    fn sorted_dedup(self) -> Self;
}

impl<T: Ord> Sorted<T> for Vec<T> {
    fn sorted(mut self) -> Self {
        self.sort();
        self
    }

    fn sorted_by_key<K, F>(mut self, f: F) -> Self
    where
        K: Ord,
        F: FnMut(&T) -> K,
    {
        self.sort_by_key(f);
        self
    }

    fn sorted_dedup(mut self) -> Self {
        self.sort();
        self.dedup();
        self
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_sorted() {
        let v = vec![3, 2, 1];
        assert_eq!(v.sorted(), vec![1, 2, 3]);
    }

    #[test]
    fn test_sorted_by_key() {
        let v = vec!["bb", "a", "ccc"];
        assert_eq!(v.sorted_by_key(|s| s.len()), vec!["a", "bb", "ccc"]);
    }

    #[test]
    fn test_sorted_dedup() {
        let v = vec![1, 2, 2, 3, 1];
        assert_eq!(v.sorted_dedup(), vec![1, 2, 3]);
    }
}