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
251
#[cfg(feature = "serde1")]
use serde::{Deserialize, Serialize};
use crate::impl_display;
use crate::misc::vec_to_string;
use std::fmt;
#[derive(Debug, Clone, Eq, PartialEq)]
#[cfg_attr(feature = "serde1", derive(Serialize, Deserialize))]
pub struct Partition {
z: Vec<usize>,
counts: Vec<usize>,
}
impl Default for Partition {
fn default() -> Self {
Partition::new()
}
}
impl From<&Partition> for String {
fn from(part: &Partition) -> String {
let mut out = String::new();
out.push_str(
format!("Partition (n: {}, k: {})\n", part.len(), part.k())
.as_str(),
);
out.push_str(
format!(" assignment: {}\n", vec_to_string(&part.z, 15)).as_str(),
);
out.push_str(
format!(" counts: {}\n", vec_to_string(&part.counts, part.k()))
.as_str(),
);
out
}
}
impl_display!(Partition);
#[derive(Debug, Clone, Eq, PartialEq)]
#[cfg_attr(feature = "serde1", derive(Serialize, Deserialize))]
pub enum PartitionError {
EmptyInputPartition,
IndicatorHigherThanNumberOfPartitions {
zi: usize,
nparts: usize,
},
}
impl std::error::Error for PartitionError {}
impl fmt::Display for PartitionError {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
match self {
Self::EmptyInputPartition => {
write!(f, "the input partition was empty")
}
Self::IndicatorHigherThanNumberOfPartitions { zi, nparts } => {
write!(
f,
"tried to append z = {0} to a partition with {1} \
partitions. z must be in 0..n_parts, (or 0..{1}),",
zi, nparts
)
}
}
}
}
impl Partition {
pub fn new() -> Partition {
Partition {
z: vec![],
counts: vec![],
}
}
pub fn new_unchecked(z: Vec<usize>, counts: Vec<usize>) -> Self {
Partition { z, counts }
}
pub fn z(&self) -> &Vec<usize> {
&self.z
}
pub fn z_mut(&mut self) -> &mut Vec<usize> {
&mut self.z
}
pub fn counts(&self) -> &Vec<usize> {
&self.counts
}
pub fn counts_mut(&mut self) -> &mut Vec<usize> {
&mut self.counts
}
pub fn from_z(z: Vec<usize>) -> Result<Self, PartitionError> {
if z.is_empty() {
return Err(PartitionError::EmptyInputPartition);
}
let k = *z.iter().max().expect("empty z") + 1;
let mut counts: Vec<usize> = vec![0; k];
z.iter().for_each(|&zi| counts[zi] += 1);
if counts.iter().all(|&ct| ct > 0) {
let part = Partition { z, counts };
Ok(part)
} else {
Err(PartitionError::EmptyInputPartition)
}
}
pub fn remove(&mut self, ix: usize) -> Result<(), PartitionError> {
let zi = self.z.remove(ix);
if self.counts[zi] == 1 {
let _ct = self.counts.remove(zi);
self.z.iter_mut().for_each(|zj| {
if *zj > zi {
*zj -= 1
}
});
Ok(())
} else {
self.counts[zi] -= 1;
Ok(())
}
}
pub fn append(&mut self, zi: usize) -> Result<(), PartitionError> {
let k = self.k();
if zi > k {
Err(PartitionError::IndicatorHigherThanNumberOfPartitions {
zi,
nparts: k,
})
} else {
self.z.push(zi);
if zi == k {
self.counts.push(1);
} else {
self.counts[zi] += 1;
}
Ok(())
}
}
pub fn k(&self) -> usize {
self.counts.len()
}
pub fn len(&self) -> usize {
self.z.len()
}
pub fn is_empty(&self) -> bool {
self.len() == 0
}
pub fn weights(&self) -> Vec<f64> {
let n = self.len() as f64;
self.counts.iter().map(|&ct| (ct as f64) / n).collect()
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn new() {
let part = Partition::from_z(vec![0, 1, 0, 2]).unwrap();
assert_eq!(part.k(), 3);
assert_eq!(part.counts, vec![2, 1, 1]);
}
}