zakura-state 11.0.0

State contextual verification and storage code for the Zakura node. Internal crate, published to support cargo install zakura
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

use super::*;
use std::collections::HashMap;
use zakura_chain::{block::Height, transaction, transparent};

fn key(id: u32) -> OutPoint {
    let mut hash = [0; 32];
    hash[..4].copy_from_slice(&id.to_le_bytes());
    OutPoint {
        hash: transaction::Hash(hash),
        index: id % 3,
    }
}

fn value(id: u32) -> Arc<OrderedUtxo> {
    Arc::new(OrderedUtxo::new(
        transparent::Output {
            value: u64::from(id).try_into().unwrap(),
            lock_script: transparent::Script::new(&[]),
        },
        Height(1),
        0,
    ))
}

#[test]
fn snapshots_share_output_payloads_and_keep_replacements_independent() {
    let mut index = CreatedUtxos::default();
    let original = value(0);
    index.insert(key(0), original.clone());
    let snapshot = index.clone();
    assert!(Arc::ptr_eq(
        index.get(&key(0)).unwrap(),
        snapshot.get(&key(0)).unwrap()
    ));

    let replacement = value(1);
    let previous = index.insert(key(0), replacement.clone()).unwrap();
    assert!(Arc::ptr_eq(&previous, &original));
    assert!(Arc::ptr_eq(snapshot.get(&key(0)).unwrap(), &original));
    assert!(Arc::ptr_eq(index.get(&key(0)).unwrap(), &replacement));
    assert_eq!(snapshot.get(&key(0)), Some(&value(0)));
    assert_eq!(index.get(&key(0)), Some(&value(1)));
    assert_eq!(index.len(), 1);
}

#[test]
fn mutations_and_retained_snapshots_match_independent_maps() {
    let mut index = CreatedUtxos::default();
    let mut expected = HashMap::new();
    let mut readers = Vec::new();
    for step in 0..3000 {
        if step % 100 == 0 {
            readers.push((index.clone(), expected.clone()));
        }
        let key = key(step % 271);
        if step % 5 == 0 {
            assert_eq!(index.remove(&key), expected.remove(&key));
        } else {
            assert_eq!(
                index.insert(key, value(step)),
                expected.insert(key, value(step))
            );
        }
        assert_eq!(index.len(), expected.len());
        assert_eq!(
            index
                .iter()
                .map(|(k, v)| (*k, v.clone()))
                .collect::<HashMap<_, _>>(),
            expected
        );
        for (reader, expected_reader) in &readers {
            assert_eq!(reader.len(), expected_reader.len());
            for (key, value) in expected_reader {
                assert_eq!(reader.get(key), Some(value));
            }
        }
    }
    // Equality is by contents, even with independently randomized partition placement.
    let mut rebuilt = CreatedUtxos::default();
    for (key, value) in &expected {
        rebuilt.insert(*key, value.clone());
    }
    assert_eq!(index, rebuilt);
    for (key, value) in expected {
        assert_eq!(index.remove(&key), Some(value));
    }
    assert_eq!(index.len(), 0);
    assert_eq!(index.iter().count(), 0);
    assert_ne!(index, rebuilt);
}