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
use std::fmt::{self, Formatter}; use std::iter::FromIterator; use std::ops::RangeFull; use serde::ser::{Serialize, SerializeSeq, Serializer}; use serde::de::{self, Deserialize, Deserializer, SeqAccess, Visitor}; use super::Key; use super::map::{self, Keys, Map}; #[derive(Clone, Debug, Default, PartialEq)] pub struct Set { inner: Map<()>, } impl Set { pub fn new() -> Self { Default::default() } pub fn with_capacity(capacity: usize) -> Self { let inner = Map::with_capacity(capacity); Set { inner } } pub fn clear(&mut self) { self.inner.clear(); } pub fn contains(&self, key: &str) -> bool { self.inner.contains_key(key) } pub fn drain(&mut self, range: RangeFull) -> Drain { let iter = self.inner.drain(range); Drain { iter } } pub fn insert(&mut self, key: Key) -> bool { self.inner.insert(key, ()).is_none() } pub fn is_empty(&self) -> bool { self.len() == 0 } pub fn iter(&self) -> Iter { let iter = self.inner.keys(); Iter { iter } } pub fn len(&self) -> usize { self.inner.len() } pub fn remove(&mut self, key: &str) -> bool { self.inner.remove(key).is_some() } } impl Extend<Key> for Set { fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item = Key>, { let iter = iter.into_iter().map(|key| (key, ())); self.inner.extend(iter); } } impl FromIterator<Key> for Set { fn from_iter<I>(iter: I) -> Self where I: IntoIterator<Item = Key>, { let inner = iter.into_iter().map(|key| (key, ())).collect(); Set { inner } } } impl IntoIterator for Set { type Item = Key; type IntoIter = IntoIter; fn into_iter(self) -> Self::IntoIter { let iter = self.inner.into_iter(); IntoIter { iter } } } impl<'a> IntoIterator for &'a Set { type Item = &'a Key; type IntoIter = Iter<'a>; fn into_iter(self) -> Self::IntoIter { self.iter() } } impl<'de> Deserialize<'de> for Set { fn deserialize<D>(deserializer: D) -> Result<Self, D::Error> where D: Deserializer<'de>, { struct SetVisitor; impl<'de> Visitor<'de> for SetVisitor { type Value = Set; fn expecting(&self, f: &mut Formatter) -> fmt::Result { f.write_str("a sequence of json api member names") } fn visit_seq<A>(self, mut seq: A) -> Result<Self::Value, A::Error> where A: SeqAccess<'de>, { let mut set = Set::with_capacity(seq.size_hint().unwrap_or(0)); while let Some(value) = seq.next_element::<String>()? { set.insert(value.parse().map_err(de::Error::custom)?); } Ok(set) } } deserializer.deserialize_seq(SetVisitor) } } impl Serialize for Set { fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error> where S: Serializer, { let mut state = serializer.serialize_seq(Some(self.len()))?; for key in self { state.serialize_element(key)?; } state.end() } } pub struct Drain<'a> { iter: map::Drain<'a, ()>, } impl<'a> Iterator for Drain<'a> { type Item = Key; fn next(&mut self) -> Option<Self::Item> { self.iter.next().map(|(key, _)| key) } fn size_hint(&self) -> (usize, Option<usize>) { self.iter.size_hint() } } pub struct Iter<'a> { iter: Keys<'a, ()>, } impl<'a> Iterator for Iter<'a> { type Item = &'a Key; fn next(&mut self) -> Option<Self::Item> { self.iter.next() } fn count(self) -> usize { self.iter.len() } fn last(mut self) -> Option<Self::Item> { self.next_back() } fn nth(&mut self, n: usize) -> Option<Self::Item> { self.iter.nth(n) } fn size_hint(&self) -> (usize, Option<usize>) { self.iter.size_hint() } } impl<'a> DoubleEndedIterator for Iter<'a> { fn next_back(&mut self) -> Option<Self::Item> { self.iter.next_back() } } impl<'a> ExactSizeIterator for Iter<'a> { fn len(&self) -> usize { self.iter.len() } } pub struct IntoIter { iter: map::IntoIter<()>, } impl Iterator for IntoIter { type Item = Key; fn next(&mut self) -> Option<Self::Item> { self.iter.next().map(|(key, _)| key) } fn count(self) -> usize { self.iter.len() } fn last(mut self) -> Option<Self::Item> { self.next_back() } fn nth(&mut self, n: usize) -> Option<Self::Item> { self.iter.nth(n).map(|(key, _)| key) } fn size_hint(&self) -> (usize, Option<usize>) { self.iter.size_hint() } } impl<'a> DoubleEndedIterator for IntoIter { fn next_back(&mut self) -> Option<Self::Item> { self.iter.next_back().map(|(key, _)| key) } } impl ExactSizeIterator for IntoIter { fn len(&self) -> usize { self.iter.len() } }