Struct DataBlock

pub struct DataBlock<Block> { /* private fields */ }

Traversable bit block with offset.

Implementations

impl<Block: BitBlock> DataBlock<Block>

pub fn new(start_index: usize, bit_block: Block) -> DataBlock<Block>

Panics

Panics if start_index does not match Block align.

pub unsafe fn new_unchecked( start_index: usize, bit_block: Block, ) -> DataBlock<Block>

Safety

start_index must match Block align.

pub fn into_parts(self) -> (usize, Block)

Destruct DataBlock into (start_index, bit_block).

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

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

traverse approx. 15% faster then iterator

pub fn for_each<F>(&self, f: F)

where F: FnMut(usize),

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 accelerated “popcnt”, whenever possible.

pub fn is_empty(&self) -> bool

Trait Implementations

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

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

Returns a duplicate 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<'de, Block> Deserialize<'de> for DataBlock<Block>

where Block: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<Conf: Config> Extend<DataBlock<<Conf as Config>::DataBitBlock>> for BitSet<Conf>

fn extend<T: IntoIterator<Item = DataBlock<Conf::DataBitBlock>>>( &mut self, iter: T, )

It is allowed for blocks with the same range to repeat in iterator. Like ([1,42], [15,27,61]). Their data will be merged.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<Conf: Config> From<&DataBlock<<Conf as Config>::DataBitBlock>> for BlockCursor<Conf>

fn from(block: &DataBlock<Conf::DataBitBlock>) -> Self

Build cursor that points to the block.

impl<Conf: Config> From<&DataBlock<<Conf as Config>::DataBitBlock>> for IndexCursor<Conf>

fn from(block: &DataBlock<Conf::DataBitBlock>) -> Self

Build cursor that points to the block start index.

impl<Conf: Config> FromIterator<DataBlock<<Conf as Config>::DataBitBlock>> for BitSet<Conf>

fn from_iter<T: IntoIterator<Item = DataBlock<Conf::DataBitBlock>>>( iter: T, ) -> Self

It is allowed for blocks with the same range to repeat in iterator. Like ([1,42], [15,27,61]). Their data will be merged.

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?

impl<Block: PartialEq> PartialEq for DataBlock<Block>

fn eq(&self, other: &DataBlock<Block>) -> 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<Block> Serialize for DataBlock<Block>

where Block: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<Block: Eq> Eq for DataBlock<Block>

impl<Block> StructuralPartialEq for DataBlock<Block>