🎯 Pithanos

⚡ Fast, lock-free probabilistic data structures for modern Rust. Includes Bloom Filter and Count-Min Sketch implementations optimized for speed and concurrency.

✨ Features

📦 Installation

Add this to your Cargo.toml:

[dependencies]
pithanos = "0.1"

🚀 Quick Start

Bloom Filter

use pithanos::bloom::BloomFilter;

fn main() {
    let filter = BloomFilter::new(1000, 3); // 1000 bits, 3 hash functions

    filter.insert(&"foo");
    filter.insert(&"bar");

    assert!(filter.contains(&"foo"));
    assert!(!filter.contains(&"bar"));
}

Count-Min Sketch

use pithanos::cms::CountMinSketch;

fn main() {
    let cms = CountMinSketch::new(1000, 3); // wdith 100, depth 3

    cms.increment(&"foo", 3);
    cms.increment(&"bar", 1);

    println!("Frequency of 'foo': {}", cms.frequency(&"foo"));
    println!("Frequency of 'bar': {}", cms.frequency(&"bar"));
}

🧪 Benchmarks

Pithanos uses criterion for micro-benchmarks.

Run all benchmarks with cargo bench

💬 Acknowledgments

Pithanos (πιθανός) — Ancient Greek: “likely,” “probable,” or “plausible.”

Inspired by RedisBloom