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
use std::{
borrow::Borrow,
collections::{BTreeMap, BTreeSet},
};
use serde::{Deserialize, Serialize};
use crate::{traits::Coalesce, Aggregate};
#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Default, Serialize, Deserialize)]
pub struct Counter(pub usize);
impl<T: ?Sized> Aggregate<T> for Counter {
fn aggregate(&mut self, _value: &'_ T) {
self.0 += 1;
}
}
impl Coalesce for Counter {
fn coalesce(&mut self, other: Self)
where
Self: Sized,
{
self.0 += other.0;
}
}
#[derive(Debug, Clone, PartialEq, Eq, Hash, Serialize, Deserialize)]
pub struct CountingSet<T: Ord>(pub BTreeMap<T, usize>);
impl<T: Clone + Ord> CountingSet<T> {
pub fn insert<Q: ?Sized>(&mut self, key: &Q)
where
T: Borrow<Q>,
Q: Ord + ToOwned<Owned = T>,
{
match self.0.get_mut(key) {
Some(v) => *v += 1,
None => {
self.0.insert(ToOwned::to_owned(key), 1);
}
};
}
pub fn contains_key<Q: ?Sized>(&mut self, key: &Q) -> bool
where
T: Borrow<Q>,
Q: Ord,
{
self.0.contains_key(key)
}
pub fn is_empty(&self) -> bool {
self.0.is_empty()
}
pub fn len(&self) -> usize {
self.0.len()
}
}
impl<T: Ord> Coalesce for CountingSet<T> {
fn coalesce(&mut self, other: Self)
where
Self: Sized,
{
for (k, v) in other.0 {
let s: &mut usize = self.0.entry(k).or_insert(0);
*s += v;
}
}
}
impl<T: Ord> Default for CountingSet<T> {
fn default() -> Self {
Self(Default::default())
}
}
#[derive(Debug, Clone, PartialEq, Eq, Hash, Default, Serialize, Deserialize)]
pub struct MinMax<T> {
pub min: Option<T>,
pub max: Option<T>,
}
impl<T: Clone + PartialOrd> Aggregate<T> for MinMax<T> {
fn aggregate(&mut self, value: &'_ T) {
match &self.min {
Some(old_min) if value < old_min => self.min = Some(value.clone()),
Some(_) => {}
None => self.min = Some(value.clone()),
};
match &self.max {
Some(old_max) if value > old_max => self.max = Some(value.clone()),
Some(_) => {}
None => self.max = Some(value.clone()),
};
}
}
impl<T: Clone + PartialOrd> Coalesce for MinMax<T> {
fn coalesce(&mut self, other: Self)
where
Self: Sized,
{
if let Some(other_min) = other.min {
self.aggregate(&other_min);
}
if let Some(other_max) = other.max {
self.aggregate(&other_max);
}
}
}
#[derive(Debug, Clone, PartialEq, Eq, Hash, Serialize, Deserialize)]
pub struct Sampler<T: Ord> {
values: BTreeSet<T>,
is_exaustive: bool,
}
const MAX_SAMPLE_COUNT: usize = 5;
impl<T, Q> Aggregate<Q> for Sampler<T>
where
T: Ord + Borrow<Q>,
Q: Ord + ToOwned<Owned = T> + ?Sized,
{
fn aggregate(&mut self, value: &'_ Q) {
if self.values.len() <= MAX_SAMPLE_COUNT {
self.values.insert(value.to_owned());
} else if self.is_exaustive && !self.values.contains(value) {
self.is_exaustive = false;
}
}
}
impl<T: Ord> Coalesce for Sampler<T> {
fn coalesce(&mut self, other: Self)
where
Self: Sized,
{
self.values.extend(other.values);
if self.values.len() > MAX_SAMPLE_COUNT {
self.is_exaustive = false;
}
self.values = std::mem::take(&mut self.values)
.into_iter()
.take(MAX_SAMPLE_COUNT)
.collect();
}
}
impl<T: Ord> Default for Sampler<T> {
fn default() -> Self {
Self {
values: Default::default(),
is_exaustive: true,
}
}
}