matchy 2.0.1

Fast database for IP address and pattern matching with rich data storage
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

//! Benchmark for parallel hash table building
//!
//! This example demonstrates the performance of parallel sharded hash table construction
//! compared to a single-threaded build.

use matchy::MatchMode;
use matchy_literal_hash::LiteralHashBuilder;
use std::time::Instant;

fn main() {
    // Test with different sizes
    for size in [1_000, 10_000, 100_000, 1_000_000] {
        println!("\n=== Building hash table with {size} patterns ===");

        let mut builder = LiteralHashBuilder::new(MatchMode::CaseSensitive);
        for i in 0..size {
            let pattern = format!("pattern_{i}_test");
            builder.add_pattern(&pattern, i);
        }

        let pattern_data: Vec<_> = (0..size).map(|i| (i, i * 100)).collect();

        let start = Instant::now();
        let bytes = builder.build(&pattern_data).expect("Build failed");
        let elapsed = start.elapsed();

        println!("  Build time: {elapsed:?}");
        println!("  Database size: {} MB", bytes.len() / 1_048_576);
        println!(
            "  Throughput: {:.0} patterns/sec",
            f64::from(size) / elapsed.as_secs_f64()
        );
    }
}