Struct SparseBitVector 

pub struct SparseBitVector { /* private fields */ }

A bit vector of length 2^log_len, stored as the indices of its set bits.

Invariant: indices is sorted and holds no repeats.

Implementations

impl SparseBitVector

pub fn new(log_len: usize, indices: Vec<u64>) -> Self

Sorts the indices and cancels repeated pairs, since a bit set twice is clear.

Preconditions

• log_len must be less than 64
• every index must be less than 2^log_len

pub const fn log_len(&self) -> usize

Returns the base-2 logarithm of the vector’s length.

pub fn indices(&self) -> &[u64]

Returns the sorted indices of the set bits.

Trait Implementations

impl Clone for SparseBitVector

fn clone(&self) -> SparseBitVector

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SparseBitVector

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

Formats the value using the given formatter.

impl Eq for SparseBitVector

impl PartialEq for SparseBitVector

fn eq(&self, other: &SparseBitVector) -> 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 StructuralPartialEq for SparseBitVector