brk_mempool 0.2.3

Bitcoin mempool monitor with fee estimation
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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106

use std::ops::{Index, IndexMut};

use brk_types::TxidPrefix;
use rustc_hash::FxHashMap;

use super::tx_node::TxNode;
use crate::{
    entry::Entry,
    types::{PoolIndex, TxIndex},
};

/// Type-safe wrapper around Vec<TxNode> that only allows PoolIndex access.
pub struct Graph(Vec<TxNode>);

impl Graph {
    #[inline]
    pub fn len(&self) -> usize {
        self.0.len()
    }

    #[inline]
    pub fn is_empty(&self) -> bool {
        self.0.is_empty()
    }
}

impl Index<PoolIndex> for Graph {
    type Output = TxNode;

    #[inline]
    fn index(&self, idx: PoolIndex) -> &Self::Output {
        &self.0[idx.as_usize()]
    }
}

impl IndexMut<PoolIndex> for Graph {
    #[inline]
    fn index_mut(&mut self, idx: PoolIndex) -> &mut Self::Output {
        &mut self.0[idx.as_usize()]
    }
}

/// Build a dependency graph from mempool entries.
pub fn build_graph(entries: &[Option<Entry>]) -> Graph {
    // Collect live entries with their indices
    let live: Vec<(TxIndex, &Entry)> = entries
        .iter()
        .enumerate()
        .filter_map(|(i, opt)| opt.as_ref().map(|e| (TxIndex::from(i), e)))
        .collect();

    if live.is_empty() {
        return Graph(Vec::new());
    }

    // Map TxidPrefix -> PoolIndex for parent lookups
    let prefix_to_pool: FxHashMap<TxidPrefix, PoolIndex> = live
        .iter()
        .enumerate()
        .map(|(i, (_, entry))| (entry.txid_prefix(), PoolIndex::from(i)))
        .collect();

    // Build nodes with parent relationships
    let mut nodes: Vec<TxNode> = live
        .iter()
        .enumerate()
        .map(|(pool_idx, (tx_index, entry))| {
            let pool_index = PoolIndex::from(pool_idx);
            let mut node = TxNode::new(
                *tx_index,
                pool_index,
                entry.fee,
                entry.vsize,
                entry.ancestor_fee,
                entry.ancestor_vsize,
            );

            // Add in-mempool parents
            for parent_prefix in &entry.depends {
                if let Some(&parent_pool_idx) = prefix_to_pool.get(parent_prefix) {
                    node.parents.push(parent_pool_idx);
                }
            }

            node
        })
        .collect();

    // Collect parent->child edges (avoids cloning each node's parents)
    let edges: Vec<(usize, PoolIndex)> = nodes
        .iter()
        .enumerate()
        .flat_map(|(i, node)| {
            node.parents
                .iter()
                .map(move |&p| (p.as_usize(), PoolIndex::from(i)))
        })
        .collect();

    // Build child relationships
    for (parent_idx, child_idx) in edges {
        nodes[parent_idx].children.push(child_idx);
    }

    Graph(nodes)
}