unique-count 0.1.0

Count the elements in slice
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
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

use std::collections::{BTreeMap, BinaryHeap, VecDeque};

pub trait UniqueCount<T> {
    /// count the number of each value in self
    fn unique_count(&self) -> BTreeMap<T, usize>;
}

impl<T: Ord + Clone> UniqueCount<T> for &[T] {
    fn unique_count(&self) -> BTreeMap<T, usize> {
        let mut res = BTreeMap::new();
        for ele in self.iter() {
            *res.entry(ele.clone()).or_insert(0) += 1;
        }

        res
    }
}

impl<T: Ord + Clone> UniqueCount<T> for &[&T] {
    fn unique_count(&self) -> BTreeMap<T, usize> {
        let mut res = BTreeMap::new();
        for &ele in self.iter() {
            *res.entry(ele.clone()).or_insert(0) += 1;
        }

        res
    }
}

impl<T: Ord + Clone> UniqueCount<T> for Vec<T> {
    fn unique_count(&self) -> BTreeMap<T, usize> {
        let mut res = BTreeMap::new();
        for ele in self.iter() {
            *res.entry(ele.clone()).or_insert(0) += 1;
        }

        res
    }
}

impl<T: Ord + Clone> UniqueCount<T> for Vec<&T> {
    fn unique_count(&self) -> BTreeMap<T, usize> {
        let mut res = BTreeMap::new();
        for &ele in self.iter() {
            *res.entry(ele.clone()).or_insert(0) += 1;
        }

        res
    }
}

impl<T: Ord + Clone> UniqueCount<T> for &Vec<T> {
    fn unique_count(&self) -> BTreeMap<T, usize> {
        let mut res = BTreeMap::new();
        for ele in self.iter() {
            *res.entry(ele.clone()).or_insert(0) += 1;
        }

        res
    }
}

impl<T: Ord + Clone> UniqueCount<T> for &Vec<&T> {
    fn unique_count(&self) -> BTreeMap<T, usize> {
        let mut res = BTreeMap::new();
        for &ele in self.iter() {
            *res.entry(ele.clone()).or_insert(0) += 1;
        }

        res
    }
}

impl<T: Ord + Clone> UniqueCount<T> for VecDeque<T> {
    fn unique_count(&self) -> BTreeMap<T, usize> {
        let mut res = BTreeMap::new();
        for ele in self.iter() {
            *res.entry(ele.clone()).or_insert(0) += 1;
        }

        res
    }
}

impl<T: Ord + Clone> UniqueCount<T> for VecDeque<&T> {
    fn unique_count(&self) -> BTreeMap<T, usize> {
        let mut res = BTreeMap::new();
        for &ele in self.iter() {
            *res.entry(ele.clone()).or_insert(0) += 1;
        }

        res
    }
}

impl<T: Ord + Clone> UniqueCount<T> for &VecDeque<T> {
    fn unique_count(&self) -> BTreeMap<T, usize> {
        let mut res = BTreeMap::new();
        for ele in self.iter() {
            *res.entry(ele.clone()).or_insert(0) += 1;
        }

        res
    }
}

impl<T: Ord + Clone> UniqueCount<T> for &VecDeque<&T> {
    fn unique_count(&self) -> BTreeMap<T, usize> {
        let mut res = BTreeMap::new();
        for &ele in self.iter() {
            *res.entry(ele.clone()).or_insert(0) += 1;
        }

        res
    }
}

impl<T: Ord + Clone> UniqueCount<T> for BinaryHeap<T> {
    fn unique_count(&self) -> BTreeMap<T, usize> {
        let mut res = BTreeMap::new();
        for ele in self.iter() {
            *res.entry(ele.clone()).or_insert(0) += 1;
        }

        res
    }
}

impl<T: Ord + Clone> UniqueCount<T> for BinaryHeap<&T> {
    fn unique_count(&self) -> BTreeMap<T, usize> {
        let mut res = BTreeMap::new();
        for &ele in self.iter() {
            *res.entry(ele.clone()).or_insert(0) += 1;
        }

        res
    }
}

impl<T: Ord + Clone> UniqueCount<T> for &BinaryHeap<T> {
    fn unique_count(&self) -> BTreeMap<T, usize> {
        let mut res = BTreeMap::new();
        for ele in self.iter() {
            *res.entry(ele.clone()).or_insert(0) += 1;
        }

        res
    }
}

impl<T: Ord + Clone> UniqueCount<T> for &BinaryHeap<&T> {
    fn unique_count(&self) -> BTreeMap<T, usize> {
        let mut res = BTreeMap::new();
        for &ele in self.iter() {
            *res.entry(ele.clone()).or_insert(0) += 1;
        }

        res
    }
}