Struct rayon::iter::collect::consumer::CollectConsumer

pub(super) struct CollectConsumer<'c, T: Send> {
    start: SendPtr<T>,
    len: usize,
    marker: PhantomData<&'c mut T>,
}

Fields

start: SendPtr<T>

See CollectResult for explanation of why this is not a slice

len: usize

marker: PhantomData<&'c mut T>

Implementations

impl<T: Send> CollectConsumer<'_, T>

pub(super) fn appender(vec: &mut Vec<T>, len: usize) -> CollectConsumer<'_, T>

Create a collector for len items in the unused capacity of the vector.

impl<'c, T: Send + 'c> CollectConsumer<'c, T>

unsafe fn new(start: *mut T, len: usize) -> Self

The target memory is considered uninitialized, and will be overwritten without reading or dropping existing values.

Trait Implementations

impl<'c, T: Send + 'c> Consumer<T> for CollectConsumer<'c, T>

type Folder = CollectResult<'c, T>

The type of folder that this consumer can be converted into.

type Reducer = CollectReducer

The type of reducer that is produced if this consumer is split.

type Result = CollectResult<'c, T>

The type of result that this consumer will ultimately produce.

fn split_at(self, index: usize) -> (Self, Self, CollectReducer)

Divide the consumer into two consumers, one processing items 0..index and one processing items from index... Also produces a reducer that can be used to reduce the results at the end.

fn into_folder(self) -> Self::Folder

Convert the consumer into a folder that can consume items sequentially, eventually producing a final result.

fn full(&self) -> bool

Hint whether this Consumer would like to stop processing further items, e.g. if a search has been completed.

impl<'c, T: Send + 'c> UnindexedConsumer<T> for CollectConsumer<'c, T>

Pretend to be unindexed for special_collect_into_vec, but we should never actually get used that way…

fn split_off_left(&self) -> Self

Splits off a “left” consumer and returns it. The self consumer should then be used to consume the “right” portion of the data. (The ordering matters for methods like find_first – values produced by the returned value are given precedence over values produced by self.) Once the left and right halves have been fully consumed, you should reduce the results with the result of to_reducer.

fn to_reducer(&self) -> Self::Reducer

Creates a reducer that can be used to combine the results from a split consumer.