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

use crate::component::sort_key::EvictKey;
use ckb_types::core::{Capacity, FeeRate};

#[test]
fn test_min_fee_and_weight_evict() {
    let mut result = vec![(500, 10, 30), (10, 10, 31), (100, 10, 32)]
        .into_iter()
        .map(|(fee, weight, timestamp)| EvictKey {
            fee_rate: FeeRate::calculate(Capacity::shannons(fee), weight),
            timestamp,
            descendants_count: 0,
        })
        .collect::<Vec<_>>();
    result.sort();
    assert_eq!(
        result.iter().map(|key| key.timestamp).collect::<Vec<_>>(),
        vec![31, 32, 30]
    );
}

#[test]
fn test_min_timestamp_evict() {
    let mut result = vec![(500, 10, 30), (500, 10, 31), (500, 10, 32)]
        .into_iter()
        .map(|(fee, weight, timestamp)| EvictKey {
            fee_rate: FeeRate::calculate(Capacity::shannons(fee), weight),
            timestamp,
            descendants_count: 0,
        })
        .collect::<Vec<_>>();
    result.sort();
    assert_eq!(
        result.iter().map(|key| key.timestamp).collect::<Vec<_>>(),
        vec![30, 31, 32]
    );
}

#[test]
fn test_min_weight_evict() {
    let mut result = vec![(500, 10, 30), (500, 12, 31), (500, 13, 32)]
        .into_iter()
        .map(|(fee, weight, timestamp)| EvictKey {
            fee_rate: FeeRate::calculate(Capacity::shannons(fee), weight),
            timestamp,
            descendants_count: 0,
        })
        .collect::<Vec<_>>();
    result.sort();
    assert_eq!(
        result.iter().map(|key| key.timestamp).collect::<Vec<_>>(),
        vec![32, 31, 30]
    );
}