bitvek 0.3.5

A simple bit vector implementation.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35

# bitvek

[![Crates.io](https://img.shields.io/crates/v/bitvek.svg)](https://crates.io/crates/bitvek)
[![Documentation](https://docs.rs/bitvek/badge.svg)](https://docs.rs/bitvek)
[![License](https://img.shields.io/badge/License-MIT-blue.svg)](https://opensource.org/licenses/MIT)

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?

## Quick Start

```rust
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:

```rust
// requires the total number of bits to be a multiple of 8
let vec = bitvec![0b11110000, 0b00001111];
```

## Memory Efficiency

To achieve memory savings, the total number of bits stored must exceed twice the machine word size in bytes, corresponding to 8 for 32-bit systems and 16 for 64-bit systems.