ckb-tx-pool 1.2.2

CKB Tx-pool stores transactions, which is designed for CKB Two Step Transaction Confirmation mechanism
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

use crate::component::orphan::OrphanPool;
use crate::component::tests::util::build_tx;
use ckb_types::packed::Byte32;

#[test]
fn test_orphan() {
    let tx1 = build_tx(vec![(&Byte32::zero(), 1), (&Byte32::zero(), 2)], 1);
    let mut orphan = OrphanPool::new();
    assert_eq!(orphan.len(), 0);
    assert!(!orphan.contains_key(&tx1.proposal_short_id()));

    orphan.add_orphan_tx(tx1.clone(), 0.into(), 0);
    assert_eq!(orphan.len(), 1);

    orphan.add_orphan_tx(tx1.clone(), 0.into(), 0);
    assert_eq!(orphan.len(), 1);

    let tx2 = build_tx(vec![(&tx1.hash(), 0)], 1);
    orphan.add_orphan_tx(tx2.clone(), 0.into(), 0);
    assert_eq!(orphan.len(), 2);

    orphan.remove_orphan_tx(&tx1.proposal_short_id());
    assert_eq!(orphan.len(), 1);
    orphan.remove_orphan_tx(&tx2.proposal_short_id());
    assert_eq!(orphan.len(), 0);
}

#[test]
fn test_orphan_allows_double_spends_of_unknown_input() {
    let parent = build_tx(vec![(&Byte32::zero(), 1)], 1);
    let parent_hash = parent.hash();
    let tx1 = build_tx(vec![(&parent_hash, 0)], 1);
    let tx2 = build_tx(vec![(&parent_hash, 0)], 2);
    let mut orphan = OrphanPool::new();

    orphan.add_orphan_tx(tx1.clone(), 0.into(), 0);
    orphan.add_orphan_tx(tx2.clone(), 0.into(), 0);

    assert_eq!(orphan.len(), 2);
    let txs = orphan.find_by_previous(&parent);
    assert_eq!(txs.len(), 2);
    assert!(txs.contains(&&tx1.proposal_short_id()));
    assert!(txs.contains(&&tx2.proposal_short_id()));
}

#[test]
fn test_orphan_duplicated() {
    let tx1 = build_tx(vec![(&Byte32::zero(), 1), (&Byte32::zero(), 2)], 3);
    let mut orphan = OrphanPool::new();

    let tx2 = build_tx(vec![(&tx1.hash(), 0)], 1);
    let tx3 = build_tx(vec![(&tx2.hash(), 0)], 1);
    let tx4 = build_tx(vec![(&tx3.hash(), 0), (&tx1.hash(), 1)], 1);
    let tx5 = build_tx(vec![(&tx1.hash(), 0)], 2);
    orphan.add_orphan_tx(tx1.clone(), 0.into(), 0);
    orphan.add_orphan_tx(tx2.clone(), 0.into(), 0);
    orphan.add_orphan_tx(tx3, 0.into(), 0);
    orphan.add_orphan_tx(tx4.clone(), 0.into(), 0);
    orphan.add_orphan_tx(tx5.clone(), 0.into(), 0);
    assert_eq!(orphan.len(), 5);

    let txs = orphan.find_by_previous(&tx2);
    assert_eq!(txs.len(), 1);

    let txs = orphan.find_by_previous(&tx1);
    assert_eq!(txs.len(), 3);
    assert!(txs.contains(&&tx2.proposal_short_id()));
    assert!(txs.contains(&&tx4.proposal_short_id()));
    assert!(txs.contains(&&tx5.proposal_short_id()));

    orphan.remove_orphan_tx(&tx4.proposal_short_id());
    let txs = orphan.find_by_previous(&tx1);
    assert_eq!(txs.len(), 2);
    assert!(txs.contains(&&tx2.proposal_short_id()));
    assert!(txs.contains(&&tx5.proposal_short_id()));
}