[−][src]Enum sum::Sum17
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)
Methods
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
[src]
pub fn is_a(&self) -> bool
[src]
pub fn a(self) -> Option<A>
[src]
pub fn is_b(&self) -> bool
[src]
pub fn b(self) -> Option<B>
[src]
pub fn is_c(&self) -> bool
[src]
pub fn c(self) -> Option<C>
[src]
pub fn is_d(&self) -> bool
[src]
pub fn d(self) -> Option<D>
[src]
pub fn is_e(&self) -> bool
[src]
pub fn e(self) -> Option<E>
[src]
pub fn is_f(&self) -> bool
[src]
pub fn f(self) -> Option<F>
[src]
pub fn is_g(&self) -> bool
[src]
pub fn g(self) -> Option<G>
[src]
pub fn is_h(&self) -> bool
[src]
pub fn h(self) -> Option<H>
[src]
pub fn is_i(&self) -> bool
[src]
pub fn i(self) -> Option<I>
[src]
pub fn is_j(&self) -> bool
[src]
pub fn j(self) -> Option<J>
[src]
pub fn is_k(&self) -> bool
[src]
pub fn k(self) -> Option<K>
[src]
pub fn is_l(&self) -> bool
[src]
pub fn l(self) -> Option<L>
[src]
pub fn is_m(&self) -> bool
[src]
pub fn m(self) -> Option<M>
[src]
pub fn is_n(&self) -> bool
[src]
pub fn n(self) -> Option<N>
[src]
pub fn is_o(&self) -> bool
[src]
pub fn o(self) -> Option<O>
[src]
pub fn is_p(&self) -> bool
[src]
pub fn p(self) -> Option<P>
[src]
pub fn is_q(&self) -> bool
[src]
pub fn q(self) -> Option<Q>
[src]
ⓘImportant traits for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>pub fn as_ref(
&self
) -> Sum17<&A, &B, &C, &D, &E, &F, &G, &H, &I, &J, &K, &L, &M, &N, &O, &P, &Q>
[src]
&self
) -> Sum17<&A, &B, &C, &D, &E, &F, &G, &H, &I, &J, &K, &L, &M, &N, &O, &P, &Q>
ⓘImportant traits for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>pub fn as_mut(
&mut self
) -> Sum17<&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>
[src]
&mut self
) -> Sum17<&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>
impl<A> Sum17<A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A>
[src]
pub fn into_inner(self) -> A
[src]
Trait Implementations
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> Eq for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
[src]
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> Clone for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
[src]
ⓘImportant traits for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>fn clone(&self) -> Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
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> Copy for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
[src]
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> PartialOrd<Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>> for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
[src]
fn partial_cmp(
&self,
other: &Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
) -> Option<Ordering>
[src]
&self,
other: &Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
) -> Option<Ordering>
fn lt(
&self,
other: &Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
) -> bool
[src]
&self,
other: &Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
) -> bool
fn le(
&self,
other: &Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
) -> bool
[src]
&self,
other: &Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
) -> bool
fn gt(
&self,
other: &Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
) -> bool
[src]
&self,
other: &Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
) -> bool
fn ge(
&self,
other: &Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
) -> bool
[src]
&self,
other: &Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
) -> bool
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, Target> AsMut<Target> for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> 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>,
[src]
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>,
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> Iterator for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> 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>,
[src]
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>,
type Item = A::Item
The type of the elements being iterated over.
fn next(&mut self) -> Option<Self::Item>
[src]
fn size_hint(&self) -> (usize, Option<usize>)
[src]
fn count(self) -> usize
1.0.0[src]
Consumes the iterator, counting the number of iterations and returning it. Read more
fn last(self) -> Option<Self::Item>
1.0.0[src]
Consumes the iterator, returning the last element. Read more
fn nth(&mut self, n: usize) -> Option<Self::Item>
1.0.0[src]
Returns the n
th element of the iterator. Read more
fn step_by(self, step: usize) -> StepBy<Self>
1.28.0[src]
Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Read more
fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator<Item = Self::Item>,
1.0.0[src]
U: IntoIterator<Item = Self::Item>,
Takes two iterators and creates a new iterator over both in sequence. Read more
fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator,
1.0.0[src]
U: IntoIterator,
'Zips up' two iterators into a single iterator of pairs. Read more
fn map<B, F>(self, f: F) -> Map<Self, F> where
F: FnMut(Self::Item) -> B,
1.0.0[src]
F: FnMut(Self::Item) -> B,
Takes a closure and creates an iterator which calls that closure on each element. Read more
fn for_each<F>(self, f: F) where
F: FnMut(Self::Item),
1.21.0[src]
F: FnMut(Self::Item),
Calls a closure on each element of an iterator. Read more
fn filter<P>(self, predicate: P) -> Filter<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
Creates an iterator which uses a closure to determine if an element should be yielded. Read more
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
F: FnMut(Self::Item) -> Option<B>,
1.0.0[src]
F: FnMut(Self::Item) -> Option<B>,
Creates an iterator that both filters and maps. Read more
fn enumerate(self) -> Enumerate<Self>
1.0.0[src]
Creates an iterator which gives the current iteration count as well as the next value. Read more
fn peekable(self) -> Peekable<Self>
1.0.0[src]
Creates an iterator which can use peek
to look at the next element of the iterator without consuming it. Read more
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
Creates an iterator that [skip
]s elements based on a predicate. Read more
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
Creates an iterator that yields elements based on a predicate. Read more
fn skip(self, n: usize) -> Skip<Self>
1.0.0[src]
Creates an iterator that skips the first n
elements. Read more
fn take(self, n: usize) -> Take<Self>
1.0.0[src]
Creates an iterator that yields its first n
elements. Read more
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
F: FnMut(&mut St, Self::Item) -> Option<B>,
1.0.0[src]
F: FnMut(&mut St, Self::Item) -> Option<B>,
An iterator adaptor similar to [fold
] that holds internal state and produces a new iterator. Read more
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
F: FnMut(Self::Item) -> U,
U: IntoIterator,
1.0.0[src]
F: FnMut(Self::Item) -> U,
U: IntoIterator,
Creates an iterator that works like map, but flattens nested structure. Read more
fn flatten(self) -> Flatten<Self> where
Self::Item: IntoIterator,
1.29.0[src]
Self::Item: IntoIterator,
Creates an iterator that flattens nested structure. Read more
fn fuse(self) -> Fuse<Self>
1.0.0[src]
Creates an iterator which ends after the first [None
]. Read more
fn inspect<F>(self, f: F) -> Inspect<Self, F> where
F: FnMut(&Self::Item),
1.0.0[src]
F: FnMut(&Self::Item),
Do something with each element of an iterator, passing the value on. Read more
fn by_ref(&mut self) -> &mut Self
1.0.0[src]
Borrows an iterator, rather than consuming it. Read more
#[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>,
1.0.0[src]
B: FromIterator<Self::Item>,
Transforms an iterator into a collection. Read more
fn partition<B, F>(self, f: F) -> (B, B) where
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
1.0.0[src]
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
Consumes an iterator, creating two collections from it. Read more
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = B>,
1.27.0[src]
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. Read more
fn try_for_each<F, R>(&mut self, f: F) -> R where
F: FnMut(Self::Item) -> R,
R: Try<Ok = ()>,
1.27.0[src]
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. Read more
fn fold<B, F>(self, init: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B,
1.0.0[src]
F: FnMut(B, Self::Item) -> B,
An iterator method that applies a function, producing a single, final value. Read more
fn all<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0[src]
F: FnMut(Self::Item) -> bool,
Tests if every element of the iterator matches a predicate. Read more
fn any<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0[src]
F: FnMut(Self::Item) -> bool,
Tests if any element of the iterator matches a predicate. Read more
fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
Searches for an element of an iterator that satisfies a predicate. Read more
fn find_map<B, F>(&mut self, f: F) -> Option<B> where
F: FnMut(Self::Item) -> Option<B>,
1.30.0[src]
F: FnMut(Self::Item) -> Option<B>,
Applies function to the elements of iterator and returns the first non-none result. Read more
fn position<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
1.0.0[src]
P: FnMut(Self::Item) -> bool,
Searches for an element in an iterator, returning its index. Read more
fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
1.0.0[src]
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
Searches for an element in an iterator from the right, returning its index. Read more
fn max(self) -> Option<Self::Item> where
Self::Item: Ord,
1.0.0[src]
Self::Item: Ord,
Returns the maximum element of an iterator. Read more
fn min(self) -> Option<Self::Item> where
Self::Item: Ord,
1.0.0[src]
Self::Item: Ord,
Returns the minimum element of an iterator. Read more
fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B,
1.6.0[src]
B: Ord,
F: FnMut(&Self::Item) -> B,
Returns the element that gives the maximum value from the specified function. Read more
fn max_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
1.15.0[src]
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Returns the element that gives the maximum value with respect to the specified comparison function. Read more
fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B,
1.6.0[src]
B: Ord,
F: FnMut(&Self::Item) -> B,
Returns the element that gives the minimum value from the specified function. Read more
fn min_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
1.15.0[src]
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Returns the element that gives the minimum value with respect to the specified comparison function. Read more
fn rev(self) -> Rev<Self> where
Self: DoubleEndedIterator,
1.0.0[src]
Self: DoubleEndedIterator,
Reverses an iterator's direction. Read more
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
1.0.0[src]
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
Converts an iterator of pairs into a pair of containers. Read more
fn copied<'a, T>(self) -> Copied<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Copy,
[src]
Self: Iterator<Item = &'a T>,
T: 'a + Copy,
iter_copied
)Creates an iterator which copies all of its elements. Read more
fn cloned<'a, T>(self) -> Cloned<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
1.0.0[src]
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
Creates an iterator which [clone
]s all of its elements. Read more
fn cycle(self) -> Cycle<Self> where
Self: Clone,
1.0.0[src]
Self: Clone,
Repeats an iterator endlessly. Read more
fn sum<S>(self) -> S where
S: Sum<Self::Item>,
1.11.0[src]
S: Sum<Self::Item>,
Sums the elements of an iterator. Read more
fn product<P>(self) -> P where
P: Product<Self::Item>,
1.11.0[src]
P: Product<Self::Item>,
Iterates over the entire iterator, multiplying all the elements Read more
fn cmp<I>(self, other: I) -> Ordering where
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
1.5.0[src]
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
Lexicographically compares the elements of this Iterator
with those of another. Read more
fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Lexicographically compares the elements of this Iterator
with those of another. Read more
fn eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are equal to those of another. Read more
fn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are unequal to those of another. Read more
fn lt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically less than those of another. Read more
fn le<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
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. Read more
fn gt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically greater than those of another. Read more
fn ge<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
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. Read more
fn is_sorted(self) -> bool where
Self::Item: PartialOrd<Self::Item>,
[src]
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. Read more
fn is_sorted_by<F>(self, compare: F) -> bool where
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,
[src]
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. Read more
fn is_sorted_by_key<F, K>(self, f: F) -> bool where
F: FnMut(&Self::Item) -> K,
K: PartialOrd<K>,
[src]
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. Read more
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> ExactSizeIterator for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> 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>,
[src]
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>,
fn len(&self) -> usize
[src]
fn is_empty(&self) -> bool
[src]
exact_size_is_empty
)Returns whether the iterator is empty. Read more
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> PartialEq<Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>> for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
[src]
fn eq(
&self,
other: &Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
) -> bool
[src]
&self,
other: &Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
) -> bool
fn ne(
&self,
other: &Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
) -> bool
[src]
&self,
other: &Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
) -> bool
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> DoubleEndedIterator for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> 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>,
[src]
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>,
fn next_back(&mut self) -> Option<Self::Item>
[src]
fn nth_back(&mut self, n: usize) -> Option<Self::Item>
[src]
iter_nth_back
)Returns the n
th element from the end of the iterator. Read more
fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = B>,
1.27.0[src]
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. Read more
fn rfold<B, F>(self, accum: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B,
1.27.0[src]
F: FnMut(B, Self::Item) -> B,
An iterator method that reduces the iterator's elements to a single, final value, starting from the back. Read more
fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item> where
P: FnMut(&Self::Item) -> bool,
1.27.0[src]
P: FnMut(&Self::Item) -> bool,
Searches for an element of an iterator from the back that satisfies a predicate. Read more
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, Target> AsRef<Target> for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> 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>,
[src]
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>,
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> Ord for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
[src]
fn cmp(
&self,
other: &Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
) -> Ordering
[src]
&self,
other: &Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
) -> Ordering
fn max(self, other: Self) -> Self
1.21.0[src]
Compares and returns the maximum of two values. Read more
fn min(self, other: Self) -> Self
1.21.0[src]
Compares and returns the minimum of two values. Read more
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> DerefMut for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> 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>,
[src]
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>,
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> Deref for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> 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>,
[src]
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>,
type Target = A::Target
The resulting type after dereferencing.
fn deref(&self) -> &Self::Target
[src]
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> Hash for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
[src]
fn hash<__HABCDEFGHIJKLMNOPQ: Hasher>(&self, state: &mut __HABCDEFGHIJKLMNOPQ)
[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
Feeds a slice of this type into the given [Hasher
]. Read more
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> Debug for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>
[src]
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> Display for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> 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,
[src]
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,
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> Error for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> 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,
[src]
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,
fn description(&self) -> &str
[src]
fn cause(&self) -> Option<&dyn Error>
[src]
fn source(&self) -> Option<&(dyn Error + 'static)>
1.30.0[src]
The lower-level source of this error, if any. Read more
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> Serialize for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> 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,
[src]
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,
fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
__S: Serializer,
[src]
__S: Serializer,
impl<'de, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> Deserialize<'de> for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> 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>,
[src]
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>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
[src]
__D: Deserializer<'de>,
Auto Trait Implementations
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> Send for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> where
A: Send,
B: Send,
C: Send,
D: Send,
E: Send,
F: Send,
G: Send,
H: Send,
I: Send,
J: Send,
K: Send,
L: Send,
M: Send,
N: Send,
O: Send,
P: Send,
Q: Send,
A: Send,
B: Send,
C: Send,
D: Send,
E: Send,
F: Send,
G: Send,
H: Send,
I: Send,
J: Send,
K: Send,
L: Send,
M: Send,
N: Send,
O: Send,
P: Send,
Q: Send,
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> Sync for Sum17<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> where
A: Sync,
B: Sync,
C: Sync,
D: Sync,
E: Sync,
F: Sync,
G: Sync,
H: Sync,
I: Sync,
J: Sync,
K: Sync,
L: Sync,
M: Sync,
N: Sync,
O: Sync,
P: Sync,
Q: Sync,
A: Sync,
B: Sync,
C: Sync,
D: Sync,
E: Sync,
F: Sync,
G: Sync,
H: Sync,
I: Sync,
J: Sync,
K: Sync,
L: Sync,
M: Sync,
N: Sync,
O: Sync,
P: Sync,
Q: Sync,
Blanket Implementations
impl<I> IntoIterator for I where
I: Iterator,
[src]
I: Iterator,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
fn into_iter(self) -> I
[src]
impl<T, U> Into for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
impl<T> ToString for T where
T: Display + ?Sized,
[src]
T: Display + ?Sized,
impl<T> From for T
[src]
impl<T, U> TryFrom for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = !
try_from
)The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T> Borrow for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T, U> TryInto for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
try_from
)The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> BorrowMut for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> DeserializeOwned for T where
T: Deserialize<'de>,
[src]
T: Deserialize<'de>,