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
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
extern crate std;
use core::{cmp, marker::PhantomData};
use crate::{HVec, HggEdge, HggHeader, HggNode, NodeStorage, StrategyLite, StrategyRegular};
use alloc::{format, vec, vec::Vec};
use header_vec::HeaderVec;
use serde::{
de::{self, Unexpected},
Deserialize, Deserializer, Serialize,
};
#[derive(Debug, Serialize)]
struct HggNodeSerialize<'a, K, V> {
key: &'a K,
value: &'a V,
/// Contains the edges of each layer of the graph on which this exists.
layers: Vec<Vec<usize>>,
/// Forms a linked list through the nodes that creates the freshening order.
next: usize,
}
#[derive(Debug, Deserialize)]
struct HggNodeDeserialize<K, V> {
key: K,
value: V,
/// Contains the edges of each layer of the graph on which this exists.
layers: Vec<Vec<usize>>,
/// Forms a linked list through the nodes that creates the freshening order.
next: usize,
}
impl<K, V> Serialize for NodeStorage<K, V, K, StrategyRegular>
where
K: Serialize,
V: Serialize,
{
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
S: serde::Serializer,
{
serializer.collect_seq(self.iter().map(|e| {
HggNodeSerialize {
key: &e.key,
value: &e.value,
layers: e
.layers
.iter()
.map(|edges| {
edges
.as_slice()
.iter()
.map(|edge| edge.neighbor.node)
.collect()
})
.collect(),
next: e.next,
}
}))
}
}
impl<'de, K, V> Deserialize<'de> for NodeStorage<K, V, K, StrategyRegular>
where
K: Deserialize<'de> + Clone,
V: Deserialize<'de>,
{
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
D: Deserializer<'de>,
{
let nodesd = Vec::<HggNodeDeserialize<K, V>>::deserialize(deserializer)?;
// Create all the HggNode, but do not populate the edges yet.
// Save the layers.
let mut nodes = vec![];
let mut nodes_layers = vec![];
for (
node,
HggNodeDeserialize {
key,
value,
layers,
next,
},
) in nodesd.into_iter().enumerate()
{
let empty_layers = layers
.iter()
.map(|layer| {
HeaderVec::with_capacity(
cmp::max(layer.len(), 1),
HggHeader {
key: key.clone(),
node,
},
)
})
.collect();
nodes.push(HggNode {
key,
value,
layers: empty_layers,
next,
});
nodes_layers.push(layers);
}
let node_data: Vec<(K, Vec<HVec<K>>)> = nodes
.iter()
.map(|node| {
(
node.key.clone(),
node.layers
.iter()
.map(|layer| HVec(unsafe { layer.weak() }))
.collect(),
)
})
.collect();
// Populate the edges on the nodes. If an index is out of bounds, we need to report an error.
for (node, layers) in nodes.iter_mut().zip(nodes_layers) {
for (layer, neighbors) in layers.into_iter().enumerate() {
for neighbor in neighbors {
// Get the key and weak refs for the target node.
let (key, neighbor_layers) = node_data.get(neighbor).ok_or_else(|| {
// If the index is pointing to an out-of-bounds neighbor, handle that.
de::Error::invalid_value(
Unexpected::Unsigned(neighbor as u64),
&format!("one of {} valid nodes", node_data.len()).as_str(),
)
})?;
// Get the weak ref for the target node.
let neighbor = neighbor_layers
.get(layer)
.ok_or_else(|| {
// If it didn't have the expected layer, there is an error.
de::Error::invalid_length(
layer,
&format!("one of target node's {} layers", neighbor_layers.len())
.as_str(),
)
})?
.weak();
// Add the edge.
node.layers[layer].push(HggEdge {
key: key.clone(),
neighbor,
});
}
}
}
Ok(NodeStorage(nodes, PhantomData))
}
}
impl<K, V> Serialize for NodeStorage<K, V, (), StrategyLite>
where
K: Serialize,
V: Serialize,
{
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
S: serde::Serializer,
{
serializer.collect_seq(self.iter().map(|e| {
HggNodeSerialize {
key: &e.key,
value: &e.value,
layers: e
.layers
.iter()
.map(|edges| {
edges
.as_slice()
.iter()
.map(|edge| edge.neighbor.node)
.collect()
})
.collect(),
next: e.next,
}
}))
}
}
impl<'de, K, V> Deserialize<'de> for NodeStorage<K, V, (), StrategyLite>
where
K: Deserialize<'de>,
V: Deserialize<'de>,
{
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
D: Deserializer<'de>,
{
let nodesd = Vec::<HggNodeDeserialize<K, V>>::deserialize(deserializer)?;
// Create all the HggNode, but do not populate the edges yet.
// Save the layers.
let mut nodes = vec![];
let mut nodes_layers = vec![];
for (
node,
HggNodeDeserialize {
key,
value,
layers,
next,
},
) in nodesd.into_iter().enumerate()
{
let empty_layers = layers
.iter()
.map(|layer| {
HeaderVec::with_capacity(cmp::max(layer.len(), 1), HggHeader { key: (), node })
})
.collect();
nodes.push(HggNode {
key,
value,
layers: empty_layers,
next,
});
nodes_layers.push(layers);
}
let node_data: Vec<Vec<HVec<()>>> = nodes
.iter()
.map(|node| {
node.layers
.iter()
.map(|layer| HVec(unsafe { layer.weak() }))
.collect()
})
.collect();
// Populate the edges on the nodes. If an index is out of bounds, we need to report an error.
for (node, layers) in nodes.iter_mut().zip(nodes_layers) {
for (layer, neighbors) in layers.into_iter().enumerate() {
for neighbor in neighbors {
// Get the key and weak refs for the target node.
let neighbor_layers = node_data.get(neighbor).ok_or_else(|| {
// If the index is pointing to an out-of-bounds neighbor, handle that.
de::Error::invalid_value(
Unexpected::Unsigned(neighbor as u64),
&format!("one of {} valid nodes", node_data.len()).as_str(),
)
})?;
// Get the weak ref for the target node.
let neighbor = neighbor_layers
.get(layer)
.ok_or_else(|| {
// If it didn't have the expected layer, there is an error.
de::Error::invalid_length(
layer,
&format!("one of target node's {} layers", neighbor_layers.len())
.as_str(),
)
})?
.weak();
// Add the edge.
node.layers[layer].push(HggEdge { key: (), neighbor });
}
}
}
Ok(NodeStorage(nodes, PhantomData))
}
}