Data Structures
bitvec
’s primary exports are four data structures: BitSlice
, BitArray
,
BitBox
, and BitVec
. These correspond to the [bool]
,
[bool; N]
, Box<[bool]>
, and Vec<bool>
types in the
Rust standard libraries. Unlike the Rust types, the bitvec
types are not
composable, and cannot be mixed with any other types, including pointers in the
standard library.
The bitvec
types implement the APIs of their standard-library counterparts to
the fullest extent possible. The only missing feature is currently
IndexMut<usize>
, preventing collection[index] = bit;
assignment. This means
that, for users looking for compact usize => bool
collections, substituting
types in your project codebase ought to be enough to make your project Just
Work™️.
It is the fact that BitSlice
acts exactly like [bool]
, and can only be used
through &BitSlice
and &mut BitSlice
references, that makes bitvec
unique.
No other Rust library has this capability.
Before we explore the data structures in more detail, there are three caveats I must provide:
-
bitvec
uses an opaque, custom, pointer representation for everything exceptBitArray
. You may not inspect or modify this pointer. You may not use it as a type or value parameter in any other types or functions. You will break your program if you try.bitvec
ensures that this pointer encoding does not fail the compiler and language requirements for reference correctness. The rules used to do so are internal to the crate, and will not be present outside it.bitvec
pointers are perfectly safe to use, as long as you treat them as completely opaque and use only the interfaces provided. -
These structures all have two type parameters,
<T: BitStore, O: BitOrder>
. These parameters are described in the next chapter. They govern the in-memory representation of data storage, but are not relevant to the general use of the handle types. -
bitvec
trades an increased memory space efficiency for decreased instruction size and speed efficiency. The compiler may optimize some of the costs away, butbitvec
structures are not free to use. The “zero-cost” of thebitvec
abstraction is that you cannot write a better bitset, and not that it is equal in runtime performance to an ordinarybool
sequence.
Now that the disclaimers are over, we can talk about how the types actually work.