Struct hi_sparse_bitset::DataBlock

pub struct DataBlock<Block> {
    pub start_index: usize,
    pub bit_block: Block,
}

Fields

start_index: usize

bit_block: Block

Implementations

impl<Block: BitBlock> DataBlock<Block>

pub fn traverse<F>(&self, f: F) -> ControlFlow<()>

where F: FnMut(usize) -> ControlFlow<()>,

traverse approx. 15% faster then iterator

pub fn iter(&self) -> DataBlockIter<Block>

pub fn len(&self) -> usize

Calculate elements count in DataBlock.

On most platforms, this should be faster then manually traversing DataBlock and counting elements. It use hardware supported popcnt operations, whenever possible.

pub fn is_empty(&self) -> bool

Trait Implementations

impl<Block: Clone> Clone for DataBlock<Block>

fn clone(&self) -> DataBlock<Block>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Block: Debug> Debug for DataBlock<Block>

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

Formats the value using the given formatter.

impl<Block: BitBlock> IntoIterator for DataBlock<Block>

fn into_iter(self) -> Self::IntoIter

This is actually no-op fast.

type Item = usize

The type of the elements being iterated over.

type IntoIter = DataBlockIter<Block>

Which kind of iterator are we turning this into?