iptrie 0.11.1

IPv4/v6 prefixes lookup structures (based on tries)
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

#![feature(test)]
extern crate test;

use ip_network_table_deps_treebitmap::IpLookupTable;
use iptrie::set::RTrieSet;
use iptrie::{IpPrefix, Ipv4Prefix, Ipv6Prefix};
use std::fs::File;
use std::io::{BufRead, BufReader};
use std::net::{Ipv4Addr, Ipv6Addr};
use std::str::FromStr;

fn read_ip<P: FromStr>() -> impl Iterator<Item = P> {
    let file = File::open("benches/bgpas.lpm").expect("can’t open LPM file");
    BufReader::new(file)
        .lines()
        .map_while(Result::ok)
        .filter_map(|l| {
            let prefix = l.split(' ').next().expect("bad formatted file");
            prefix.parse::<P>().ok()
        })
}

fn main() {
    let ip = read_ip::<Ipv4Prefix>();
    let trie = RTrieSet::from_iter(ip);
    trie.info();
    let trie = trie.compress();
    trie.info();

    let trie = read_ip::<Ipv4Prefix>().fold(IpLookupTable::<Ipv4Addr, ()>::new(), |mut trie, p| {
        trie.insert(p.network(), p.len() as u32, ());
        trie
    });
    let (a, b) = trie.mem_usage();
    println!(
        "treebitmap: {}k + {}k = {}k",
        a / 1000,
        b / 1000,
        a / 1000 + b / 1000
    );

    let ip = read_ip::<Ipv6Prefix>();
    let trie = RTrieSet::from_iter(ip);
    trie.info();
    let trie = trie.compress();
    trie.info();

    let trie = read_ip::<Ipv6Prefix>().fold(IpLookupTable::<Ipv6Addr, ()>::new(), |mut trie, p| {
        trie.insert(p.network(), p.len() as u32, ());
        trie
    });
    let (a, b) = trie.mem_usage();
    println!(
        "treebitmap: {}k + {}k = {}k",
        a / 1000,
        b / 1000,
        a / 1000 + b / 1000
    );
}