tower120/hi_sparse_bitset

A better compressed bitset in Rust

Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.

Compact sets in rust

A pure-Rust two-level dynamic b-tree. This crate implements a compact set data structure that preserves its elements' sorted order and allows lookups of entries by value or sorted order position.

Collection of succinct data structures in Rust

A fast Bloom filter implementation in Rust

Simple probabilistic data structures

Succinct data structures using very efficient rank and select

Simple dense bitmap index in Go with binary operators