best 0.13.0

Utility for getting the best value of a sequence with an associated value
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
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
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304

#[cfg(feature = "serialize")]
#[macro_use]
extern crate serde;

use std::cmp::Ordering;

#[cfg_attr(feature = "serialize", derive(Serialize, Deserialize))]
#[derive(Debug, Clone, Copy)]
pub struct BestMapNonEmpty<K, V> {
    key: K,
    value: V,
}

impl<K: PartialOrd, V> BestMapNonEmpty<K, V> {
    pub fn insert_gt(&mut self, key: K, value: V) {
        if key > self.key {
            self.insert(key, value);
        }
    }

    pub fn insert_ge(&mut self, key: K, value: V) {
        if key >= self.key {
            self.insert(key, value);
        }
    }

    pub fn insert_lt(&mut self, key: K, value: V) {
        if key < self.key {
            self.insert(key, value);
        }
    }

    pub fn insert_le(&mut self, key: K, value: V) {
        if key <= self.key {
            self.insert(key, value);
        }
    }
}

impl<K, V> BestMapNonEmpty<K, V> {
    pub fn new(key: K, value: V) -> Self {
        Self {
            key: key,
            value: value,
        }
    }

    fn insert(&mut self, key: K, value: V) {
        self.key = key;
        self.value = value;
    }

    pub fn get(&self) -> (&K, &V) {
        (&self.key, &self.value)
    }
    pub fn key(&self) -> &K {
        &self.key
    }
    pub fn value(&self) -> &V {
        &self.value
    }

    pub fn into_key_and_value(self) -> (K, V) {
        (self.key, self.value)
    }
    pub fn into_key(self) -> K {
        self.key
    }
    pub fn into_value(self) -> V {
        self.value
    }
}

#[cfg_attr(feature = "serialize", derive(Serialize, Deserialize))]
#[derive(Debug, Clone, Copy)]
pub struct BestMap<K, V> {
    non_empty: Option<BestMapNonEmpty<K, V>>,
}
impl<K, V> Default for BestMap<K, V> {
    fn default() -> Self {
        Self::new()
    }
}

impl<K: PartialOrd, V> BestMap<K, V> {
    pub fn insert_gt(&mut self, key: K, value: V) {
        if let Some(non_empty) = self.non_empty.as_mut() {
            non_empty.insert_gt(key, value);
            return;
        }
        self.non_empty = Some(BestMapNonEmpty::new(key, value));
    }

    pub fn insert_ge(&mut self, key: K, value: V) {
        if let Some(non_empty) = self.non_empty.as_mut() {
            non_empty.insert_ge(key, value);
            return;
        }
        self.non_empty = Some(BestMapNonEmpty::new(key, value));
    }

    pub fn insert_lt(&mut self, key: K, value: V) {
        if let Some(non_empty) = self.non_empty.as_mut() {
            non_empty.insert_lt(key, value);
            return;
        }
        self.non_empty = Some(BestMapNonEmpty::new(key, value));
    }

    pub fn insert_le(&mut self, key: K, value: V) {
        if let Some(non_empty) = self.non_empty.as_mut() {
            non_empty.insert_le(key, value);
            return;
        }
        self.non_empty = Some(BestMapNonEmpty::new(key, value));
    }
}

impl<K, V> BestMap<K, V> {
    pub fn new() -> Self {
        Self { non_empty: None }
    }

    pub fn get(&self) -> Option<(&K, &V)> {
        self.non_empty.as_ref().map(BestMapNonEmpty::get)
    }

    pub fn key(&self) -> Option<&K> {
        self.non_empty.as_ref().map(BestMapNonEmpty::key)
    }

    pub fn value(&self) -> Option<&V> {
        self.non_empty.as_ref().map(BestMapNonEmpty::value)
    }

    pub fn into_key_and_value(self) -> Option<(K, V)> {
        self.non_empty.map(BestMapNonEmpty::into_key_and_value)
    }

    pub fn into_key(self) -> Option<K> {
        self.non_empty.map(BestMapNonEmpty::into_key)
    }

    pub fn into_value(self) -> Option<V> {
        self.non_empty.map(BestMapNonEmpty::into_value)
    }

    pub fn is_empty(&self) -> bool {
        self.non_empty.is_none()
    }
}

#[cfg_attr(feature = "serialize", derive(Serialize, Deserialize))]
#[derive(Debug, Clone, Copy)]
pub struct BestSetNonEmpty<T>(BestMapNonEmpty<T, ()>);

