Enum sum::Sum12

pub enum Sum12<A, B, C, D, E, F, G, H, I, J, K, L> {
    A(A),
    B(B),
    C(C),
    D(D),
    E(E),
    F(F),
    G(G),
    H(H),
    I(I),
    J(J),
    K(K),
    L(L),
}

Variants

A(A)

B(B)

C(C)

D(D)

E(E)

F(F)

G(G)

H(H)

I(I)

J(J)

K(K)

L(L)

Implementations

impl<A, B, C, D, E, F, G, H, I, J, K, L> Sum12<A, B, C, D, E, F, G, H, I, J, K, L>

pub fn is_a(&self) -> bool

pub fn a(self) -> Option<A>

pub fn is_b(&self) -> bool

pub fn b(self) -> Option<B>

pub fn is_c(&self) -> bool

pub fn c(self) -> Option<C>

pub fn is_d(&self) -> bool

pub fn d(self) -> Option<D>

pub fn is_e(&self) -> bool

pub fn e(self) -> Option<E>

pub fn is_f(&self) -> bool

pub fn f(self) -> Option<F>

pub fn is_g(&self) -> bool

pub fn g(self) -> Option<G>

pub fn is_h(&self) -> bool

pub fn h(self) -> Option<H>

pub fn is_i(&self) -> bool

pub fn i(self) -> Option<I>

pub fn is_j(&self) -> bool

pub fn j(self) -> Option<J>

pub fn is_k(&self) -> bool

pub fn k(self) -> Option<K>

pub fn is_l(&self) -> bool

pub fn l(self) -> Option<L>

pub fn as_ref(&self) -> Sum12<&A, &B, &C, &D, &E, &F, &G, &H, &I, &J, &K, &L>ⓘ

Important traits for Sum12<A, B, C, D, E, F, G, H, I, J, K, L>

impl<A, B, C, D, E, F, G, H, I, J, K, L> Iterator for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: Iterator,
    B: Iterator<Item = A::Item>,
    C: Iterator<Item = A::Item>,
    D: Iterator<Item = A::Item>,
    E: Iterator<Item = A::Item>,
    F: Iterator<Item = A::Item>,
    G: Iterator<Item = A::Item>,
    H: Iterator<Item = A::Item>,
    I: Iterator<Item = A::Item>,
    J: Iterator<Item = A::Item>,
    K: Iterator<Item = A::Item>,
    L: Iterator<Item = A::Item>,  type Item = A::Item;impl<A, B, C, D, E, F, G, H, I, J, K, L> Future for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: Future,
    B: Future<Output = A::Output>,
    C: Future<Output = A::Output>,
    D: Future<Output = A::Output>,
    E: Future<Output = A::Output>,
    F: Future<Output = A::Output>,
    G: Future<Output = A::Output>,
    H: Future<Output = A::Output>,
    I: Future<Output = A::Output>,
    J: Future<Output = A::Output>,
    K: Future<Output = A::Output>,
    L: Future<Output = A::Output>,  type Output = A::Output;

pub fn as_mut(
    &mut self
) -> Sum12<&mut A, &mut B, &mut C, &mut D, &mut E, &mut F, &mut G, &mut H, &mut I, &mut J, &mut K, &mut L>ⓘ

Important traits for Sum12<A, B, C, D, E, F, G, H, I, J, K, L>

impl<A, B, C, D, E, F, G, H, I, J, K, L> Iterator for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: Iterator,
    B: Iterator<Item = A::Item>,
    C: Iterator<Item = A::Item>,
    D: Iterator<Item = A::Item>,
    E: Iterator<Item = A::Item>,
    F: Iterator<Item = A::Item>,
    G: Iterator<Item = A::Item>,
    H: Iterator<Item = A::Item>,
    I: Iterator<Item = A::Item>,
    J: Iterator<Item = A::Item>,
    K: Iterator<Item = A::Item>,
    L: Iterator<Item = A::Item>,  type Item = A::Item;impl<A, B, C, D, E, F, G, H, I, J, K, L> Future for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: Future,
    B: Future<Output = A::Output>,
    C: Future<Output = A::Output>,
    D: Future<Output = A::Output>,
    E: Future<Output = A::Output>,
    F: Future<Output = A::Output>,
    G: Future<Output = A::Output>,
    H: Future<Output = A::Output>,
    I: Future<Output = A::Output>,
    J: Future<Output = A::Output>,
    K: Future<Output = A::Output>,
    L: Future<Output = A::Output>,  type Output = A::Output;

