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
extern crate serde; #[macro_use] extern crate serde_derive; #[derive(Debug, Clone, Copy, Serialize, Deserialize)] pub struct BestMapNonEmpty<K: PartialOrd, V> { key: K, value: V, len: usize, } impl<K: PartialOrd, V> BestMapNonEmpty<K, V> { pub fn new(key: K, value: V) -> Self { BestMapNonEmpty { key: key, value: value, len: 1, } } pub fn insert_gt(&mut self, key: K, value: V) { if key > self.key { self.key = key; self.value = value; } self.len += 1; } pub fn insert_ge(&mut self, key: K, value: V) { if key >= self.key { self.key = key; self.value = value; } self.len += 1; } pub fn insert_lt(&mut self, key: K, value: V) { if key < self.key { self.key = key; self.value = value; } self.len += 1; } pub fn insert_le(&mut self, key: K, value: V) { if key <= self.key { self.key = key; self.value = value; } self.len += 1; } 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 } pub fn len(&self) -> usize { self.len } } #[derive(Debug, Clone, Copy, Serialize, Deserialize)] pub struct BestMap<K: PartialOrd, V> { non_empty: Option<BestMapNonEmpty<K, V>>, } impl<K: PartialOrd, V> BestMap<K, V> { pub fn new() -> Self { Self { non_empty: None } } 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)); } 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 len(&self) -> usize { self.non_empty .as_ref() .map(BestMapNonEmpty::len) .unwrap_or(0) } pub fn is_empty(&self) -> bool { self.non_empty.is_none() } } #[derive(Debug, Clone, Copy, Serialize, Deserialize)] pub struct BestSetNonEmpty<T: PartialOrd>(BestMapNonEmpty<T, ()>); impl<T: PartialOrd> BestSetNonEmpty<T> { pub fn new(value: T) -> Self { BestSetNonEmpty(BestMapNonEmpty::new(value, ())) } 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, ()); } pub fn get(&self) -> &T { self.0.key() } pub fn into_value(self) -> T { self.0.into_key() } pub fn len(&self) -> usize { self.0.len() } } #[derive(Debug, Clone, Copy, Serialize, Deserialize)] pub struct BestSet<T: PartialOrd>(BestMap<T, ()>); impl<T: PartialOrd> BestSet<T> { pub fn new() -> Self { BestSet(BestMap::new()) } 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, ()); } pub fn get(&self) -> Option<&T> { self.0.key() } pub fn into_value(self) -> Option<T> { self.0.into_key() } pub fn len(&self) -> usize { self.0.len() } pub fn is_empty(&self) -> bool { self.0.is_empty() } }