impl<T: PartialOrd> BestSetNonEmpty<T> {
    pub fn insert_gt(&mut self, value: T) {
        self.0.insert_gt(value, ());
    }
    pub fn insert_ge(&mut self, value: T) {
        self.0.insert_ge(value, ());
    }
    pub fn insert_lt(&mut self, value: T) {
        self.0.insert_lt(value, ());
    }
    pub fn insert_le(&mut self, value: T) {
        self.0.insert_le(value, ());
    }
}

impl<T> BestSetNonEmpty<T> {
    pub fn new(value: T) -> Self {
        BestSetNonEmpty(BestMapNonEmpty::new(value, ()))
    }

    pub fn get(&self) -> &T {
        self.0.key()
    }
    pub fn into_value(self) -> T {
        self.0.into_key()
    }
}

#[cfg_attr(feature = "serialize", derive(Serialize, Deserialize))]
#[derive(Debug, Clone, Copy)]
pub struct BestSet<T>(BestMap<T, ()>);
impl<T> Default for BestSet<T> {
    fn default() -> Self {
        Self::new()
    }
}

impl<T: PartialOrd> BestSet<T> {
    pub fn insert_gt(&mut self, value: T) {
        self.0.insert_gt(value, ());
    }
    pub fn insert_ge(&mut self, value: T) {
        self.0.insert_ge(value, ());
    }
    pub fn insert_lt(&mut self, value: T) {
        self.0.insert_lt(value, ());
    }
    pub fn insert_le(&mut self, value: T) {
        self.0.insert_le(value, ());
    }
}

impl<T> BestSet<T> {
    pub fn new() -> Self {
        BestSet(BestMap::new())
    }
    pub fn get(&self) -> Option<&T> {
        self.0.key()
    }
    pub fn into_value(self) -> Option<T> {
        self.0.into_key()
    }
    pub fn is_empty(&self) -> bool {
        self.0.is_empty()
    }
}

#[cfg_attr(feature = "serialize", derive(Serialize, Deserialize))]
#[derive(Debug, Clone)]
pub struct BestMultiSet<T>(Vec<T>);
impl<T> Default for BestMultiSet<T> {
    fn default() -> Self {
        Self::new()
    }
}

pub type BestMultiSetIter<'a, T> = ::std::slice::Iter<'a, T>;
pub type BestMultiSetDrain<'a, T> = ::std::vec::Drain<'a, T>;

impl<T> BestMultiSet<T> {
    pub fn new() -> Self {
        BestMultiSet(Vec::new())
    }
    pub fn iter(&self) -> BestMultiSetIter<T> {
        self.0.iter()
    }
    pub fn drain(&mut self) -> BestMultiSetDrain<T> {
        self.0.drain(..)
    }
    pub fn first(&self) -> Option<&T> {
        self.0.first()
    }
    pub fn clear(&mut self) {
        self.0.clear();
    }
    pub fn is_empty(&self) -> bool {
        self.0.is_empty()
    }
    fn replace_with_single(&mut self, value: T) {
        self.0.clear();
        self.0.push(value);
    }
    pub fn insert_lt_by<F>(&mut self, value: T, mut compare: F)
    where
        F: FnMut(&T, &T) -> Ordering,
    {
        match self.0.first().map(|v| compare(&value, v)) {
            None | Some(Ordering::Equal) => self.0.push(value),
            Some(Ordering::Less) => self.replace_with_single(value),
            Some(Ordering::Greater) => (),
        }
    }
    pub fn insert_gt_by<F>(&mut self, value: T, mut compare: F)
    where
        F: FnMut(&T, &T) -> Ordering,
    {
        match self.0.first().map(|v| compare(&value, v)) {
            None | Some(Ordering::Equal) => self.0.push(value),
            Some(Ordering::Greater) => self.replace_with_single(value),
            Some(Ordering::Less) => (),
        }
    }
}

impl<T: PartialOrd> BestMultiSet<T> {
    pub fn insert_lt(&mut self, value: T) {
        match self.0.first().map(|v| value.partial_cmp(v)) {
            None | Some(Some(Ordering::Equal)) => self.0.push(value),
            Some(None) | Some(Some(Ordering::Greater)) => (),
            Some(Some(Ordering::Less)) => self.replace_with_single(value),
        }
    }
    pub fn insert_gt(&mut self, value: T) {
        match self.0.first().map(|v| value.partial_cmp(v)) {
            None | Some(Some(Ordering::Equal)) => self.0.push(value),
            Some(None) | Some(Some(Ordering::Less)) => (),
            Some(Some(Ordering::Greater)) => self.replace_with_single(value),
        }
    }
}

impl<'a, T> IntoIterator for &'a BestMultiSet<T> {
    type Item = &'a T;
    type IntoIter = BestMultiSetIter<'a, T>;
    fn into_iter(self) -> Self::IntoIter {
        self.iter()
    }
}