roaring-rs

Uses a hybrid array and bitset approach to significantly reduce memory usage while maintaining fast access, as per the original Roaring bitmap design described in the paper.

Optimized algorithms for union, intersection, difference, and symmetric difference, making it ideal for data-intensive applications like databases and search engines, with benchmarking on real-world datasets.

Faithfully replicates the Java/C specifications, ensuring seamless interoperability with existing Roaring bitmap implementations in other languages for projects requiring portability.

Includes dedicated benchmarking tools using real-world datasets to validate performance improvements, providing credible evidence of efficiency gains in practical scenarios.

Offers optional SIMD acceleration via Rust nightly for potential performance gains on supported hardware, though it's in active development and not fully tested.