pub fn as_pin_ref<'a>(
    self: Pin<&'a Self>
) -> Sum12<Pin<&'a A>, Pin<&'a B>, Pin<&'a C>, Pin<&'a D>, Pin<&'a E>, Pin<&'a F>, Pin<&'a G>, Pin<&'a H>, Pin<&'a I>, Pin<&'a J>, Pin<&'a K>, Pin<&'a L>>ⓘ

Important traits for Sum12<A, B, C, D, E, F, G, H, I, J, K, L>

impl<A, B, C, D, E, F, G, H, I, J, K, L> Iterator for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: Iterator,
    B: Iterator<Item = A::Item>,
    C: Iterator<Item = A::Item>,
    D: Iterator<Item = A::Item>,
    E: Iterator<Item = A::Item>,
    F: Iterator<Item = A::Item>,
    G: Iterator<Item = A::Item>,
    H: Iterator<Item = A::Item>,
    I: Iterator<Item = A::Item>,
    J: Iterator<Item = A::Item>,
    K: Iterator<Item = A::Item>,
    L: Iterator<Item = A::Item>,  type Item = A::Item;impl<A, B, C, D, E, F, G, H, I, J, K, L> Future for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: Future,
    B: Future<Output = A::Output>,
    C: Future<Output = A::Output>,
    D: Future<Output = A::Output>,
    E: Future<Output = A::Output>,
    F: Future<Output = A::Output>,
    G: Future<Output = A::Output>,
    H: Future<Output = A::Output>,
    I: Future<Output = A::Output>,
    J: Future<Output = A::Output>,
    K: Future<Output = A::Output>,
    L: Future<Output = A::Output>,  type Output = A::Output;

pub fn as_pin_mut<'a>(
    self: Pin<&'a mut Self>
) -> Sum12<Pin<&'a mut A>, Pin<&'a mut B>, Pin<&'a mut C>, Pin<&'a mut D>, Pin<&'a mut E>, Pin<&'a mut F>, Pin<&'a mut G>, Pin<&'a mut H>, Pin<&'a mut I>, Pin<&'a mut J>, Pin<&'a mut K>, Pin<&'a mut L>>ⓘ

Important traits for Sum12<A, B, C, D, E, F, G, H, I, J, K, L>

impl<A, B, C, D, E, F, G, H, I, J, K, L> Iterator for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: Iterator,
    B: Iterator<Item = A::Item>,
    C: Iterator<Item = A::Item>,
    D: Iterator<Item = A::Item>,
    E: Iterator<Item = A::Item>,
    F: Iterator<Item = A::Item>,
    G: Iterator<Item = A::Item>,
    H: Iterator<Item = A::Item>,
    I: Iterator<Item = A::Item>,
    J: Iterator<Item = A::Item>,
    K: Iterator<Item = A::Item>,
    L: Iterator<Item = A::Item>,  type Item = A::Item;impl<A, B, C, D, E, F, G, H, I, J, K, L> Future for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: Future,
    B: Future<Output = A::Output>,
    C: Future<Output = A::Output>,
    D: Future<Output = A::Output>,
    E: Future<Output = A::Output>,
    F: Future<Output = A::Output>,
    G: Future<Output = A::Output>,
    H: Future<Output = A::Output>,
    I: Future<Output = A::Output>,
    J: Future<Output = A::Output>,
    K: Future<Output = A::Output>,
    L: Future<Output = A::Output>,  type Output = A::Output;

