bitset

A crate for managing memory bit by bit

A better compressed bitset in Rust

in memory Rust database to query your data like a Venn diagram

Hierarchical bit set container

A library for compact bit sets containing enums.

Zero-cost bitsets over native Rust types

Hierarchical sparse bitset

A compressed bitmap format optimized for small, sparse sets of u32s with zero-copy querying.

bitset implementation with support for atomic operations

A hierarchical growable bitset which supports in-place atomic operations

Iterate over bits in Rust

Fixed BitSet not limited to usize; intended as a replacement for HashSet

A simple to use Rust bitset crate. Includes built-in bitset types and a trait for defining your own.

Simple no-std compatible 64-bit and 128-bit bitsets for embedded applications.

Roaring Bitmaps are a Highly Optimised, Hybrid Data Structure used to Store Sets of Integers. They are Designed to be Much More Memory-Efficient than Standard Bitsets while Remaining Significantly Faster than Other Compressed Formats (like WAH or Concise)

Rust Boggle Solver

Vector with fixed bit sized values stored in long

Entropy-aware containers for Roaring bitmaps: near-Shannon-H0 space in the dense-irregular regime where Roaring spends a flat 8 KiB, never larger than Roaring, with a faster select. Pure Rust, zero deps, no unsafe.

A lightweight set implementation for consecutive natural numbers

WebAssembly prototype of SigPlot's BitArray