dcbor 0.25.2

Deterministic CBOR ("dCBOR") for Rust.
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

import_stdlib!();

use crate::{CBOR, CBOREncodable, Error, Map, MapIter, Result};

#[derive(Clone, Default, PartialEq, Eq)]
pub struct Set(Map);

impl Set {
    /// Makes a new, empty CBOR `Set`.
    pub fn new() -> Self { Self(Map::new()) }

    /// Returns the number of elements in the set.
    pub fn len(&self) -> usize { self.0.len() }

    /// Checks if the set is empty.
    pub fn is_empty(&self) -> bool { self.0.is_empty() }

    /// Gets an iterator over the elements in the CBOR set.
    ///
    /// Order is lexicographically by the value's binary-encoded CBOR.
    pub fn iter(&self) -> SetIter<'_> { SetIter::new(self.0.iter()) }

    /// Inserts a value into the set.
    pub fn insert<T>(&mut self, value: T)
    where
        T: Into<CBOR> + Clone,
    {
        self.0.insert(value.clone(), value)
    }

    pub(crate) fn insert_next(&mut self, value: CBOR) -> Result<()> {
        self.0.insert_next(value.clone(), value)
    }

    /// Tests if the set contains a value.
    pub fn contains<T>(&self, value: T) -> bool
    where
        T: Into<CBOR>,
    {
        self.0.contains_key(value)
    }
}

impl Set {
    pub fn as_vec(&self) -> Vec<CBOR> {
        self.0.iter().map(|(_, v)| v.clone()).collect()
    }

    pub fn from_vec<T>(vec: Vec<T>) -> Self
    where
        T: Into<CBOR> + Clone,
    {
        let mut set = Set::new();
        for item in vec {
            set.insert(item);
        }
        set
    }

    pub fn try_from_vec<T>(vec: Vec<T>) -> Result<Self>
    where
        T: Into<CBOR> + Clone,
    {
        let mut set = Set::new();
        for item in vec {
            set.insert_next(item.into())?;
        }
        Ok(set)
    }

    pub fn cbor_data(&self) -> Vec<u8> { self.as_vec().to_cbor_data() }
}

impl From<Set> for CBOR {
    fn from(value: Set) -> Self { value.as_vec().into() }
}

impl<T> TryFrom<Vec<T>> for Set
where
    T: Into<CBOR> + Clone,
{
    type Error = Error;

    fn try_from(vec: Vec<T>) -> Result<Self> { Self::try_from_vec(vec) }
}

impl<T> TryFrom<Set> for Vec<T>
where
    T: TryFrom<CBOR, Error = Error> + Clone,
{
    type Error = Error;

    fn try_from(set: Set) -> Result<Self> {
        set.as_vec()
            .into_iter()
            .map(|item| item.try_into())
            .collect()
    }
}

impl<T> From<HashSet<T>> for Set
where
    T: Into<CBOR> + Clone,
{
    fn from(vec: HashSet<T>) -> Self {
        Self::from_vec(vec.into_iter().collect())
    }
}

impl<T> TryFrom<Set> for HashSet<T>
where
    T: TryFrom<CBOR, Error = Error> + Clone + Eq + hash::Hash,
{
    type Error = Error;

    fn try_from(set: Set) -> Result<Self> {
        set.as_vec()
            .into_iter()
            .map(|item| item.try_into())
            .collect()
    }
}

impl fmt::Debug for Set {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(f, "{:?}", self.as_vec())
    }
}

#[derive(Debug)]
pub struct SetIter<'a>(MapIter<'a>);

impl<'a> SetIter<'a> {
    pub fn new(iter: MapIter<'a>) -> Self { Self(iter) }
}

impl<'a> Iterator for SetIter<'a> {
    type Item = &'a CBOR;

    fn next(&mut self) -> Option<Self::Item> { self.0.next().map(|(_, v)| v) }
}