routemap 0.1.4

Fast in-memory IP prefix routing tables for IPv4 and IPv6. Longest Prefix Match via stride-4 treebitmap, built on ipnetx.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

#[derive(Clone)]
pub(crate) struct TbNode<V> {
    /// Bits 1–15: which internal prefix positions are occupied (stride-4 binary heap).
    pub(crate) internal: u32,
    /// Bits 0–15: which child nodes exist (one bit per possible nibble value).
    pub(crate) external: u32,
    /// Compact value store — length equals internal.count_ones().
    pub(crate) values: Vec<V>,
    /// Compact child store — length equals external.count_ones().
    pub(crate) children: Vec<TbNode<V>>,
}

impl<V> TbNode<V> {
    pub(crate) fn new() -> Self {
        Self {
            internal: 0,
            external: 0,
            values: Vec::new(),
            children: Vec::new(),
        }
    }
}