Struct rayon::iter::skip_any_while::SkipAnyWhileConsumer

struct SkipAnyWhileConsumer<'p, C, P> {
    base: C,
    predicate: &'p P,
    skipping: &'p AtomicBool,
}

//////////////////////////////////////////////////////////////////////// Consumer implementation

Fields

base: C

predicate: &'p P

skipping: &'p AtomicBool

Trait Implementations

impl<'p, T, C, P> Consumer<T> for SkipAnyWhileConsumer<'p, C, P>

where C: Consumer<T>, P: Fn(&T) -> bool + Sync,

type Folder = SkipAnyWhileFolder<'p, <C as Consumer<T>>::Folder, P>

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

type Reducer = <C as Consumer<T>>::Reducer

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

type Result = <C as Consumer<T>>::Result

The type of result that this consumer will ultimately produce.

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

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<'p, T, C, P> UnindexedConsumer<T> for SkipAnyWhileConsumer<'p, C, P>

where C: UnindexedConsumer<T>, P: Fn(&T) -> bool + Sync,

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.