impl<A> Sum12<A, A, A, A, A, A, A, A, A, A, A, A>

pub fn into_inner(self) -> A

Trait Implementations

impl<A, B, C, D, E, F, G, H, I, J, K, L, Target> AsMut<Target> for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: AsMut<Target>,
    B: AsMut<Target>,
    C: AsMut<Target>,
    D: AsMut<Target>,
    E: AsMut<Target>,
    F: AsMut<Target>,
    G: AsMut<Target>,
    H: AsMut<Target>,
    I: AsMut<Target>,
    J: AsMut<Target>,
    K: AsMut<Target>,
    L: AsMut<Target>, 

fn as_mut(&mut self) -> &mut Target

Performs the conversion.

impl<A, B, C, D, E, F, G, H, I, J, K, L, Target> AsRef<Target> for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: AsRef<Target>,
    B: AsRef<Target>,
    C: AsRef<Target>,
    D: AsRef<Target>,
    E: AsRef<Target>,
    F: AsRef<Target>,
    G: AsRef<Target>,
    H: AsRef<Target>,
    I: AsRef<Target>,
    J: AsRef<Target>,
    K: AsRef<Target>,
    L: AsRef<Target>, 

fn as_ref(&self) -> &Target

Performs the conversion.

impl<A: Clone, B: Clone, C: Clone, D: Clone, E: Clone, F: Clone, G: Clone, H: Clone, I: Clone, J: Clone, K: Clone, L: Clone> Clone for Sum12<A, B, C, D, E, F, G, H, I, J, K, L>

fn clone(&self) -> Sum12<A, B, C, D, E, F, G, H, I, J, K, L>ⓘ

Important traits for Sum12<A, B, C, D, E, F, G, H, I, J, K, L>

impl<A, B, C, D, E, F, G, H, I, J, K, L> Iterator for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: Iterator,
    B: Iterator<Item = A::Item>,
    C: Iterator<Item = A::Item>,
    D: Iterator<Item = A::Item>,
    E: Iterator<Item = A::Item>,
    F: Iterator<Item = A::Item>,
    G: Iterator<Item = A::Item>,
    H: Iterator<Item = A::Item>,
    I: Iterator<Item = A::Item>,
    J: Iterator<Item = A::Item>,
    K: Iterator<Item = A::Item>,
    L: Iterator<Item = A::Item>,  type Item = A::Item;impl<A, B, C, D, E, F, G, H, I, J, K, L> Future for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: Future,
    B: Future<Output = A::Output>,
    C: Future<Output = A::Output>,
    D: Future<Output = A::Output>,
    E: Future<Output = A::Output>,
    F: Future<Output = A::Output>,
    G: Future<Output = A::Output>,
    H: Future<Output = A::Output>,
    I: Future<Output = A::Output>,
    J: Future<Output = A::Output>,
    K: Future<Output = A::Output>,
    L: Future<Output = A::Output>,  type Output = A::Output;

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<A: Copy, B: Copy, C: Copy, D: Copy, E: Copy, F: Copy, G: Copy, H: Copy, I: Copy, J: Copy, K: Copy, L: Copy> Copy for Sum12<A, B, C, D, E, F, G, H, I, J, K, L>

impl<A: Debug, B: Debug, C: Debug, D: Debug, E: Debug, F: Debug, G: Debug, H: Debug, I: Debug, J: Debug, K: Debug, L: Debug> Debug for Sum12<A, B, C, D, E, F, G, H, I, J, K, L>

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

Formats the value using the given formatter.

impl<A, B, C, D, E, F, G, H, I, J, K, L> Deref for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: Deref,
    B: Deref<Target = A::Target>,
    C: Deref<Target = A::Target>,
    D: Deref<Target = A::Target>,
    E: Deref<Target = A::Target>,
    F: Deref<Target = A::Target>,
    G: Deref<Target = A::Target>,
    H: Deref<Target = A::Target>,
    I: Deref<Target = A::Target>,
    J: Deref<Target = A::Target>,
    K: Deref<Target = A::Target>,
    L: Deref<Target = A::Target>, 

