v0.4.0
Full Changelog: v0.3.0...v0.4.0
What's new in v0.4.0
Bloom filter:
- Automatic parameter derivation from capacity and false_positive_rate
- Double hashing (Kirsch-Mitzenmacher) for k bit positions from one hash
- BLM1 binary format (40-byte header + packed bitset)
- Merge via bitwise OR
- Capacity overflow validation for the u32 binary format constraints
- 40 unit tests, 5 property tests, 2 statistical FPR validation tests
| Algorithm | What it does |
|---|---|
| HyperLogLog (HLL) | Count distinct elements (~0.8% error, 16 KB) |
| Count-Min Sketch (CMS) | Estimate item frequencies |
| Theta Sketch | Set union/intersection cardinality |
| KLL | Rank-accurate quantiles (median, P99) |
| DDSketch | Value-relative quantiles (P99 latency +/- 1%) |
| FrequentItems | Top-k most frequent items (SpaceSaving) |
| Bloom Filter | "Have I seen this before?" with tunable FPR |