Enum Sum27

pub enum Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa> {
    A(A),
    B(B),
    C(C),
    D(D),
    E(E),
    F(F),
    G(G),
    H(H),
    I(I),
    J(J),
    K(K),
    L(L),
    M(M),
    N(N),
    O(O),
    P(P),
    Q(Q),
    R(R),
    S(S),
    T(T),
    U(U),
    V(V),
    W(W),
    X(X),
    Y(Y),
    Z(Z),
    Aa(Aa),
}

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)

M(M)

N(N)

O(O)

P(P)

Q(Q)

R(R)

S(S)

T(T)

U(U)

V(V)

W(W)

X(X)

Y(Y)

Z(Z)

Aa(Aa)

Implementations

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa> Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

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 is_m(&self) -> bool

pub fn m(self) -> Option<M>

pub fn is_n(&self) -> bool

pub fn n(self) -> Option<N>

pub fn is_o(&self) -> bool

pub fn o(self) -> Option<O>

pub fn is_p(&self) -> bool

pub fn p(self) -> Option<P>

pub fn is_q(&self) -> bool

pub fn q(self) -> Option<Q>

pub fn is_r(&self) -> bool

pub fn r(self) -> Option<R>

pub fn is_s(&self) -> bool

pub fn s(self) -> Option<S>

pub fn is_t(&self) -> bool

pub fn t(self) -> Option<T>

pub fn is_u(&self) -> bool

pub fn u(self) -> Option<U>

pub fn is_v(&self) -> bool

pub fn v(self) -> Option<V>

pub fn is_w(&self) -> bool

pub fn w(self) -> Option<W>

pub fn is_x(&self) -> bool

pub fn x(self) -> Option<X>

pub fn is_y(&self) -> bool

pub fn y(self) -> Option<Y>

pub fn is_z(&self) -> bool

pub fn z(self) -> Option<Z>

pub fn is_aa(&self) -> bool

pub fn aa(self) -> Option<Aa>

pub fn as_ref( &self, ) -> Sum27<&A, &B, &C, &D, &E, &F, &G, &H, &I, &J, &K, &L, &M, &N, &O, &P, &Q, &R, &S, &T, &U, &V, &W, &X, &Y, &Z, &Aa>

pub fn as_mut( &mut self, ) -> Sum27<&mut A, &mut B, &mut C, &mut D, &mut E, &mut F, &mut G, &mut H, &mut I, &mut J, &mut K, &mut L, &mut M, &mut N, &mut O, &mut P, &mut Q, &mut R, &mut S, &mut T, &mut U, &mut V, &mut W, &mut X, &mut Y, &mut Z, &mut Aa>

pub fn as_pin_ref<'a>( self: Pin<&'a Self>, ) -> Sum27<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>, Pin<&'a M>, Pin<&'a N>, Pin<&'a O>, Pin<&'a P>, Pin<&'a Q>, Pin<&'a R>, Pin<&'a S>, Pin<&'a T>, Pin<&'a U>, Pin<&'a V>, Pin<&'a W>, Pin<&'a X>, Pin<&'a Y>, Pin<&'a Z>, Pin<&'a Aa>>

pub fn as_pin_mut<'a>( self: Pin<&'a mut Self>, ) -> Sum27<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>, Pin<&'a mut M>, Pin<&'a mut N>, Pin<&'a mut O>, Pin<&'a mut P>, Pin<&'a mut Q>, Pin<&'a mut R>, Pin<&'a mut S>, Pin<&'a mut T>, Pin<&'a mut U>, Pin<&'a mut V>, Pin<&'a mut W>, Pin<&'a mut X>, Pin<&'a mut Y>, Pin<&'a mut Z>, Pin<&'a mut Aa>>

impl<A> Sum27<A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, 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, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa, Target> AsMut<Target> for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

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>, M: AsMut<Target>, N: AsMut<Target>, O: AsMut<Target>, P: AsMut<Target>, Q: AsMut<Target>, R: AsMut<Target>, S: AsMut<Target>, T: AsMut<Target>, U: AsMut<Target>, V: AsMut<Target>, W: AsMut<Target>, X: AsMut<Target>, Y: AsMut<Target>, Z: AsMut<Target>, Aa: AsMut<Target>,

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