type Target = A::Target

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<A, B, C, D, E, F, G, H, I, J, K, L> DerefMut for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: DerefMut,
    B: DerefMut<Target = A::Target>,
    C: DerefMut<Target = A::Target>,
    D: DerefMut<Target = A::Target>,
    E: DerefMut<Target = A::Target>,
    F: DerefMut<Target = A::Target>,
    G: DerefMut<Target = A::Target>,
    H: DerefMut<Target = A::Target>,
    I: DerefMut<Target = A::Target>,
    J: DerefMut<Target = A::Target>,
    K: DerefMut<Target = A::Target>,
    L: DerefMut<Target = A::Target>, 

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<'de, A, B, C, D, E, F, G, H, I, J, K, L> Deserialize<'de> for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: Deserialize<'de>,
    B: Deserialize<'de>,
    C: Deserialize<'de>,
    D: Deserialize<'de>,
    E: Deserialize<'de>,
    F: Deserialize<'de>,
    G: Deserialize<'de>,
    H: Deserialize<'de>,
    I: Deserialize<'de>,
    J: Deserialize<'de>,
    K: Deserialize<'de>,
    L: Deserialize<'de>, 

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<A, B, C, D, E, F, G, H, I, J, K, L> Display for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: Display,
    B: Display,
    C: Display,
    D: Display,
    E: Display,
    F: Display,
    G: Display,
    H: Display,
    I: Display,
    J: Display,
    K: Display,
    L: Display, 

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

Formats the value using the given formatter.

impl<A, B, C, D, E, F, G, H, I, J, K, L> DoubleEndedIterator for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: DoubleEndedIterator,
    B: DoubleEndedIterator<Item = A::Item>,
    C: DoubleEndedIterator<Item = A::Item>,
    D: DoubleEndedIterator<Item = A::Item>,
    E: DoubleEndedIterator<Item = A::Item>,
    F: DoubleEndedIterator<Item = A::Item>,
    G: DoubleEndedIterator<Item = A::Item>,
    H: DoubleEndedIterator<Item = A::Item>,
    I: DoubleEndedIterator<Item = A::Item>,
    J: DoubleEndedIterator<Item = A::Item>,
    K: DoubleEndedIterator<Item = A::Item>,
    L: DoubleEndedIterator<Item = A::Item>, 

fn next_back(&mut self) -> Option<Self::Item>

Removes and returns an element from the end of the iterator.

