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
use crate::{
collections::btree_set::{ArchivedBTreeSet, BTreeSetResolver},
ser::Serializer,
Archive, Deserialize, Fallible, Serialize,
};
#[cfg(not(feature = "std"))]
use alloc::collections::BTreeSet;
#[cfg(feature = "std")]
use std::collections::BTreeSet;
impl<K: Archive + Ord> Archive for BTreeSet<K>
where
K::Archived: Ord,
{
type Archived = ArchivedBTreeSet<K::Archived>;
type Resolver = BTreeSetResolver;
#[inline]
unsafe fn resolve(&self, pos: usize, resolver: Self::Resolver, out: *mut Self::Archived) {
ArchivedBTreeSet::<K::Archived>::resolve_from_len(self.len(), pos, resolver, out);
}
}
impl<K: Serialize<S> + Ord, S: Serializer + ?Sized> Serialize<S> for BTreeSet<K>
where
K::Archived: Ord,
{
#[inline]
fn serialize(&self, serializer: &mut S) -> Result<Self::Resolver, S::Error> {
unsafe { ArchivedBTreeSet::serialize_from_reverse_iter(self.iter().rev(), serializer) }
}
}
impl<K, D> Deserialize<BTreeSet<K>, D> for ArchivedBTreeSet<K::Archived>
where
K: Archive + Ord,
K::Archived: Deserialize<K, D> + Ord,
D: Fallible + ?Sized,
{
#[inline]
fn deserialize(&self, deserializer: &mut D) -> Result<BTreeSet<K>, D::Error> {
let mut result = BTreeSet::new();
for k in self.iter() {
result.insert(k.deserialize(deserializer)?);
}
Ok(result)
}
}
impl<K, AK: PartialEq<K>> PartialEq<BTreeSet<K>> for ArchivedBTreeSet<AK> {
#[inline]
fn eq(&self, other: &BTreeSet<K>) -> bool {
if self.len() != other.len() {
false
} else {
self.iter().zip(other.iter()).all(|(a, b)| a.eq(b))
}
}
}
impl<K, AK: PartialEq<K>> PartialEq<ArchivedBTreeSet<AK>> for BTreeSet<K> {
#[inline]
fn eq(&self, other: &ArchivedBTreeSet<AK>) -> bool {
other.eq(self)
}
}