-
Notifications
You must be signed in to change notification settings - Fork 40
/
ipld.rs
247 lines (224 loc) · 7.48 KB
/
ipld.rs
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
//! Ipld representation.
use crate::cid::Cid;
use crate::error::TypeError;
use std::collections::{BTreeMap, HashSet};
/// Ipld
#[derive(Clone, Debug, PartialEq)]
pub enum Ipld {
/// Represents the absence of a value or the value undefined.
Null,
/// Represents a boolean value.
Bool(bool),
/// Represents an integer.
Integer(i128),
/// Represents a floating point value.
Float(f64),
/// Represents an UTF-8 string.
String(String),
/// Represents a sequence of bytes.
Bytes(Vec<u8>),
/// Represents a list.
List(Vec<Ipld>),
/// Represents a map.
Map(BTreeMap<String, Ipld>),
/// Represents a link to an Ipld node.
Link(Cid),
}
/// An index into ipld
pub enum IpldIndex<'a> {
/// An index into an ipld list.
List(usize),
/// An owned index into an ipld map.
Map(String),
/// An index into an ipld map.
MapRef(&'a str),
}
impl<'a> From<usize> for IpldIndex<'a> {
fn from(index: usize) -> Self {
Self::List(index)
}
}
impl<'a> From<String> for IpldIndex<'a> {
fn from(key: String) -> Self {
Self::Map(key)
}
}
impl<'a> From<&'a str> for IpldIndex<'a> {
fn from(key: &'a str) -> Self {
Self::MapRef(key)
}
}
impl Ipld {
/// Destructs an ipld list or map
pub fn take<'a, T: Into<IpldIndex<'a>>>(self, index: T) -> Result<Self, TypeError> {
let index = index.into();
let type_err = |index, ipld| TypeError::new(index, ipld);
match self {
Ipld::List(mut l) => match index {
IpldIndex::List(i) => Some(i),
IpldIndex::Map(ref key) => key.parse().ok(),
IpldIndex::MapRef(key) => key.parse().ok(),
}
.map(|i: usize| l.remove(i))
.ok_or_else(|| type_err(index, Ipld::List(l))),
Ipld::Map(mut m) => match index {
IpldIndex::Map(ref key) => m.remove(key),
IpldIndex::MapRef(key) => m.remove(key),
IpldIndex::List(i) => m.remove(&i.to_string()),
}
.ok_or_else(|| type_err(index, Ipld::Map(m))),
a => Err(TypeError::new(index, a)),
}
}
/// Indexes into an ipld list or map.
pub fn get<'a, T: Into<IpldIndex<'a>>>(&self, index: T) -> Result<&Self, TypeError> {
let index = index.into();
let ipld = match self {
Ipld::List(l) => match index {
IpldIndex::List(i) => l.get(i),
IpldIndex::Map(ref key) => key
.parse()
.ok()
.map(|i: usize| l.get(i))
.unwrap_or_default(),
IpldIndex::MapRef(key) => key
.parse()
.ok()
.map(|i: usize| l.get(i))
.unwrap_or_default(),
},
Ipld::Map(m) => match index {
IpldIndex::Map(ref key) => m.get(key),
IpldIndex::MapRef(key) => m.get(key),
IpldIndex::List(i) => m.get(&i.to_string()),
},
_ => None,
};
ipld.ok_or_else(|| TypeError::new(index, self))
}
/// Returns an iterator.
pub fn iter(&self) -> IpldIter<'_> {
IpldIter {
stack: vec![Box::new(vec![self].into_iter())],
}
}
/// Returns the references to other blocks.
pub fn references(&self) -> HashSet<Cid> {
let mut set: HashSet<Cid> = Default::default();
for ipld in self.iter() {
if let Ipld::Link(cid) = ipld {
set.insert(cid.to_owned());
}
}
set
}
}
/// Ipld iterator.
pub struct IpldIter<'a> {
stack: Vec<Box<dyn Iterator<Item = &'a Ipld> + 'a>>,
}
impl<'a> Iterator for IpldIter<'a> {
type Item = &'a Ipld;
fn next(&mut self) -> Option<Self::Item> {
loop {
if let Some(iter) = self.stack.last_mut() {
if let Some(ipld) = iter.next() {
match ipld {
Ipld::List(list) => {
self.stack.push(Box::new(list.iter()));
}
Ipld::Map(map) => {
self.stack.push(Box::new(map.values()));
}
_ => {}
}
return Some(ipld);
} else {
self.stack.pop();
}
} else {
return None;
}
}
}
}
#[cfg(test)]
mod tests {
use super::*;
use crate::cid::Cid;
use crate::multihash::{Code, MultihashCode};
#[test]
fn test_ipld_bool_from() {
assert_eq!(Ipld::Bool(true), Ipld::from(true));
assert_eq!(Ipld::Bool(false), Ipld::from(false));
}
#[test]
fn test_ipld_integer_from() {
assert_eq!(Ipld::Integer(1), Ipld::from(1i8));
assert_eq!(Ipld::Integer(1), Ipld::from(1i16));
assert_eq!(Ipld::Integer(1), Ipld::from(1i32));
assert_eq!(Ipld::Integer(1), Ipld::from(1i64));
assert_eq!(Ipld::Integer(1), Ipld::from(1i128));
//assert_eq!(Ipld::Integer(1), 1u8.to_ipld().to_owned());
assert_eq!(Ipld::Integer(1), Ipld::from(1u16));
assert_eq!(Ipld::Integer(1), Ipld::from(1u32));
assert_eq!(Ipld::Integer(1), Ipld::from(1u64));
}
#[test]
fn test_ipld_float_from() {
assert_eq!(Ipld::Float(1.0), Ipld::from(1.0f32));
assert_eq!(Ipld::Float(1.0), Ipld::from(1.0f64));
}
#[test]
fn test_ipld_string_from() {
assert_eq!(Ipld::String("a string".into()), Ipld::from("a string"));
assert_eq!(
Ipld::String("a string".into()),
Ipld::from("a string".to_string())
);
}
#[test]
fn test_ipld_bytes_from() {
assert_eq!(
Ipld::Bytes(vec![0, 1, 2, 3]),
Ipld::from(&[0u8, 1u8, 2u8, 3u8][..])
);
assert_eq!(
Ipld::Bytes(vec![0, 1, 2, 3]),
Ipld::from(vec![0u8, 1u8, 2u8, 3u8])
);
}
#[test]
fn test_ipld_link_from() {
let data = vec![0, 1, 2, 3];
let hash = Code::Blake3_256.digest(&data);
let cid = Cid::new_v0(hash).unwrap();
assert_eq!(Ipld::Link(cid), Ipld::from(cid));
}
#[test]
fn test_take() {
let ipld = Ipld::List(vec![Ipld::Integer(0), Ipld::Integer(1), Ipld::Integer(2)]);
assert_eq!(ipld.clone().take(0).unwrap(), Ipld::Integer(0));
assert_eq!(ipld.clone().take(1).unwrap(), Ipld::Integer(1));
assert_eq!(ipld.take(2).unwrap(), Ipld::Integer(2));
let mut map = BTreeMap::new();
map.insert("a".to_string(), Ipld::Integer(0));
map.insert("b".to_string(), Ipld::Integer(1));
map.insert("c".to_string(), Ipld::Integer(2));
let ipld = Ipld::Map(map);
assert_eq!(ipld.take("a").unwrap(), Ipld::Integer(0));
}
#[test]
fn test_get() {
let ipld = Ipld::List(vec![Ipld::Integer(0), Ipld::Integer(1), Ipld::Integer(2)]);
assert_eq!(ipld.get(0).unwrap(), &Ipld::Integer(0));
assert_eq!(ipld.get(1).unwrap(), &Ipld::Integer(1));
assert_eq!(ipld.get(2).unwrap(), &Ipld::Integer(2));
let mut map = BTreeMap::new();
map.insert("a".to_string(), Ipld::Integer(0));
map.insert("b".to_string(), Ipld::Integer(1));
map.insert("c".to_string(), Ipld::Integer(2));
let ipld = Ipld::Map(map);
assert_eq!(ipld.get("a").unwrap(), &Ipld::Integer(0));
}
}