fn nth_back(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element from the end of the iterator.

fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R where
    F: FnMut(B, Self::Item) -> R,
    R: Try<Ok = B>, 

This is the reverse version of [try_fold()]: it takes elements starting from the back of the iterator.

fn rfold<B, F>(self, init: B, f: F) -> B where
    F: FnMut(B, Self::Item) -> B, 

An iterator method that reduces the iterator's elements to a single, final value, starting from the back.

fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item> where
    P: FnMut(&Self::Item) -> bool, 

Searches for an element of an iterator from the back that satisfies a predicate.

impl<A: Eq, B: Eq, C: Eq, D: Eq, E: Eq, F: Eq, G: Eq, H: Eq, I: Eq, J: Eq, K: Eq, L: Eq> Eq for Sum12<A, B, C, D, E, F, G, H, I, J, K, L>

impl<A, B, C, D, E, F, G, H, I, J, K, L> Error for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: Error,
    B: Error,
    C: Error,
    D: Error,
    E: Error,
    F: Error,
    G: Error,
    H: Error,
    I: Error,
    J: Error,
    K: Error,
    L: Error, 

fn description(&self) -> &str

👎 Deprecated since 1.42.0:

use the Display impl or to_string()

if let Err(e) = "xc".parse::<u32>() { // Print e itself, no need for description(). eprintln!("Error: {}", e); }

fn cause(&self) -> Option<&dyn Error>

👎 Deprecated since 1.33.0:

replaced by Error::source, which can support downcasting

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any.

fn backtrace(&self) -> Option<&Backtrace>

🔬 This is a nightly-only experimental API. (backtrace)

Returns a stack backtrace, if available, of where this error occurred.

impl<A, B, C, D, E, F, G, H, I, J, K, L> ExactSizeIterator for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: ExactSizeIterator,
    B: ExactSizeIterator<Item = A::Item>,
    C: ExactSizeIterator<Item = A::Item>,
    D: ExactSizeIterator<Item = A::Item>,
    E: ExactSizeIterator<Item = A::Item>,
    F: ExactSizeIterator<Item = A::Item>,
    G: ExactSizeIterator<Item = A::Item>,
    H: ExactSizeIterator<Item = A::Item>,
    I: ExactSizeIterator<Item = A::Item>,
    J: ExactSizeIterator<Item = A::Item>,
    K: ExactSizeIterator<Item = A::Item>,
    L: ExactSizeIterator<Item = A::Item>, 

fn len(&self) -> usize

Returns the exact length of the iterator.

fn is_empty(&self) -> bool

🔬 This is a nightly-only experimental API. (exact_size_is_empty)

Returns true if the iterator is empty.

impl<A, B, C, D, E, F, G, H, I, J, K, L> Future for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: Future,
    B: Future<Output = A::Output>,
    C: Future<Output = A::Output>,
    D: Future<Output = A::Output>,
    E: Future<Output = A::Output>,
    F: Future<Output = A::Output>,
    G: Future<Output = A::Output>,
    H: Future<Output = A::Output>,
    I: Future<Output = A::Output>,
    J: Future<Output = A::Output>,
    K: Future<Output = A::Output>,
    L: Future<Output = A::Output>, 

type Output = A::Output

The type of value produced on completion.

fn poll(self: Pin<&mut Self>, cx: &mut Context) -> Poll<Self::Output>

Attempt to resolve the future to a final value, registering the current task for wakeup if the value is not yet available.

impl<A: Hash, B: Hash, C: Hash, D: Hash, E: Hash, F: Hash, G: Hash, H: Hash, I: Hash, J: Hash, K: Hash, L: Hash> Hash for Sum12<A, B, C, D, E, F, G, H, I, J, K, L>

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, 

Feeds a slice of this type into the given [Hasher].

impl<A, B, C, D, E, F, G, H, I, J, K, L> Iterator for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: Iterator,
    B: Iterator<Item = A::Item>,
    C: Iterator<Item = A::Item>,
    D: Iterator<Item = A::Item>,
    E: Iterator<Item = A::Item>,
    F: Iterator<Item = A::Item>,
    G: Iterator<Item = A::Item>,
    H: Iterator<Item = A::Item>,
    I: Iterator<Item = A::Item>,
    J: Iterator<Item = A::Item>,
    K: Iterator<Item = A::Item>,
    L: Iterator<Item = A::Item>, 

type Item = A::Item

The type of the elements being iterated over.

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value.

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator.

fn count(self) -> usize

Consumes the iterator, counting the number of iterations and returning it.

fn last(self) -> Option<Self::Item>

Consumes the iterator, returning the last element.

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator.

fn step_by(self, step: usize) -> StepBy<Self>

Creates an iterator starting at the same point, but stepping by the given amount at each iteration.

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
    U: IntoIterator<Item = Self::Item>, 

Takes two iterators and creates a new iterator over both in sequence.

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
    U: IntoIterator, 

'Zips up' two iterators into a single iterator of pairs.

fn map<B, F>(self, f: F) -> Map<Self, F> where
    F: FnMut(Self::Item) -> B, 

Takes a closure and creates an iterator which calls that closure on each element.

fn for_each<F>(self, f: F) where
    F: FnMut(Self::Item), 

Calls a closure on each element of an iterator.

fn filter<P>(self, predicate: P) -> Filter<Self, P> where
    P: FnMut(&Self::Item) -> bool, 

Creates an iterator which uses a closure to determine if an element should be yielded.

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
    F: FnMut(Self::Item) -> Option<B>, 

Creates an iterator that both filters and maps.

fn enumerate(self) -> Enumerate<Self>

Creates an iterator which gives the current iteration count as well as the next value.

fn peekable(self) -> Peekable<Self>

Creates an iterator which can use peek to look at the next element of the iterator without consuming it.

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
    P: FnMut(&Self::Item) -> bool, 

Creates an iterator that [skip]s elements based on a predicate.

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
    P: FnMut(&Self::Item) -> bool, 

Creates an iterator that yields elements based on a predicate.

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P> where
    P: FnMut(Self::Item) -> Option<B>, 

🔬 This is a nightly-only experimental API. (iter_map_while)

recently added

Creates an iterator that both yields elements based on a predicate and maps.

fn skip(self, n: usize) -> Skip<Self>

Creates an iterator that skips the first n elements.

fn take(self, n: usize) -> Take<Self>

Creates an iterator that yields its first n elements.

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
    F: FnMut(&mut St, Self::Item) -> Option<B>, 

An iterator adaptor similar to [fold] that holds internal state and produces a new iterator.

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
    F: FnMut(Self::Item) -> U,
    U: IntoIterator, 

Creates an iterator that works like map, but flattens nested structure.

fn flatten(self) -> Flatten<Self> where
    Self::Item: IntoIterator, 

Creates an iterator that flattens nested structure.

fn fuse(self) -> Fuse<Self>

Creates an iterator which ends after the first [None].

fn inspect<F>(self, f: F) -> Inspect<Self, F> where
    F: FnMut(&Self::Item), 

Does something with each element of an iterator, passing the value on.

fn by_ref(&mut self) -> &mut Self

Borrows an iterator, rather than consuming it.

#[must_use = "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"]fn collect<B>(self) -> B where
    B: FromIterator<Self::Item>, 

Transforms an iterator into a collection.

fn partition<B, F>(self, f: F) -> (B, B) where
    B: Default + Extend<Self::Item>,
    F: FnMut(&Self::Item) -> bool, 

Consumes an iterator, creating two collections from it.

fn partition_in_place<'a, T, P>(self, predicate: P) -> usize where
    P: FnMut(&T) -> bool,
    Self: DoubleEndedIterator<Item = &'a mut T>,
    T: 'a, 

🔬 This is a nightly-only experimental API. (iter_partition_in_place)

new API

Reorders the elements of this iterator in-place according to the given predicate, such that all those that return true precede all those that return false. Returns the number of true elements found.

fn is_partitioned<P>(self, predicate: P) -> bool where
    P: FnMut(Self::Item) -> bool, 

🔬 This is a nightly-only experimental API. (iter_is_partitioned)

new API

Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return true precede all those that return false.

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
    F: FnMut(B, Self::Item) -> R,
    R: Try<Ok = B>, 

An iterator method that applies a function as long as it returns successfully, producing a single, final value.

fn try_for_each<F, R>(&mut self, f: F) -> R where
    F: FnMut(Self::Item) -> R,
    R: Try<Ok = ()>, 

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error.

fn fold<B, F>(self, init: B, f: F) -> B where
    F: FnMut(B, Self::Item) -> B, 

An iterator method that applies a function, producing a single, final value.

fn fold_first<F>(self, f: F) -> Option<Self::Item> where
    F: FnMut(Self::Item, Self::Item) -> Self::Item, 

🔬 This is a nightly-only experimental API. (iterator_fold_self)

The same as fold(), but uses the first element in the iterator as the initial value, folding every subsequent element into it. If the iterator is empty, return None; otherwise, return the result of the fold.

fn all<F>(&mut self, f: F) -> bool where
    F: FnMut(Self::Item) -> bool, 

Tests if every element of the iterator matches a predicate.

fn any<F>(&mut self, f: F) -> bool where
    F: FnMut(Self::Item) -> bool, 

Tests if any element of the iterator matches a predicate.

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
    P: FnMut(&Self::Item) -> bool, 

Searches for an element of an iterator that satisfies a predicate.

fn find_map<B, F>(&mut self, f: F) -> Option<B> where
    F: FnMut(Self::Item) -> Option<B>, 

Applies function to the elements of iterator and returns the first non-none result.

fn try_find<F, R>(
    &mut self,
    f: F
) -> Result<Option<Self::Item>, <R as Try>::Error> where
    F: FnMut(&Self::Item) -> R,
    R: Try<Ok = bool>, 

🔬 This is a nightly-only experimental API. (try_find)

new API

Applies function to the elements of iterator and returns the first true result or the first error.

fn position<P>(&mut self, predicate: P) -> Option<usize> where
    P: FnMut(Self::Item) -> bool, 

Searches for an element in an iterator, returning its index.

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
    P: FnMut(Self::Item) -> bool,
    Self: ExactSizeIterator + DoubleEndedIterator, 

Searches for an element in an iterator from the right, returning its index.

fn max(self) -> Option<Self::Item> where
    Self::Item: Ord, 

Returns the maximum element of an iterator.

fn min(self) -> Option<Self::Item> where
    Self::Item: Ord, 

Returns the minimum element of an iterator.

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
    B: Ord,
    F: FnMut(&Self::Item) -> B, 

Returns the element that gives the maximum value from the specified function.

fn max_by<F>(self, compare: F) -> Option<Self::Item> where
    F: FnMut(&Self::Item, &Self::Item) -> Ordering, 

Returns the element that gives the maximum value with respect to the specified comparison function.

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
    B: Ord,
    F: FnMut(&Self::Item) -> B, 

Returns the element that gives the minimum value from the specified function.

fn min_by<F>(self, compare: F) -> Option<Self::Item> where
    F: FnMut(&Self::Item, &Self::Item) -> Ordering, 

Returns the element that gives the minimum value with respect to the specified comparison function.

fn rev(self) -> Rev<Self> where
    Self: DoubleEndedIterator, 

Reverses an iterator's direction.

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
    FromA: Default + Extend<A>,
    FromB: Default + Extend<B>,
    Self: Iterator<Item = (A, B)>, 

Converts an iterator of pairs into a pair of containers.

fn copied<'a, T>(self) -> Copied<Self> where
    Self: Iterator<Item = &'a T>,
    T: 'a + Copy, 

Creates an iterator which copies all of its elements.

fn cloned<'a, T>(self) -> Cloned<Self> where
    Self: Iterator<Item = &'a T>,
    T: 'a + Clone, 

Creates an iterator which [clone]s all of its elements.

fn cycle(self) -> Cycle<Self> where
    Self: Clone, 

Repeats an iterator endlessly.

fn sum<S>(self) -> S where
    S: Sum<Self::Item>, 

Sums the elements of an iterator.

fn product<P>(self) -> P where
    P: Product<Self::Item>, 

Iterates over the entire iterator, multiplying all the elements

fn cmp<I>(self, other: I) -> Ordering where
    I: IntoIterator<Item = Self::Item>,
    Self::Item: Ord, 

Lexicographically compares the elements of this Iterator with those of another.

fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering where
    F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
    I: IntoIterator, 

🔬 This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Lexicographically compares the elements of this Iterator with those of another.

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering> where
    F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
    I: IntoIterator, 

🔬 This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn eq<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialEq<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are equal to those of another.

fn eq_by<I, F>(self, other: I, eq: F) -> bool where
    F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
    I: IntoIterator, 

🔬 This is a nightly-only experimental API. (iter_order_by)

Determines if the elements of this Iterator are equal to those of another with respect to the specified equality function.

fn ne<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialEq<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are unequal to those of another.

fn lt<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically less than those of another.

fn le<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically less or equal to those of another.

fn gt<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically greater than those of another.

fn ge<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another.

fn is_sorted(self) -> bool where
    Self::Item: PartialOrd<Self::Item>, 

🔬 This is a nightly-only experimental API. (is_sorted)

new API

Checks if the elements of this iterator are sorted.

fn is_sorted_by<F>(self, compare: F) -> bool where
    F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>, 

🔬 This is a nightly-only experimental API. (is_sorted)

new API

Checks if the elements of this iterator are sorted using the given comparator function.

fn is_sorted_by_key<F, K>(self, f: F) -> bool where
    F: FnMut(Self::Item) -> K,
    K: PartialOrd<K>, 

🔬 This is a nightly-only experimental API. (is_sorted)

new API

Checks if the elements of this iterator are sorted using the given key extraction function.

impl<A: Ord, B: Ord, C: Ord, D: Ord, E: Ord, F: Ord, G: Ord, H: Ord, I: Ord, J: Ord, K: Ord, L: Ord> Ord for Sum12<A, B, C, D, E, F, G, H, I, J, K, L>

fn cmp(&self, other: &Sum12<A, B, C, D, E, F, G, H, I, J, K, L>) -> Ordering

This method returns an [Ordering] between self and other.

#[must_use]fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]fn clamp(self, min: Self, max: Self) -> Self

🔬 This is a nightly-only experimental API. (clamp)

Restrict a value to a certain interval.

impl<A: PartialEq, B: PartialEq, C: PartialEq, D: PartialEq, E: PartialEq, F: PartialEq, G: PartialEq, H: PartialEq, I: PartialEq, J: PartialEq, K: PartialEq, L: PartialEq> PartialEq<Sum12<A, B, C, D, E, F, G, H, I, J, K, L>> for Sum12<A, B, C, D, E, F, G, H, I, J, K, L>

fn eq(&self, other: &Sum12<A, B, C, D, E, F, G, H, I, J, K, L>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Sum12<A, B, C, D, E, F, G, H, I, J, K, L>) -> bool

This method tests for !=.

impl<A: PartialOrd, B: PartialOrd, C: PartialOrd, D: PartialOrd, E: PartialOrd, F: PartialOrd, G: PartialOrd, H: PartialOrd, I: PartialOrd, J: PartialOrd, K: PartialOrd, L: PartialOrd> PartialOrd<Sum12<A, B, C, D, E, F, G, H, I, J, K, L>> for Sum12<A, B, C, D, E, F, G, H, I, J, K, L>

fn partial_cmp(
    &self,
    other: &Sum12<A, B, C, D, E, F, G, H, I, J, K, L>
) -> Option<Ordering>

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

fn lt(&self, other: &Sum12<A, B, C, D, E, F, G, H, I, J, K, L>) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Sum12<A, B, C, D, E, F, G, H, I, J, K, L>) -> bool

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

fn gt(&self, other: &Sum12<A, B, C, D, E, F, G, H, I, J, K, L>) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Sum12<A, B, C, D, E, F, G, H, I, J, K, L>) -> bool

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

impl<A, B, C, D, E, F, G, H, I, J, K, L> Serialize for Sum12<A, B, C, D, E, F, G, H, I, J, K, L> where
    A: Serialize,
    B: Serialize,
    C: Serialize,
    D: Serialize,
    E: Serialize,
    F: Serialize,
    G: Serialize,
    H: Serialize,
    I: Serialize,
    J: Serialize,
    K: Serialize,
    L: Serialize, 

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.

impl<A, B, C, D, E, F, G, H, I, J, K, L> StructuralEq for Sum12<A, B, C, D, E, F, G, H, I, J, K, L>

impl<A, B, C, D, E, F, G, H, I, J, K, L> StructuralPartialEq for Sum12<A, B, C, D, E, F, G, H, I, J, K, L>