Struct SimpleBitArray

struct SimpleBitArray<const N: usize> {
    inner: [usize; N],
}

Simple packed bit array implementation

This could use the bitvec crate if we cared to depend on it, but the functionality we need is so tiny let’s keep this simple.

Fields

inner: [usize; N]

Array of words to use as a bit vector, in LSB-first order

Implementations

impl<const N: usize> SimpleBitArray<N>

fn set(&mut self, index: usize, value: bool)

Set or clear one bit in the array.

Panics if the index is out of range.

fn get(&self, index: usize) -> bool

Get one bit from the array.

Panics if the index is out of range.

Trait Implementations

impl<const N: usize> Clone for SimpleBitArray<N>

fn clone(&self) -> SimpleBitArray<N>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<const N: usize> Debug for SimpleBitArray<N>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<const N: usize> Default for SimpleBitArray<N>

fn default() -> Self

Returns the “default value” for a type.

impl<const N: usize> PartialEq for SimpleBitArray<N>

fn eq(&self, other: &SimpleBitArray<N>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<const N: usize> Eq for SimpleBitArray<N>

impl<const N: usize> StructuralPartialEq for SimpleBitArray<N>