Struct Reductors 

pub struct Reductors<R>(pub R);

This struct can be used to run a tuple of Reductors on a single value, by cloning every element yielded, and updating all Reductors’ states in each iteration.

Tuple Fields

0: R

Trait Implementations

impl<R: Clone> Clone for Reductors<R>

fn clone(&self) -> Reductors<R>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<R: Debug> Debug for Reductors<R>

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

Formats the value using the given formatter.

impl<R: Default> Default for Reductors<R>

fn default() -> Reductors<R>

Returns the “default value” for a type.

impl<R: Hash> Hash for Reductors<R>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<R: Ord> Ord for Reductors<R>

fn cmp(&self, other: &Reductors<R>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<R: PartialEq> PartialEq for Reductors<R>

fn eq(&self, other: &Reductors<R>) -> 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<R: PartialOrd> PartialOrd for Reductors<R>

fn partial_cmp(&self, other: &Reductors<R>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<A, R1, R2> Reductor<A> for Reductors<(R1, R2)>

where A: Clone, R1: Reductor<A>, R2: Reductor<A>,

type State = (<R1 as Reductor<A>>::State, <R2 as Reductor<A>>::State)

Intermediate state for the reductor.

fn new(item: A) -> Self::State

This method will be called with the first item yielded by an iterator to create the initial state of the reductor.

fn reduce(state: Self::State, item: A) -> Self::State

Reduce the current accumulated state with the next item yielded by an iterator, returning the new state.

fn into_result(state: Self::State) -> Self

After reducing the entire iterator, and exhausting it, turn the final state into a result.

impl<A, R1, R2, R3> Reductor<A> for Reductors<(R1, R2, R3)>

where A: Clone, R1: Reductor<A>, R2: Reductor<A>, R3: Reductor<A>,

type State = (<R1 as Reductor<A>>::State, <R2 as Reductor<A>>::State, <R3 as Reductor<A>>::State)

Intermediate state for the reductor.

fn new(item: A) -> Self::State

This method will be called with the first item yielded by an iterator to create the initial state of the reductor.

fn reduce(state: Self::State, item: A) -> Self::State

Reduce the current accumulated state with the next item yielded by an iterator, returning the new state.

fn into_result(state: Self::State) -> Self

After reducing the entire iterator, and exhausting it, turn the final state into a result.

impl<A, R1, R2, R3, R4> Reductor<A> for Reductors<(R1, R2, R3, R4)>

where A: Clone, R1: Reductor<A>, R2: Reductor<A>, R3: Reductor<A>, R4: Reductor<A>,

type State = (<R1 as Reductor<A>>::State, <R2 as Reductor<A>>::State, <R3 as Reductor<A>>::State, <R4 as Reductor<A>>::State)

Intermediate state for the reductor.

fn new(item: A) -> Self::State

This method will be called with the first item yielded by an iterator to create the initial state of the reductor.

fn reduce(state: Self::State, item: A) -> Self::State

Reduce the current accumulated state with the next item yielded by an iterator, returning the new state.

fn into_result(state: Self::State) -> Self

After reducing the entire iterator, and exhausting it, turn the final state into a result.

impl<A, R1, R2, R3, R4, R5> Reductor<A> for Reductors<(R1, R2, R3, R4, R5)>

where A: Clone, R1: Reductor<A>, R2: Reductor<A>, R3: Reductor<A>, R4: Reductor<A>, R5: Reductor<A>,

type State = (<R1 as Reductor<A>>::State, <R2 as Reductor<A>>::State, <R3 as Reductor<A>>::State, <R4 as Reductor<A>>::State, <R5 as Reductor<A>>::State)

Intermediate state for the reductor.

fn new(item: A) -> Self::State

This method will be called with the first item yielded by an iterator to create the initial state of the reductor.

fn reduce(state: Self::State, item: A) -> Self::State

Reduce the current accumulated state with the next item yielded by an iterator, returning the new state.

fn into_result(state: Self::State) -> Self

After reducing the entire iterator, and exhausting it, turn the final state into a result.

impl<R: Copy> Copy for Reductors<R>

impl<R: Eq> Eq for Reductors<R>

impl<R> StructuralPartialEq for Reductors<R>