Converts this type into a mutable reference of the (usually inferred) input type.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa, Target> AsRef<Target> for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

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>, M: AsRef<Target>, N: AsRef<Target>, O: AsRef<Target>, P: AsRef<Target>, Q: AsRef<Target>, R: AsRef<Target>, S: AsRef<Target>, T: AsRef<Target>, U: AsRef<Target>, V: AsRef<Target>, W: AsRef<Target>, X: AsRef<Target>, Y: AsRef<Target>, Z: AsRef<Target>, Aa: AsRef<Target>,

fn as_ref(&self) -> &Target

Converts this type into a shared reference of the (usually inferred) input type.

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, M: Clone, N: Clone, O: Clone, P: Clone, Q: Clone, R: Clone, S: Clone, T: Clone, U: Clone, V: Clone, W: Clone, X: Clone, Y: Clone, Z: Clone, Aa: Clone> Clone for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

fn clone( &self, ) -> Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

Returns a copy of the value.

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

Performs copy-assignment from source.

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, M: Debug, N: Debug, O: Debug, P: Debug, Q: Debug, R: Debug, S: Debug, T: Debug, U: Debug, V: Debug, W: Debug, X: Debug, Y: Debug, Z: Debug, Aa: Debug> Debug for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

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, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa> Deref for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

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>, M: Deref<Target = A::Target>, N: Deref<Target = A::Target>, O: Deref<Target = A::Target>, P: Deref<Target = A::Target>, Q: Deref<Target = A::Target>, R: Deref<Target = A::Target>, S: Deref<Target = A::Target>, T: Deref<Target = A::Target>, U: Deref<Target = A::Target>, V: Deref<Target = A::Target>, W: Deref<Target = A::Target>, X: Deref<Target = A::Target>, Y: Deref<Target = A::Target>, Z: Deref<Target = A::Target>, Aa: Deref<Target = A::Target>,

type Target = <A as Deref>::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, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa> DerefMut for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

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>, M: DerefMut<Target = A::Target>, N: DerefMut<Target = A::Target>, O: DerefMut<Target = A::Target>, P: DerefMut<Target = A::Target>, Q: DerefMut<Target = A::Target>, R: DerefMut<Target = A::Target>, S: DerefMut<Target = A::Target>, T: DerefMut<Target = A::Target>, U: DerefMut<Target = A::Target>, V: DerefMut<Target = A::Target>, W: DerefMut<Target = A::Target>, X: DerefMut<Target = A::Target>, Y: DerefMut<Target = A::Target>, Z: DerefMut<Target = A::Target>, Aa: 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, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa> Deserialize<'de> for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

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>, M: Deserialize<'de>, N: Deserialize<'de>, O: Deserialize<'de>, P: Deserialize<'de>, Q: Deserialize<'de>, R: Deserialize<'de>, S: Deserialize<'de>, T: Deserialize<'de>, U: Deserialize<'de>, V: Deserialize<'de>, W: Deserialize<'de>, X: Deserialize<'de>, Y: Deserialize<'de>, Z: Deserialize<'de>, Aa: 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, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa> Display for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

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, M: Display, N: Display, O: Display, P: Display, Q: Display, R: Display, S: Display, T: Display, U: Display, V: Display, W: Display, X: Display, Y: Display, Z: Display, Aa: 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, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa> DoubleEndedIterator for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

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>, M: DoubleEndedIterator<Item = A::Item>, N: DoubleEndedIterator<Item = A::Item>, O: DoubleEndedIterator<Item = A::Item>, P: DoubleEndedIterator<Item = A::Item>, Q: DoubleEndedIterator<Item = A::Item>, R: DoubleEndedIterator<Item = A::Item>, S: DoubleEndedIterator<Item = A::Item>, T: DoubleEndedIterator<Item = A::Item>, U: DoubleEndedIterator<Item = A::Item>, V: DoubleEndedIterator<Item = A::Item>, W: DoubleEndedIterator<Item = A::Item>, X: DoubleEndedIterator<Item = A::Item>, Y: DoubleEndedIterator<Item = A::Item>, Z: DoubleEndedIterator<Item = A::Item>, Aa: DoubleEndedIterator<Item = A::Item>,

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

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

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

