#bloom-filter #bloom #filter

nightly bloomy-rs

Fast bloom filter implementation

1 unstable release

0.1.0 Jul 29, 2023

#2565 in Data structures

MIT license

8KB
178 lines

bloomy-rs

Fast bloom filter implementation.

Stack-based alternative of fastbloom-rs.

Benchmarks

bloomy fastbloom
insert 16.58 ms (✅ 1.00x) 19.97 ms (❌ 1.20x slower)
contains_existing 14.49 ms (✅ 1.00x) 19.19 ms (❌ 1.32x slower)
contains_non_existing 152.97 us (✅ 1.00x) 206.73 us (❌ 1.35x slower)

Made with criterion-table

Dependencies

~0.7–1MB
~14K SLoC