#bitmap #bitvec #vec #heap-allocation

smallbitvec

A bit vector optimized for size and inline storage

19 stable releases

2.5.3 Mar 17, 2024
2.5.1 Aug 5, 2021
2.5.0 May 8, 2020
2.4.0 May 15, 2019
1.0.7 Sep 27, 2017

#57 in Data structures

Download history 8039/week @ 2023-12-07 9002/week @ 2023-12-14 6534/week @ 2023-12-21 6560/week @ 2023-12-28 9650/week @ 2024-01-04 9352/week @ 2024-01-11 11403/week @ 2024-01-18 12301/week @ 2024-01-25 14438/week @ 2024-02-01 11180/week @ 2024-02-08 11049/week @ 2024-02-15 11445/week @ 2024-02-22 11034/week @ 2024-02-29 11696/week @ 2024-03-07 13329/week @ 2024-03-14 10702/week @ 2024-03-21

48,818 downloads per month
Used in 10 crates (7 directly)

MIT/Apache

42KB
1K SLoC

smallbitvec

A bit vector that is the size of a pointer, and can store data either inline or on the heap. Like the bit-vec crate but optimized for small inline size and reduced allocations.


lib.rs:

SmallBitVec is a bit vector, a vector of single-bit values stored compactly in memory.

SmallBitVec grows dynamically, like the standard Vec<T> type. It can hold up to about one word of bits inline (without a separate heap allocation). If the number of bits exceeds this inline capacity, it will allocate a buffer on the heap.

Example

use smallbitvec::SmallBitVec;

let mut v = SmallBitVec::new();
v.push(true);
v.push(false);

assert_eq!(v[0], true);
assert_eq!(v[1], false);

No runtime deps