Advances the iterator from the back by n elements.

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 Self: Sized, F: FnMut(B, Self::Item) -> R, R: Try<Output = B>,

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

fn rfold<B, F>(self, init: B, f: F) -> B

where Self: Sized, 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 Self: Sized, P: FnMut(&Self::Item) -> bool,

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

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa> Error for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

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, M: Error, N: Error, O: Error, P: Error, Q: Error, R: Error, S: Error, T: Error, U: Error, V: Error, W: Error, X: Error, Y: Error, Z: Error, Aa: Error,

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()

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

Returns the lower-level source of this error, if any.

fn provide<'a>(&'a self, request: &mut Request<'a>)

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

Provides type-based access to context intended for error reports.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa> ExactSizeIterator for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

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>, M: ExactSizeIterator<Item = A::Item>, N: ExactSizeIterator<Item = A::Item>, O: ExactSizeIterator<Item = A::Item>, P: ExactSizeIterator<Item = A::Item>, Q: ExactSizeIterator<Item = A::Item>, R: ExactSizeIterator<Item = A::Item>, S: ExactSizeIterator<Item = A::Item>, T: ExactSizeIterator<Item = A::Item>, U: ExactSizeIterator<Item = A::Item>, V: ExactSizeIterator<Item = A::Item>, W: ExactSizeIterator<Item = A::Item>, X: ExactSizeIterator<Item = A::Item>, Y: ExactSizeIterator<Item = A::Item>, Z: ExactSizeIterator<Item = A::Item>, Aa: ExactSizeIterator<Item = A::Item>,

fn len(&self) -> usize

Returns the exact remaining 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, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa> Future for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

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>, M: Future<Output = A::Output>, N: Future<Output = A::Output>, O: Future<Output = A::Output>, P: Future<Output = A::Output>, Q: Future<Output = A::Output>, R: Future<Output = A::Output>, S: Future<Output = A::Output>, T: Future<Output = A::Output>, U: Future<Output = A::Output>, V: Future<Output = A::Output>, W: Future<Output = A::Output>, X: Future<Output = A::Output>, Y: Future<Output = A::Output>, Z: Future<Output = A::Output>, Aa: Future<Output = A::Output>,

type Output = <A as Future>::Output

The type of value produced on completion.

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

Attempts 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, M: Hash, N: Hash, O: Hash, P: Hash, Q: Hash, R: Hash, S: Hash, T: Hash, U: Hash, V: Hash, W: Hash, X: Hash, Y: Hash, Z: Hash, Aa: Hash> Hash for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

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<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa> Iterator for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

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>, M: Iterator<Item = A::Item>, N: Iterator<Item = A::Item>, O: Iterator<Item = A::Item>, P: Iterator<Item = A::Item>, Q: Iterator<Item = A::Item>, R: Iterator<Item = A::Item>, S: Iterator<Item = A::Item>, T: Iterator<Item = A::Item>, U: Iterator<Item = A::Item>, V: Iterator<Item = A::Item>, W: Iterator<Item = A::Item>, X: Iterator<Item = A::Item>, Y: Iterator<Item = A::Item>, Z: Iterator<Item = A::Item>, Aa: Iterator<Item = A::Item>,

