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
|
/// A sorted map that allows multiple values for each key.
pub use dup_tree_map::DupTreeMap;
mod one_or_more {
use either::Either;
use std::{iter, slice, vec};
#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub enum OneOrMore<T> {
One(T),
More(Vec<T>),
}
pub type Iter<'a, T> = Either<slice::Iter<'a, T>, iter::Once<&'a T>>;
pub type IntoIter<T> = Either<vec::IntoIter<T>, iter::Once<T>>;
impl<T> OneOrMore<T> {
pub fn new(x: T) -> Self {
OneOrMore::One(x)
}
pub fn push(&mut self, x: T) {
take_mut::take(self, |sef| match sef {
OneOrMore::More(mut vec) => {
vec.push(x);
OneOrMore::More(vec)
}
OneOrMore::One(one) => OneOrMore::More(vec![one, x]),
})
}
pub fn iter(&self) -> Iter<'_, T> {
match self {
OneOrMore::More(vec) => Either::Left(vec.iter()),
OneOrMore::One(x) => Either::Right(iter::once(x)),
}
}
}
impl<T> IntoIterator for OneOrMore<T> {
type Item = T;
type IntoIter = IntoIter<T>;
fn into_iter(self) -> Self::IntoIter {
match self {
OneOrMore::More(vec) => Either::Left(vec.into_iter()),
OneOrMore::One(x) => Either::Right(iter::once(x)),
}
}
}
}
mod dup_tree_map {
use super::one_or_more;
use super::one_or_more::OneOrMore;
use std::collections::{btree_map, BTreeMap};
use std::iter;
#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub struct DupTreeMap<K, V> {
map: BTreeMap<K, OneOrMore<V>>,
size: usize,
}
pub type IterInternalIntermediate<'a, K, V> =
iter::Zip<iter::Repeat<&'a K>, one_or_more::Iter<'a, V>>;
pub type IterInternal<'a, K, V> = iter::FlatMap<
btree_map::Iter<'a, K, OneOrMore<V>>,
IterInternalIntermediate<'a, K, V>,
for<'b> fn(
(&'b K, &'b OneOrMore<V>),
) -> IterInternalIntermediate<'b, K, V>,
>;
pub struct Iter<'a, K, V> {
iter: IterInternal<'a, K, V>,
size: usize,
}
pub type IntoIterInternalIntermediate<K, V> =
iter::Zip<iter::Repeat<K>, one_or_more::IntoIter<V>>;
pub type IntoIterInternal<K, V> = iter::FlatMap<
btree_map::IntoIter<K, OneOrMore<V>>,
IntoIterInternalIntermediate<K, V>,
fn((K, OneOrMore<V>)) -> IntoIterInternalIntermediate<K, V>,
>;
pub struct IntoIter<K: Clone, V> {
iter: IntoIterInternal<K, V>,
size: usize,
}
impl<K, V> DupTreeMap<K, V> {
pub fn new() -> Self
where
K: Ord,
{
DupTreeMap {
map: BTreeMap::new(),
size: 0,
}
}
pub fn insert(&mut self, key: K, value: V)
where
K: Ord,
{
use std::collections::btree_map::Entry;
match self.map.entry(key) {
Entry::Vacant(e) => {
e.insert(OneOrMore::new(value));
}
Entry::Occupied(mut e) => e.get_mut().push(value),
}
self.size += 1;
}
pub fn len(&self) -> usize {
self.size
}
pub fn is_empty(&self) -> bool {
self.size == 0
}
pub fn iter(&self) -> Iter<'_, K, V>
where
K: Ord,
{
fn foo<'a, K, V>(
(k, oom): (&'a K, &'a OneOrMore<V>),
) -> IterInternalIntermediate<'a, K, V> {
iter::repeat(k).zip(oom.iter())
}
Iter {
iter: self.map.iter().flat_map(foo),
size: self.size,
}
}
}
impl<K, V> Default for DupTreeMap<K, V>
where
K: Ord,
{
fn default() -> Self {
Self::new()
}
}
impl<K, V> IntoIterator for DupTreeMap<K, V>
where
K: Ord + Clone,
{
type Item = (K, V);
type IntoIter = IntoIter<K, V>;
fn into_iter(self) -> Self::IntoIter {
fn foo<K, V>(
(k, oom): (K, OneOrMore<V>),
) -> IntoIterInternalIntermediate<K, V>
where
K: Clone,
{
iter::repeat(k).zip(oom.into_iter())
}
IntoIter {
iter: self.map.into_iter().flat_map(foo),
size: self.size,
}
}
}
impl<'a, K, V> IntoIterator for &'a DupTreeMap<K, V>
where
K: Ord,
{
type Item = (&'a K, &'a V);
type IntoIter = Iter<'a, K, V>;
fn into_iter(self) -> Self::IntoIter {
self.iter()
}
}
impl<K, V> iter::FromIterator<(K, V)> for DupTreeMap<K, V>
where
K: Ord,
{
fn from_iter<T>(iter: T) -> Self
where
T: IntoIterator<Item = (K, V)>,
{
let mut map = DupTreeMap::new();
for (k, v) in iter {
map.insert(k, v);
}
map
}
}
impl<'a, K, V> Iterator for Iter<'a, K, V> {
type Item = (&'a K, &'a V);
fn next(&mut self) -> Option<Self::Item> {
let next = self.iter.next();
if next.is_some() {
self.size -= 1;
}
next
}
fn size_hint(&self) -> (usize, Option<usize>) {
(self.size, Some(self.size))
}
}
impl<K, V> Iterator for IntoIter<K, V>
where
K: Clone,
{
type Item = (K, V);
fn next(&mut self) -> Option<Self::Item> {
let next = self.iter.next();
if next.is_some() {
self.size -= 1;
}
next
}
fn size_hint(&self) -> (usize, Option<usize>) {
(self.size, Some(self.size))
}
}
// unsafe impl<K, V> iter::TrustedLen for IntoIter<K, V> {}
}
|
