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
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

use crate::{Error, List, Vector};
use tree_hash::Hash256;
use typenum::{U64, Unsigned};

#[test]
fn hash256_vec_iter() {
    type N = U64;
    let n = N::to_u64();
    let vec = (0..n)
        .map(|n| Hash256::right_padding_from(&n.to_le_bytes()))
        .collect::<Vec<_>>();
    let vector = Vector::<Hash256, N>::new(vec.clone()).unwrap();

    assert_eq!(vector.iter().cloned().collect::<Vec<_>>(), vec);
}

#[test]
fn hash256_list_iter() {
    type N = U64;
    let n = N::to_u64();
    let vec = (0..n)
        .map(|n| Hash256::right_padding_from(&n.to_le_bytes()))
        .collect::<Vec<_>>();
    let list = List::<Hash256, N>::new(vec.clone()).unwrap();

    assert_eq!(list.iter().cloned().collect::<Vec<_>>(), vec);
}

#[test]
fn hash256_list_iter_from() {
    type N = U64;
    let n = N::to_usize();
    let vec = (0..n as u64)
        .map(|n| Hash256::right_padding_from(&n.to_le_bytes()))
        .collect::<Vec<_>>();
    let list = List::<Hash256, N>::new(vec.clone()).unwrap();

    for i in 0..=n {
        assert_eq!(
            list.iter_from(i).unwrap().cloned().collect::<Vec<_>>(),
            &vec[i..]
        );
    }

    assert_eq!(
        list.iter_from(n + 1).unwrap_err(),
        Error::OutOfBoundsIterFrom {
            index: n + 1,
            len: n
        }
    );
}

#[test]
fn hash256_vector_iter_from() {
    type N = U64;
    let n = N::to_usize();
    let vec = (0..n as u64)
        .map(|n| Hash256::right_padding_from(&n.to_le_bytes()))
        .collect::<Vec<_>>();
    let vect = Vector::<Hash256, N>::new(vec.clone()).unwrap();

    for i in 0..=n {
        assert_eq!(
            vect.iter_from(i).unwrap().cloned().collect::<Vec<_>>(),
            &vec[i..]
        );
    }

    assert_eq!(
        vect.iter_from(n + 1).unwrap_err(),
        Error::OutOfBoundsIterFrom {
            index: n + 1,
            len: n
        }
    );
}