type Item = <A as Iterator>::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 next_chunk<const N: usize>( &mut self, ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>

where Self: Sized,

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

Advances the iterator and returns an array containing the next N values.

fn count(self) -> usize

where Self: Sized,

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

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

where Self: Sized,

Consumes the iterator, returning the last element.

fn advance_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

Advances the iterator by n elements.

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

Returns the nth element of the iterator.

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

where Self: Sized,

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 Self: Sized, 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 Self: Sized, U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs.

fn intersperse(self, separator: Self::Item) -> Intersperse<Self>

where Self: Sized, Self::Item: Clone,

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

Creates a new iterator which places a copy of separator between adjacent items of the original iterator.

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>

where Self: Sized, G: FnMut() -> Self::Item,

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

Creates a new iterator which places an item generated by separator between adjacent items of the original iterator.

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

where Self: Sized, 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 Self: Sized, F: FnMut(Self::Item),

Calls a closure on each element of an iterator.

fn filter<P>(self, predicate: P) -> Filter<Self, P>

where Self: Sized, 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 Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both filters and maps.

fn enumerate(self) -> Enumerate<Self>

where Self: Sized,

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

fn peekable(self) -> Peekable<Self>

where Self: Sized,

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See their documentation for more information.

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that skips elements based on a predicate.

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>

where Self: Sized, 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 Self: Sized, P: FnMut(Self::Item) -> Option<B>,

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

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

where Self: Sized,

Creates an iterator that skips the first n elements.

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

where Self: Sized,

Creates an iterator that yields the first n elements, or fewer if the underlying iterator ends sooner.

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>

where Self: Sized, F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but unlike fold, produces a new iterator.

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>

where Self: Sized, U: IntoIterator, F: FnMut(Self::Item) -> U,

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

fn flatten(self) -> Flatten<Self>

where Self: Sized, Self::Item: IntoIterator,

Creates an iterator that flattens nested structure.

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>

where Self: Sized, F: FnMut(&[Self::Item; N]) -> R,

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

Calls the given function f for each contiguous window of size N over self and returns an iterator over the outputs of f. Like slice::windows(), the windows during mapping overlap as well.

fn fuse(self) -> Fuse<Self>

where Self: Sized,

Creates an iterator which ends after the first None.

fn inspect<F>(self, f: F) -> Inspect<Self, F>

where Self: Sized, F: FnMut(&Self::Item),

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

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

where Self: Sized,

Creates a “by reference” adapter for this instance of Iterator.

fn collect<B>(self) -> B

where B: FromIterator<Self::Item>, Self: Sized,

Transforms an iterator into a collection.

fn try_collect<B>( &mut self, ) -> <<Self::Item as Try>::Residual as Residual<B>>::TryType

where Self: Sized, Self::Item: Try, <Self::Item as Try>::Residual: Residual<B>, B: FromIterator<<Self::Item as Try>::Output>,

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

Fallibly transforms an iterator into a collection, short circuiting if a failure is encountered.

fn collect_into<E>(self, collection: &mut E) -> &mut E

where E: Extend<Self::Item>, Self: Sized,

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

Collects all the items from an iterator into a collection.

fn partition<B, F>(self, f: F) -> (B, B)

where Self: Sized, 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 T: 'a, Self: Sized + DoubleEndedIterator<Item = &'a mut T>, P: FnMut(&T) -> bool,

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

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 Self: Sized, P: FnMut(Self::Item) -> bool,

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

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 Self: Sized, F: FnMut(B, Self::Item) -> R, R: Try<Output = 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 Self: Sized, F: FnMut(Self::Item) -> R, R: Try<Output = ()>,

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 Self: Sized, F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, returning the final result.

fn reduce<F>(self, f: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Self::Item,

Reduces the elements to a single one, by repeatedly applying a reducing operation.

fn try_reduce<R>( &mut self, f: impl FnMut(Self::Item, Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType

where Self: Sized, R: Try<Output = Self::Item>, <R as Try>::Residual: Residual<Option<Self::Item>>,

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

Reduces the elements to a single one by repeatedly applying a reducing operation. If the closure returns a failure, the failure is propagated back to the caller immediately.

fn all<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate.

fn any<F>(&mut self, f: F) -> bool

where Self: Sized, 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 Self: Sized, 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 Self: Sized, F: FnMut(Self::Item) -> Option<B>,

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

fn try_find<R>( &mut self, f: impl FnMut(&Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType

where Self: Sized, R: Try<Output = bool>, <R as Try>::Residual: Residual<Option<Self::Item>>,

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

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 Self: Sized, 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: Sized + ExactSizeIterator + DoubleEndedIterator,

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

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

where Self: Sized, Self::Item: Ord,

Returns the maximum element of an iterator.

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

where Self: Sized, 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, Self: Sized, 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 Self: Sized, 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, Self: Sized, 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 Self: Sized, 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: Sized + 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: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers.

fn copied<'a, T>(self) -> Copied<Self>

where T: 'a + Copy, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements.

fn cloned<'a, T>(self) -> Cloned<Self>

where T: 'a + Clone, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements.

fn cycle(self) -> Cycle<Self>

where Self: Sized + Clone,

Repeats an iterator endlessly.

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>

where Self: Sized,

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

Returns an iterator over N elements of the iterator at a time.

fn sum<S>(self) -> S

where Self: Sized, S: Sum<Self::Item>,

Sums the elements of an iterator.

fn product<P>(self) -> P

where Self: Sized, 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, Self: Sized,

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

fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬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>, Self: Sized,

Lexicographically compares the PartialOrd elements of this Iterator with those of another. The comparison works like short-circuit evaluation, returning a result without comparing the remaining elements. As soon as an order can be determined, the evaluation stops and a result is returned.

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬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>, Self: Sized,

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 Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬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>, Self: Sized,

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

fn lt<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

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>, Self: Sized,

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>, Self: Sized,

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>, Self: Sized,

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

fn is_sorted(self) -> bool

where Self: Sized, Self::Item: PartialOrd,

Checks if the elements of this iterator are sorted.

fn is_sorted_by<F>(self, compare: F) -> bool

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> bool,

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 Self: Sized, F: FnMut(Self::Item) -> K, K: PartialOrd,

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, M: Ord, N: Ord, O: Ord, P: Ord, Q: Ord, R: Ord, S: Ord, T: Ord, U: Ord, V: Ord, W: Ord, X: Ord, Y: Ord, Z: Ord, Aa: Ord> Ord for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

fn cmp( &self, other: &Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>, ) -> 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<A: PartialEq, B: PartialEq, C: PartialEq, D: PartialEq, E: PartialEq, F: PartialEq, G: PartialEq, H: PartialEq, I: PartialEq, J: PartialEq, K: PartialEq, L: PartialEq, M: PartialEq, N: PartialEq, O: PartialEq, P: PartialEq, Q: PartialEq, R: PartialEq, S: PartialEq, T: PartialEq, U: PartialEq, V: PartialEq, W: PartialEq, X: PartialEq, Y: PartialEq, Z: PartialEq, Aa: PartialEq> PartialEq for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

fn eq( &self, other: &Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>, ) -> 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<A: PartialOrd, B: PartialOrd, C: PartialOrd, D: PartialOrd, E: PartialOrd, F: PartialOrd, G: PartialOrd, H: PartialOrd, I: PartialOrd, J: PartialOrd, K: PartialOrd, L: PartialOrd, M: PartialOrd, N: PartialOrd, O: PartialOrd, P: PartialOrd, Q: PartialOrd, R: PartialOrd, S: PartialOrd, T: PartialOrd, U: PartialOrd, V: PartialOrd, W: PartialOrd, X: PartialOrd, Y: PartialOrd, Z: PartialOrd, Aa: PartialOrd> PartialOrd for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

fn partial_cmp( &self, other: &Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>, ) -> 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, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa> Serialize for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

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, M: Serialize, N: Serialize, O: Serialize, P: Serialize, Q: Serialize, R: Serialize, S: Serialize, T: Serialize, U: Serialize, V: Serialize, W: Serialize, X: Serialize, Y: Serialize, Z: Serialize, Aa: 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: Copy, B: Copy, C: Copy, D: Copy, E: Copy, F: Copy, G: Copy, H: Copy, I: Copy, J: Copy, K: Copy, L: Copy, M: Copy, N: Copy, O: Copy, P: Copy, Q: Copy, R: Copy, S: Copy, T: Copy, U: Copy, V: Copy, W: Copy, X: Copy, Y: Copy, Z: Copy, Aa: Copy> Copy for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

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, M: Eq, N: Eq, O: Eq, P: Eq, Q: Eq, R: Eq, S: Eq, T: Eq, U: Eq, V: Eq, W: Eq, X: Eq, Y: Eq, Z: Eq, Aa: Eq> Eq for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa> StructuralPartialEq for Sum27<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, Aa>