milhouse 0.9.0

Persistent binary merkle tree
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

use crate::{List, Value, Vector};
use context_deserialize::ContextDeserialize;
use serde::de::Deserializer;
use typenum::Unsigned;

impl<'de, C, T, N> ContextDeserialize<'de, C> for List<T, N>
where
    T: ContextDeserialize<'de, C> + Value,
    N: Unsigned,
    C: Clone,
{
    fn context_deserialize<D>(deserializer: D, context: C) -> Result<Self, D::Error>
    where
        D: Deserializer<'de>,
    {
        // First deserialize as a Vec.
        // This is not the most efficient implementation as it allocates a temporary Vec. In future
        // we could write a more performant implementation using `List::builder()`.
        let vec = Vec::<T>::context_deserialize(deserializer, context)?;

        // Then convert to List, which will check the length.
        List::new(vec)
            .map_err(|e| serde::de::Error::custom(format!("Failed to create List: {:?}", e)))
    }
}

impl<'de, C, T, N> ContextDeserialize<'de, C> for Vector<T, N>
where
    T: ContextDeserialize<'de, C> + Value,
    N: Unsigned,
    C: Clone,
{
    fn context_deserialize<D>(deserializer: D, context: C) -> Result<Self, D::Error>
    where
        D: Deserializer<'de>,
    {
        // First deserialize as a List
        let list = List::<T, N>::context_deserialize(deserializer, context)?;

        // Then convert to Vector, which will check the length
        Vector::try_from(list).map_err(|e| {
            serde::de::Error::custom(format!("Failed to convert List to Vector: {:?}", e))
        })
    }
}