Struct rayon::vec::DrainProducer

pub(crate) struct DrainProducer<'data, T: Send> {
    slice: &'data mut [T],
}

////////////////////////////////////////////////////////////////////////

Fields

slice: &'data mut [T]

Implementations

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

pub(crate) unsafe fn new(slice: &mut [T]) -> DrainProducer<'_, T>

Creates a draining producer, which moves items from the slice.

Unsafe because !Copy data must not be read after the borrow is released.

unsafe fn from_vec(vec: &mut Vec<T>, len: usize) -> DrainProducer<'_, T>

Creates a draining producer, which moves items from the tail of the vector.

Unsafe because we’re moving from beyond vec.len(), so the caller must ensure that data is initialized and not read after the borrow is released.

Trait Implementations

impl<'data, T: 'data + Send> Drop for DrainProducer<'data, T>

fn drop(&mut self)

Executes the destructor for this type.

impl<'data, T: 'data + Send> Producer for DrainProducer<'data, T>

type Item = T

The type of item that will be produced by this producer once it is converted into an iterator.

type IntoIter = SliceDrain<'data, T>

The type of iterator we will become.

fn into_iter(self) -> Self::IntoIter

Convert self into an iterator; at this point, no more parallel splits are possible.

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

Split into two producers; one produces items 0..index, the other index..N. Index must be less than or equal to N.

fn min_len(&self) -> usize

The minimum number of items that we will process sequentially. Defaults to 1, which means that we will split all the way down to a single item. This can be raised higher using the with_min_len method, which will force us to create sequential tasks at a larger granularity. Note that Rayon automatically normally attempts to adjust the size of parallel splits to reduce overhead, so this should not be needed.

fn max_len(&self) -> usize

The maximum number of items that we will process sequentially. Defaults to MAX, which means that we can choose not to split at all. This can be lowered using the with_max_len method, which will force us to create more parallel tasks. Note that Rayon automatically normally attempts to adjust the size of parallel splits to reduce overhead, so this should not be needed.

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).