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
use std::collections::BTreeMap;
use std::collections::HashSet;
use std::hash::Hash;
pub trait UniqueCollection {
type Item;
/// Get the unique values in the collection
///
/// # Example
///
/// ```rust
/// # use lace::utils::UniqueCollection;
///
/// let xs: Vec<u8> = vec![0, 1, 2, 1, 0, 2, 1, 0, 4];
///
/// let values = xs.unique_values();
///
/// assert_eq!(values.len(), 4);
/// assert_eq!(values.len(), xs.n_unique());
///
/// assert!(xs.contains(&0));
/// assert!(xs.contains(&1));
/// assert!(xs.contains(&2));
/// assert!(xs.contains(&4));
/// ```
fn unique_values(&self) -> Vec<Self::Item>;
/// Get the number of unique values
///
/// # Example
///
/// ```rust
/// # use lace::utils::UniqueCollection;
///
/// let xs: Vec<u8> = vec![0, 1, 2, 1, 0, 2, 1, 0, 4];
///
/// assert_eq!(xs.n_unique(), 4);
/// ```
fn n_unique(&self) -> usize {
self.unique_values().len()
}
/// Get minimum of the number of unique values and the cutoff
///
/// # Example
///
/// ```rust
/// # use lace::utils::UniqueCollection;
///
/// let xs: Vec<u8> = vec![0, 1, 2, 1, 0, 2, 1, 0, 4];
///
/// assert_eq!(xs.n_unique_cutoff(4), 4);
/// assert_eq!(xs.n_unique_cutoff(10), 4);
/// assert_eq!(xs.n_unique_cutoff(3), 3);
/// ```
fn n_unique_cutoff(&self, cutoff: usize) -> usize;
/// Get the unique values indexed by a `usize` ID
///
/// # Example
///
/// ```rust
/// # use lace::utils::UniqueCollection;
///
/// let xs: Vec<u8> = vec![0, 1, 2, 1, 0, 2, 1, 0, 4];
///
/// let map = xs.value_map();
///
/// assert_eq!(map.len(), 4);
/// assert_eq!(map.len(), xs.n_unique());
/// ```
fn value_map(&self) -> BTreeMap<usize, Self::Item> {
let mut map = BTreeMap::new();
self.unique_values()
.drain(..)
.enumerate()
.for_each(|(id, value)| {
map.insert(id, value);
});
map
}
}
impl<T> UniqueCollection for &[T]
where
T: Hash + Eq + Clone,
{
type Item = T;
fn unique_values(&self) -> Vec<T> {
let mut set = HashSet::new();
self.iter().for_each(|value| {
if !set.contains(value) {
set.insert(value.to_owned());
}
});
set.into_iter().collect()
}
fn n_unique_cutoff(&self, cutoff: usize) -> usize {
let mut set = HashSet::new();
for value in self.iter() {
if set.len() == cutoff {
return cutoff;
}
if !set.contains(value) {
set.insert(value.to_owned());
}
}
set.len()
}
}
impl<T> UniqueCollection for Vec<T>
where
T: Hash + Eq + Clone,
{
type Item = T;
fn unique_values(&self) -> Vec<T> {
let mut set = HashSet::new();
self.iter().for_each(|value| {
if !set.contains(value) {
set.insert(value.to_owned());
}
});
set.into_iter().collect()
}
fn n_unique_cutoff(&self, cutoff: usize) -> usize {
let mut set = HashSet::new();
for value in self.iter() {
if set.len() == cutoff {
return cutoff;
}
if !set.contains(value) {
set.insert(value.to_owned());
}
}
set.len()
}
}