Crates.io | bitvek |
lib.rs | bitvek |
version | 0.2.3 |
source | src |
created_at | 2024-07-02 23:29:16.856039 |
updated_at | 2024-10-26 15:56:39.758911 |
description | A simple bit vector implementation. |
homepage | |
repository | https://github.com/Lingxuan-Ye/bitvek |
max_upload_size | |
id | 1290018 |
size | 26,467 |
Say, we have a bit vector —
it's nothing better than a Vec<bool>
, but …
what if we implement it,
and save some poor bits of memory?
The following vector only takes two bytes of the heap memory!
use bitvek::bitvec;
let vec = bitvec![
true, true, true, true, false, false, false, false,
false, false, false, false, true, true, true, true,
];
Find it cumbersome? Try this:
// requires the total number of bits to be a multiple of 8
let vec = bitvec![0b1111_0000, 0b0000_1111];