Module rank 

RankedBits efficiently handles rank queries on bit vectors. Optimized for minimal memory usage with ~3.125% overhead and fast lookups, it supports the crate’s focus on low-latency hash maps. For detailed methodology, refer to the related paper: Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors.

Structs

L12Rank

L12Rank represents l1 and l2 bit ranks stored inside 16 bytes (little endian). NB: it’s important to use [u8; 16] instead of u128 for rkyv versions 0.7.X because of alignment differences between x86_64 and aarch64 architectures. See https://github.com/rkyv/rkyv/issues/409 for more details.

RankedBits

Traits

L12RankAccess

Trait used to access archived and non-archived L1 and L2 ranks

RankedBitsAccess

Trait for efficient bit-level operations on ranked bit sequences.