Struct hibitset::BitProducer

source ·
pub struct BitProducer<'a, T: 'a + Send + Sync>(pub BitIter<&'a T>, pub u8);
Expand description

Allows splitting and internally iterating through BitSet.

Usually used internally by BitParIter.

Tuple Fields§

§0: BitIter<&'a T>§1: u8

Trait Implementations§

source§

impl<'a, T: Debug + 'a + Send + Sync> Debug for BitProducer<'a, T>

source§

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

Formats the value using the given formatter. Read more
source§

impl<'a, T> UnindexedProducer for BitProducer<'a, T>
where T: BitSetLike + 'a + Send + Sync,

source§

fn split(self) -> (Self, Option<Self>)

How the splitting is done:

  1. First the highest layer that has at least one set bit is searched.

  2. If the layer that was found, has only one bit that’s set, it’s cleared. After that the correct prefix for the cleared bit is figured out and the descending is continued.

  3. If the layer that was found, has more than one bit that’s set, a mask is created that splits it’s set bits as close to half as possible. After creating the mask the layer is masked by either the mask or it’s complement constructing two distinct producers which are then returned.

  4. If there isn’t any layers that have more than one set bit, splitting doesn’t happen.

The actual iteration is performed by the sequential iterator BitIter which internals are modified by this splitting algorithm.

This splitting strategy should split work evenly if the set bits are distributed close to uniformly random. As the strategy only looks one layer at the time, if there are subtrees that have lots of work and sibling subtrees that have little of work, then it will produce non-optimal splittings.

§

type Item = u32

The type of item returned by this producer.
source§

fn fold_with<F>(self, folder: F) -> F
where F: Folder<Self::Item>,

Iterate the producer, feeding each element to folder, and stop when the folder is full (or all elements have been consumed).

Auto Trait Implementations§

§

impl<'a, T> Freeze for BitProducer<'a, T>

§

impl<'a, T> RefUnwindSafe for BitProducer<'a, T>
where T: RefUnwindSafe,

§

impl<'a, T> Send for BitProducer<'a, T>

§

impl<'a, T> Sync for BitProducer<'a, T>

§

impl<'a, T> Unpin for BitProducer<'a, T>

§

impl<'a, T> UnwindSafe for BitProducer<'a, T>
where T: RefUnwindSafe,

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> Pointable for T

source§

const ALIGN: usize = _

The alignment of pointer.
§

type Init = T

The type for initializers.
source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.