[−][src]Enum sum::Sum4
Variants
Implementations
impl<A, B, C, D> Sum4<A, B, C, D>
[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 as_ref(&self) -> Sum4<&A, &B, &C, &D>
[src]
pub fn as_mut(&mut self) -> Sum4<&mut A, &mut B, &mut C, &mut D>
[src]
pub fn as_pin_ref<'a>(
self: Pin<&'a Self>
) -> Sum4<Pin<&'a A>, Pin<&'a B>, Pin<&'a C>, Pin<&'a D>>
[src]
self: Pin<&'a Self>
) -> Sum4<Pin<&'a A>, Pin<&'a B>, Pin<&'a C>, Pin<&'a D>>
pub fn as_pin_mut<'a>(
self: Pin<&'a mut Self>
) -> Sum4<Pin<&'a mut A>, Pin<&'a mut B>, Pin<&'a mut C>, Pin<&'a mut D>>
[src]
self: Pin<&'a mut Self>
) -> Sum4<Pin<&'a mut A>, Pin<&'a mut B>, Pin<&'a mut C>, Pin<&'a mut D>>
impl<A> Sum4<A, A, A, A>
[src]
pub fn into_inner(self) -> A
[src]
Trait Implementations
impl<A, B, C, D, Target> AsMut<Target> for Sum4<A, B, C, D> where
A: AsMut<Target>,
B: AsMut<Target>,
C: AsMut<Target>,
D: AsMut<Target>,
[src]
A: AsMut<Target>,
B: AsMut<Target>,
C: AsMut<Target>,
D: AsMut<Target>,
impl<A, B, C, D, Target> AsRef<Target> for Sum4<A, B, C, D> where
A: AsRef<Target>,
B: AsRef<Target>,
C: AsRef<Target>,
D: AsRef<Target>,
[src]
A: AsRef<Target>,
B: AsRef<Target>,
C: AsRef<Target>,
D: AsRef<Target>,
impl<A: Clone, B: Clone, C: Clone, D: Clone> Clone for Sum4<A, B, C, D>
[src]
impl<A: Copy, B: Copy, C: Copy, D: Copy> Copy for Sum4<A, B, C, D>
[src]
impl<A: Debug, B: Debug, C: Debug, D: Debug> Debug for Sum4<A, B, C, D>
[src]
impl<A, B, C, D> Deref for Sum4<A, B, C, D> where
A: Deref,
B: Deref<Target = A::Target>,
C: Deref<Target = A::Target>,
D: Deref<Target = A::Target>,
[src]
A: Deref,
B: Deref<Target = A::Target>,
C: Deref<Target = A::Target>,
D: Deref<Target = A::Target>,
type Target = A::Target
The resulting type after dereferencing.
fn deref(&self) -> &Self::Target
[src]
impl<A, B, C, D> DerefMut for Sum4<A, B, C, D> where
A: DerefMut,
B: DerefMut<Target = A::Target>,
C: DerefMut<Target = A::Target>,
D: DerefMut<Target = A::Target>,
[src]
A: DerefMut,
B: DerefMut<Target = A::Target>,
C: DerefMut<Target = A::Target>,
D: DerefMut<Target = A::Target>,
impl<'de, A, B, C, D> Deserialize<'de> for Sum4<A, B, C, D> where
A: Deserialize<'de>,
B: Deserialize<'de>,
C: Deserialize<'de>,
D: Deserialize<'de>,
[src]
A: Deserialize<'de>,
B: Deserialize<'de>,
C: Deserialize<'de>,
D: Deserialize<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
[src]
__D: Deserializer<'de>,
impl<A, B, C, D> Display for Sum4<A, B, C, D> where
A: Display,
B: Display,
C: Display,
D: Display,
[src]
A: Display,
B: Display,
C: Display,
D: Display,
impl<A, B, C, D> DoubleEndedIterator for Sum4<A, B, C, D> where
A: DoubleEndedIterator,
B: DoubleEndedIterator<Item = A::Item>,
C: DoubleEndedIterator<Item = A::Item>,
D: DoubleEndedIterator<Item = A::Item>,
[src]
A: DoubleEndedIterator,
B: DoubleEndedIterator<Item = A::Item>,
C: DoubleEndedIterator<Item = A::Item>,
D: DoubleEndedIterator<Item = A::Item>,
fn next_back(&mut self) -> Option<Self::Item>
[src]
fn nth_back(&mut self, n: usize) -> Option<Self::Item>
1.37.0[src]
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>,
fn rfold<B, F>(self, init: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B,
1.27.0[src]
F: FnMut(B, Self::Item) -> B,
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,
impl<A: Eq, B: Eq, C: Eq, D: Eq> Eq for Sum4<A, B, C, D>
[src]
impl<A, B, C, D> Error for Sum4<A, B, C, D> where
A: Error,
B: Error,
C: Error,
D: Error,
[src]
A: Error,
B: Error,
C: Error,
D: Error,
fn description(&self) -> &str
[src]
fn cause(&self) -> Option<&dyn Error>
[src]
fn source(&self) -> Option<&(dyn Error + 'static)>
[src]
fn backtrace(&self) -> Option<&Backtrace>
[src]
impl<A, B, C, D> ExactSizeIterator for Sum4<A, B, C, D> where
A: ExactSizeIterator,
B: ExactSizeIterator<Item = A::Item>,
C: ExactSizeIterator<Item = A::Item>,
D: ExactSizeIterator<Item = A::Item>,
[src]
A: ExactSizeIterator,
B: ExactSizeIterator<Item = A::Item>,
C: ExactSizeIterator<Item = A::Item>,
D: ExactSizeIterator<Item = A::Item>,
impl<A, B, C, D> Future for Sum4<A, B, C, D> where
A: Future,
B: Future<Output = A::Output>,
C: Future<Output = A::Output>,
D: Future<Output = A::Output>,
[src]
A: Future,
B: Future<Output = A::Output>,
C: Future<Output = A::Output>,
D: 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>
[src]
impl<A: Hash, B: Hash, C: Hash, D: Hash> Hash for Sum4<A, B, C, D>
[src]
fn hash<__H: Hasher>(&self, state: &mut __H)
[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl<A, B, C, D> Iterator for Sum4<A, B, C, D> where
A: Iterator,
B: Iterator<Item = A::Item>,
C: Iterator<Item = A::Item>,
D: Iterator<Item = A::Item>,
[src]
A: Iterator,
B: Iterator<Item = A::Item>,
C: Iterator<Item = A::Item>,
D: 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]
fn last(self) -> Option<Self::Item>
1.0.0[src]
fn nth(&mut self, n: usize) -> Option<Self::Item>
1.0.0[src]
fn step_by(self, step: usize) -> StepBy<Self>
1.28.0[src]
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>,
fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator,
1.0.0[src]
U: IntoIterator,
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,
fn for_each<F>(self, f: F) where
F: FnMut(Self::Item),
1.21.0[src]
F: FnMut(Self::Item),
fn filter<P>(self, predicate: P) -> Filter<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
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>,
fn enumerate(self) -> Enumerate<Self>
1.0.0[src]
fn peekable(self) -> Peekable<Self>
1.0.0[src]
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,
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,
fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P> where
P: FnMut(Self::Item) -> Option<B>,
[src]
P: FnMut(Self::Item) -> Option<B>,
fn skip(self, n: usize) -> Skip<Self>
1.0.0[src]
fn take(self, n: usize) -> Take<Self>
1.0.0[src]
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>,
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,
fn flatten(self) -> Flatten<Self> where
Self::Item: IntoIterator,
1.29.0[src]
Self::Item: IntoIterator,
fn fuse(self) -> Fuse<Self>
1.0.0[src]
fn inspect<F>(self, f: F) -> Inspect<Self, F> where
F: FnMut(&Self::Item),
1.0.0[src]
F: FnMut(&Self::Item),
fn by_ref(&mut self) -> &mut Self
1.0.0[src]
#[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>,
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,
fn partition_in_place<'a, T, P>(self, predicate: P) -> usize where
P: FnMut(&T) -> bool,
Self: DoubleEndedIterator<Item = &'a mut T>,
T: 'a,
[src]
P: FnMut(&T) -> bool,
Self: DoubleEndedIterator<Item = &'a mut T>,
T: 'a,
fn is_partitioned<P>(self, predicate: P) -> bool where
P: FnMut(Self::Item) -> bool,
[src]
P: FnMut(Self::Item) -> bool,
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>,
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 = ()>,
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,
fn fold_first<F>(self, f: F) -> Option<Self::Item> where
F: FnMut(Self::Item, Self::Item) -> Self::Item,
[src]
F: FnMut(Self::Item, Self::Item) -> Self::Item,
fn all<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0[src]
F: FnMut(Self::Item) -> bool,
fn any<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0[src]
F: FnMut(Self::Item) -> bool,
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,
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>,
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>,
[src]
&mut self,
f: F
) -> Result<Option<Self::Item>, <R as Try>::Error> where
F: FnMut(&Self::Item) -> R,
R: Try<Ok = bool>,
fn position<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
1.0.0[src]
P: FnMut(Self::Item) -> bool,
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,
fn max(self) -> Option<Self::Item> where
Self::Item: Ord,
1.0.0[src]
Self::Item: Ord,
fn min(self) -> Option<Self::Item> where
Self::Item: Ord,
1.0.0[src]
Self::Item: Ord,
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,
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,
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,
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,
fn rev(self) -> Rev<Self> where
Self: DoubleEndedIterator,
1.0.0[src]
Self: DoubleEndedIterator,
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)>,
fn copied<'a, T>(self) -> Copied<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Copy,
1.36.0[src]
Self: Iterator<Item = &'a T>,
T: 'a + Copy,
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,
fn cycle(self) -> Cycle<Self> where
Self: Clone,
1.0.0[src]
Self: Clone,
fn sum<S>(self) -> S where
S: Sum<Self::Item>,
1.11.0[src]
S: Sum<Self::Item>,
fn product<P>(self) -> P where
P: Product<Self::Item>,
1.11.0[src]
P: Product<Self::Item>,
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,
fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering where
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
I: IntoIterator,
[src]
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
I: IntoIterator,
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>,
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,
[src]
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
I: IntoIterator,
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>,
fn eq_by<I, F>(self, other: I, eq: F) -> bool where
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
I: IntoIterator,
[src]
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
I: IntoIterator,
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>,
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>,
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>,
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>,
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>,
fn is_sorted(self) -> bool where
Self::Item: PartialOrd<Self::Item>,
[src]
Self::Item: PartialOrd<Self::Item>,
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>,
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>,
impl<A: Ord, B: Ord, C: Ord, D: Ord> Ord for Sum4<A, B, C, D>
[src]
fn cmp(&self, other: &Sum4<A, B, C, D>) -> Ordering
[src]
#[must_use]fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn min(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn clamp(self, min: Self, max: Self) -> Self
[src]
impl<A: PartialEq, B: PartialEq, C: PartialEq, D: PartialEq> PartialEq<Sum4<A, B, C, D>> for Sum4<A, B, C, D>
[src]
fn eq(&self, other: &Sum4<A, B, C, D>) -> bool
[src]
fn ne(&self, other: &Sum4<A, B, C, D>) -> bool
[src]
impl<A: PartialOrd, B: PartialOrd, C: PartialOrd, D: PartialOrd> PartialOrd<Sum4<A, B, C, D>> for Sum4<A, B, C, D>
[src]
fn partial_cmp(&self, other: &Sum4<A, B, C, D>) -> Option<Ordering>
[src]
fn lt(&self, other: &Sum4<A, B, C, D>) -> bool
[src]
fn le(&self, other: &Sum4<A, B, C, D>) -> bool
[src]
fn gt(&self, other: &Sum4<A, B, C, D>) -> bool
[src]
fn ge(&self, other: &Sum4<A, B, C, D>) -> bool
[src]
impl<A, B, C, D> Serialize for Sum4<A, B, C, D> where
A: Serialize,
B: Serialize,
C: Serialize,
D: Serialize,
[src]
A: Serialize,
B: Serialize,
C: Serialize,
D: Serialize,
fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
__S: Serializer,
[src]
__S: Serializer,
impl<A, B, C, D> StructuralEq for Sum4<A, B, C, D>
[src]
impl<A, B, C, D> StructuralPartialEq for Sum4<A, B, C, D>
[src]
Auto Trait Implementations
impl<A, B, C, D> RefUnwindSafe for Sum4<A, B, C, D> where
A: RefUnwindSafe,
B: RefUnwindSafe,
C: RefUnwindSafe,
D: RefUnwindSafe,
A: RefUnwindSafe,
B: RefUnwindSafe,
C: RefUnwindSafe,
D: RefUnwindSafe,
impl<A, B, C, D> Send for Sum4<A, B, C, D> where
A: Send,
B: Send,
C: Send,
D: Send,
A: Send,
B: Send,
C: Send,
D: Send,
impl<A, B, C, D> Sync for Sum4<A, B, C, D> where
A: Sync,
B: Sync,
C: Sync,
D: Sync,
A: Sync,
B: Sync,
C: Sync,
D: Sync,
impl<A, B, C, D> Unpin for Sum4<A, B, C, D> where
A: Unpin,
B: Unpin,
C: Unpin,
D: Unpin,
A: Unpin,
B: Unpin,
C: Unpin,
D: Unpin,
impl<A, B, C, D> UnwindSafe for Sum4<A, B, C, D> where
A: UnwindSafe,
B: UnwindSafe,
C: UnwindSafe,
D: UnwindSafe,
A: UnwindSafe,
B: UnwindSafe,
C: UnwindSafe,
D: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,
[src]
T: for<'de> Deserialize<'de>,
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<F> IntoFuture for F where
F: Future,
[src]
F: Future,
type Output = <F as Future>::Output
🔬 This is a nightly-only experimental API. (
into_future
)The output that the future will produce on completion.
type Future = F
🔬 This is a nightly-only experimental API. (
into_future
)Which kind of future are we turning this into?
fn into_future(self) -> <F as IntoFuture>::Future
[src]
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> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T> ToString for T where
T: Display + ?Sized,
[src]
T: Display + ?Sized,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
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, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,