Trait iterable::Iterable [−][src]
pub trait Iterable: Consumer { type C; type CC; type F = Self::C; type CF = Self::CC;}Show methods
fn count(self) -> usize
where
Self: Sized, { ... } fn last(self) -> Option<Self::Item>
where
Self: Sized, { ... } fn nth(self, n: usize) -> Option<Self::Item>
where
Self: Sized, { ... } fn step_by(self, step: usize) -> Self::C
where
Self: Sized,
Self::C: Producer<Self::Item>, { ... } fn chain(self, other: impl Consumer<Item = Self::Item>) -> Self::C
where
Self: Sized,
Self::C: Producer<Self::Item>, { ... } fn zip<E>(self, other: impl Consumer<Item = E>) -> Self::CC
where
Self: Sized,
Self::CC: Producer<(Self::Item, E)>, { ... } fn map<U>(self, f: impl Fn(Self::Item) -> U) -> Self::CF
where
Self: Sized,
Self::CF: Producer<U>, { ... } fn foreach(self, f: impl Fn(Self::Item))
where
Self: Sized, { ... } fn filter(self, f: impl Fn(&Self::Item) -> bool) -> Self::C
where
Self: Sized,
Self::C: Producer<Self::Item>, { ... } fn filter_map<U>(self, f: impl Fn(Self::Item) -> Option<U>) -> Self::CC
where
Self: Sized,
Self::CC: Producer<U>, { ... } fn enumerate(self) -> Self::CF
where
Self: Sized,
Self::CF: Producer<(usize, Self::Item)>, { ... } fn skip_while(self, f: impl Fn(&Self::Item) -> bool) -> Self::C
where
Self: Sized,
Self::C: Producer<Self::Item>, { ... } fn take_while(self, f: impl Fn(&Self::Item) -> bool) -> Self::C
where
Self: Sized,
Self::C: Producer<Self::Item>, { ... } fn map_while<U>(self, f: impl Fn(Self::Item) -> Option<U>) -> Self::CC
where
Self: Sized,
Self::CC: Producer<U>, { ... } fn skip(self, n: usize) -> Self::C
where
Self: Sized,
Self::C: Producer<Self::Item>, { ... } fn take(self, n: usize) -> Self::C
where
Self: Sized,
Self::C: Producer<Self::Item>, { ... } fn scan<S>(self, state: S, f: impl Fn(S, Self::Item) -> S) -> Self::CC
where
S: Clone,
Self: Sized,
Self::CC: Producer<S>, { ... } fn flat_map<U>(self, f: impl Fn(Self::Item) -> U) -> Self::CC
where
U: Consumer,
Self: Sized,
Self::CC: Producer<U::Item>, { ... } fn flatten(self) -> Self::CC
where
Self: Sized,
Self::Item: Consumer,
Self::CC: Producer<<Self::Item as Consumer>::Item>, { ... } fn by_ref(&self) -> &Self { ... } fn partition(self, f: impl Fn(&Self::Item) -> bool) -> (Self::C, Self::C)
where
Self: Sized,
Self::C: GrowableProducer<Self::Item>, { ... } fn try_fold<S, R>(self, init: S, f: impl Fn(S, Self::Item) -> R) -> R
where
Self: Sized,
R: Try<Output = S>, { ... } fn try_for_each<R>(self, f: impl Fn(Self::Item) -> R) -> R
where
Self: Sized,
R: Try<Output = ()>, { ... } fn fold<S>(self, init: S, f: impl Fn(S, Self::Item) -> S) -> S
where
Self: Sized, { ... } fn all(self, f: impl Fn(Self::Item) -> bool) -> bool
where
Self: Sized, { ... } fn any(self, f: impl Fn(Self::Item) -> bool) -> bool
where
Self: Sized, { ... } fn find(self, f: impl Fn(&Self::Item) -> bool) -> Option<Self::Item>
where
Self: Sized, { ... } fn find_map<B>(self, f: impl Fn(Self::Item) -> Option<B>) -> Option<B>
where
Self: Sized, { ... } fn position(self, f: impl Fn(Self::Item) -> bool) -> Option<usize>
where
Self: Sized, { ... } fn rposition(self, f: impl Fn(Self::Item) -> bool) -> Option<usize>
where
Self: Sized,
Self::IntoIter: ExactSizeIterator + DoubleEndedIterator, { ... } fn max(self) -> Option<Self::Item>
where
Self: Sized,
Self::Item: Ord, { ... } fn min(self) -> Option<Self::Item>
where
Self: Sized,
Self::Item: Ord, { ... } fn max_by_key<B>(self, f: impl Fn(&Self::Item) -> B) -> Option<Self::Item>
where
Self: Sized,
B: Ord, { ... } fn max_by(
self,
f: impl Fn(&Self::Item, &Self::Item) -> Ordering
) -> Option<Self::Item>
where
Self: Sized, { ... } fn min_by_key<B>(self, f: impl Fn(&Self::Item) -> B) -> Option<Self::Item>
where
Self: Sized,
B: Ord, { ... } fn min_by(
self,
f: impl Fn(&Self::Item, &Self::Item) -> Ordering
) -> Option<Self::Item>
where
Self: Sized, { ... } fn unzip<A, B>(self) -> (Self::CF, Self::CF)
where
Self: Sized,
Self: Consumer<Item = (A, B)>,
Self::CF: GrowableProducer<A>,
Self::CF: GrowableProducer<B>, { ... } fn copied<'a, T>(self) -> Self::CF
where
T: 'a + Copy,
Self: Sized,
Self: Consumer<Item = &'a T>,
Self::CF: Producer<T>, { ... } fn cloned<'a, T>(self) -> Self::CF
where
T: 'a + Clone,
Self: Sized,
Self: Consumer<Item = &'a T>,
Self::CF: Producer<T>, { ... } fn sum<S>(self) -> S
where
Self: Sized,
S: Sum<Self::Item>, { ... } fn product<S>(self) -> S
where
Self: Sized,
S: Product<Self::Item>, { ... } fn cmp<I>(self, other: I) -> Ordering
where
I: Consumer<Item = Self::Item>,
Self: Sized,
Self::Item: Ord, { ... } fn partial_cmp<I>(self, other: I) -> Option<Ordering>
where
I: Consumer,
Self: Sized,
Self::Item: PartialOrd<<I as Consumer>::Item>, { ... } fn eq<I>(self, other: I) -> bool
where
I: Consumer,
Self: Sized,
Self::Item: PartialEq<<I as Consumer>::Item>, { ... } fn ne<I>(self, other: I) -> bool
where
I: Consumer,
Self: Sized,
Self::Item: PartialEq<<I as Consumer>::Item>, { ... } fn lt<I>(self, other: I) -> bool
where
I: Consumer,
Self: Sized,
Self::Item: PartialOrd<<I as Consumer>::Item>, { ... } fn le<I>(self, other: I) -> bool
where
I: Consumer,
Self: Sized,
Self::Item: PartialOrd<<I as Consumer>::Item>, { ... } fn gt<I>(self, other: I) -> bool
where
I: Consumer,
Self: Sized,
Self::Item: PartialOrd<<I as Consumer>::Item>, { ... } fn ge<I>(self, other: I) -> bool
where
I: Consumer,
Self: Sized,
Self::Item: PartialOrd<<I as Consumer>::Item>, { ... } fn join(self, sep: &str) -> String
where
Self: Sized,
Self::Item: Display, { ... } fn add_one(self, a: Self::Item) -> Self::C
where
Self: Sized,
Self::C: GrowableProducer<Self::Item>, { ... } fn try_add_one<R>(self, r: R) -> R::Map
where
R: TryExt<Output = Self::Item>,
Self: Sized,
Self::C: GrowableProducer<Self::Item>, { ... } fn try_map<B, R, F>(self, f: F) -> R::Map
where
F: Fn(Self::Item) -> R,
R: TryExt<Output = B>,
Self: Sized,
Self::CC: GrowableProducer<B>, { ... } fn try_flat_map<B, R, F>(self, f: F) -> R::Map
where
F: Fn(Self::Item) -> R,
R: TryExt<Output = B>,
B: Consumer,
Self: Sized,
Self::CC: GrowableProducer<B::Item>, { ... } fn try_flatten(self) -> <Self::Item as TryExt>::Map
where
Self: Sized,
Self::Item: TryExt,
<Self::Item as Try>::Output: Consumer,
Self::CC: GrowableProducer<<<Self::Item as Try>::Output as Consumer>::Item>, { ... } fn lazy_step_by(self, step: usize) -> LazyStepBy<Self>
where
Self: Sized, { ... } fn lazy_chain<C: Consumer>(self, c: C) -> LazyChain<Self, C>
where
Self: Sized, { ... } fn lazy_zip<C: Consumer>(self, c: C) -> LazyZip<Self, C>
where
Self: Sized, { ... } fn lazy_filter<F: Fn(&Self::Item) -> bool>(
self,
f: F
) -> LazyFilter<Self, F>
where
Self: Sized, { ... } fn lazy_map<T, F: Fn(Self::Item) -> T>(self, f: F) -> LazyMap<Self, F>
where
Self: Sized, { ... } fn lazy_filter_map<T, F: Fn(Self::Item) -> Option<T>>(
self,
f: F
) -> LazyFilterMap<Self, F>
where
Self: Sized, { ... } fn lazy_enumerate(self) -> LazyEnumerate<Self>
where
Self: Sized, { ... } fn lazy_skip_while<F: Fn(&Self::Item) -> bool>(
self,
f: F
) -> LazySkipWhile<Self, F>
where
Self: Sized, { ... } fn lazy_map_while<T, F: Fn(Self::Item) -> Option<T>>(
self,
f: F
) -> LazyMapWhile<Self, F>
where
Self: Sized, { ... } fn lazy_skip(self, n: usize) -> LazySkip<Self>
where
Self: Sized, { ... } fn lazy_take(self, n: usize) -> LazyTake<Self>
where
Self: Sized, { ... } fn lazy_scan<S, F: Fn(S, Self::Item) -> S>(
self,
state: S,
f: F
) -> LazyScan<S, Self, F>
where
Self: Sized, { ... } fn lazy_flat_map<T: Consumer, F: Fn(Self::Item) -> T>(
self,
f: F
) -> LazyFlatMap<Self, F>
where
Self: Sized, { ... } fn lazy_flatten(self) -> LazyFlatten<Self>
where
Self: Sized,
Self::Item: Consumer, { ... } fn lazy_copied<'a, T>(self) -> LazyCopied<Self>
where
T: 'a + Copy,
Self: Sized,
Self: Consumer<Item = &'a T>, { ... } fn lazy_cloned<'a, T>(self) -> LazyCloned<Self>
where
T: 'a + Clone,
Self: Sized,
Self: Consumer<Item = &'a T>, { ... } fn lazy_cycle(self) -> LazyCycle<Self>
where
Self: Sized,
Self::IntoIter: Clone, { ... }
Associated Types
Provided methods
fn count(self) -> usize where
Self: Sized,
[src]
fn count(self) -> usize where
Self: Sized,
[src]fn last(self) -> Option<Self::Item> where
Self: Sized,
[src]
fn last(self) -> Option<Self::Item> where
Self: Sized,
[src]fn nth(self, n: usize) -> Option<Self::Item> where
Self: Sized,
[src]
fn nth(self, n: usize) -> Option<Self::Item> where
Self: Sized,
[src]fn step_by(self, step: usize) -> Self::C where
Self: Sized,
Self::C: Producer<Self::Item>,
[src]
fn step_by(self, step: usize) -> Self::C where
Self: Sized,
Self::C: Producer<Self::Item>,
[src]fn chain(self, other: impl Consumer<Item = Self::Item>) -> Self::C where
Self: Sized,
Self::C: Producer<Self::Item>,
[src]
fn chain(self, other: impl Consumer<Item = Self::Item>) -> Self::C where
Self: Sized,
Self::C: Producer<Self::Item>,
[src]fn zip<E>(self, other: impl Consumer<Item = E>) -> Self::CC where
Self: Sized,
Self::CC: Producer<(Self::Item, E)>,
[src]
fn zip<E>(self, other: impl Consumer<Item = E>) -> Self::CC where
Self: Sized,
Self::CC: Producer<(Self::Item, E)>,
[src]fn map<U>(self, f: impl Fn(Self::Item) -> U) -> Self::CF where
Self: Sized,
Self::CF: Producer<U>,
[src]
fn map<U>(self, f: impl Fn(Self::Item) -> U) -> Self::CF where
Self: Sized,
Self::CF: Producer<U>,
[src]fn foreach(self, f: impl Fn(Self::Item)) where
Self: Sized,
[src]
fn foreach(self, f: impl Fn(Self::Item)) where
Self: Sized,
[src]fn filter(self, f: impl Fn(&Self::Item) -> bool) -> Self::C where
Self: Sized,
Self::C: Producer<Self::Item>,
[src]
fn filter(self, f: impl Fn(&Self::Item) -> bool) -> Self::C where
Self: Sized,
Self::C: Producer<Self::Item>,
[src]fn filter_map<U>(self, f: impl Fn(Self::Item) -> Option<U>) -> Self::CC where
Self: Sized,
Self::CC: Producer<U>,
[src]
fn filter_map<U>(self, f: impl Fn(Self::Item) -> Option<U>) -> Self::CC where
Self: Sized,
Self::CC: Producer<U>,
[src]fn enumerate(self) -> Self::CF where
Self: Sized,
Self::CF: Producer<(usize, Self::Item)>,
[src]
fn enumerate(self) -> Self::CF where
Self: Sized,
Self::CF: Producer<(usize, Self::Item)>,
[src]fn skip_while(self, f: impl Fn(&Self::Item) -> bool) -> Self::C where
Self: Sized,
Self::C: Producer<Self::Item>,
[src]
fn skip_while(self, f: impl Fn(&Self::Item) -> bool) -> Self::C where
Self: Sized,
Self::C: Producer<Self::Item>,
[src]fn take_while(self, f: impl Fn(&Self::Item) -> bool) -> Self::C where
Self: Sized,
Self::C: Producer<Self::Item>,
[src]
fn take_while(self, f: impl Fn(&Self::Item) -> bool) -> Self::C where
Self: Sized,
Self::C: Producer<Self::Item>,
[src]fn map_while<U>(self, f: impl Fn(Self::Item) -> Option<U>) -> Self::CC where
Self: Sized,
Self::CC: Producer<U>,
[src]
fn map_while<U>(self, f: impl Fn(Self::Item) -> Option<U>) -> Self::CC where
Self: Sized,
Self::CC: Producer<U>,
[src]fn skip(self, n: usize) -> Self::C where
Self: Sized,
Self::C: Producer<Self::Item>,
[src]
fn skip(self, n: usize) -> Self::C where
Self: Sized,
Self::C: Producer<Self::Item>,
[src]fn take(self, n: usize) -> Self::C where
Self: Sized,
Self::C: Producer<Self::Item>,
[src]
fn take(self, n: usize) -> Self::C where
Self: Sized,
Self::C: Producer<Self::Item>,
[src]fn scan<S>(self, state: S, f: impl Fn(S, Self::Item) -> S) -> Self::CC where
S: Clone,
Self: Sized,
Self::CC: Producer<S>,
[src]
fn scan<S>(self, state: S, f: impl Fn(S, Self::Item) -> S) -> Self::CC where
S: Clone,
Self: Sized,
Self::CC: Producer<S>,
[src]fn flat_map<U>(self, f: impl Fn(Self::Item) -> U) -> Self::CC where
U: Consumer,
Self: Sized,
Self::CC: Producer<U::Item>,
[src]
fn flat_map<U>(self, f: impl Fn(Self::Item) -> U) -> Self::CC where
U: Consumer,
Self: Sized,
Self::CC: Producer<U::Item>,
[src]fn flatten(self) -> Self::CC where
Self: Sized,
Self::Item: Consumer,
Self::CC: Producer<<Self::Item as Consumer>::Item>,
[src]
fn flatten(self) -> Self::CC where
Self: Sized,
Self::Item: Consumer,
Self::CC: Producer<<Self::Item as Consumer>::Item>,
[src]fn by_ref(&self) -> &Self
[src]
fn by_ref(&self) -> &Self
[src]fn partition(self, f: impl Fn(&Self::Item) -> bool) -> (Self::C, Self::C) where
Self: Sized,
Self::C: GrowableProducer<Self::Item>,
[src]
fn partition(self, f: impl Fn(&Self::Item) -> bool) -> (Self::C, Self::C) where
Self: Sized,
Self::C: GrowableProducer<Self::Item>,
[src]fn try_fold<S, R>(self, init: S, f: impl Fn(S, Self::Item) -> R) -> R where
Self: Sized,
R: Try<Output = S>,
[src]
fn try_fold<S, R>(self, init: S, f: impl Fn(S, Self::Item) -> R) -> R where
Self: Sized,
R: Try<Output = S>,
[src]fn try_for_each<R>(self, f: impl Fn(Self::Item) -> R) -> R where
Self: Sized,
R: Try<Output = ()>,
[src]
fn try_for_each<R>(self, f: impl Fn(Self::Item) -> R) -> R where
Self: Sized,
R: Try<Output = ()>,
[src]fn fold<S>(self, init: S, f: impl Fn(S, Self::Item) -> S) -> S where
Self: Sized,
[src]
fn fold<S>(self, init: S, f: impl Fn(S, Self::Item) -> S) -> S where
Self: Sized,
[src]fn all(self, f: impl Fn(Self::Item) -> bool) -> bool where
Self: Sized,
[src]
fn all(self, f: impl Fn(Self::Item) -> bool) -> bool where
Self: Sized,
[src]fn any(self, f: impl Fn(Self::Item) -> bool) -> bool where
Self: Sized,
[src]
fn any(self, f: impl Fn(Self::Item) -> bool) -> bool where
Self: Sized,
[src]fn find(self, f: impl Fn(&Self::Item) -> bool) -> Option<Self::Item> where
Self: Sized,
[src]
fn find(self, f: impl Fn(&Self::Item) -> bool) -> Option<Self::Item> where
Self: Sized,
[src]fn find_map<B>(self, f: impl Fn(Self::Item) -> Option<B>) -> Option<B> where
Self: Sized,
[src]
fn find_map<B>(self, f: impl Fn(Self::Item) -> Option<B>) -> Option<B> where
Self: Sized,
[src]fn position(self, f: impl Fn(Self::Item) -> bool) -> Option<usize> where
Self: Sized,
[src]
fn position(self, f: impl Fn(Self::Item) -> bool) -> Option<usize> where
Self: Sized,
[src]fn rposition(self, f: impl Fn(Self::Item) -> bool) -> Option<usize> where
Self: Sized,
Self::IntoIter: ExactSizeIterator + DoubleEndedIterator,
[src]
fn rposition(self, f: impl Fn(Self::Item) -> bool) -> Option<usize> where
Self: Sized,
Self::IntoIter: ExactSizeIterator + DoubleEndedIterator,
[src]fn max(self) -> Option<Self::Item> where
Self: Sized,
Self::Item: Ord,
[src]
fn max(self) -> Option<Self::Item> where
Self: Sized,
Self::Item: Ord,
[src]fn min(self) -> Option<Self::Item> where
Self: Sized,
Self::Item: Ord,
[src]
fn min(self) -> Option<Self::Item> where
Self: Sized,
Self::Item: Ord,
[src]fn max_by_key<B>(self, f: impl Fn(&Self::Item) -> B) -> Option<Self::Item> where
Self: Sized,
B: Ord,
[src]
fn max_by_key<B>(self, f: impl Fn(&Self::Item) -> B) -> Option<Self::Item> where
Self: Sized,
B: Ord,
[src]fn max_by(
self,
f: impl Fn(&Self::Item, &Self::Item) -> Ordering
) -> Option<Self::Item> where
Self: Sized,
[src]
fn max_by(
self,
f: impl Fn(&Self::Item, &Self::Item) -> Ordering
) -> Option<Self::Item> where
Self: Sized,
[src]fn min_by_key<B>(self, f: impl Fn(&Self::Item) -> B) -> Option<Self::Item> where
Self: Sized,
B: Ord,
[src]
fn min_by_key<B>(self, f: impl Fn(&Self::Item) -> B) -> Option<Self::Item> where
Self: Sized,
B: Ord,
[src]fn min_by(
self,
f: impl Fn(&Self::Item, &Self::Item) -> Ordering
) -> Option<Self::Item> where
Self: Sized,
[src]
fn min_by(
self,
f: impl Fn(&Self::Item, &Self::Item) -> Ordering
) -> Option<Self::Item> where
Self: Sized,
[src]fn unzip<A, B>(self) -> (Self::CF, Self::CF) where
Self: Sized,
Self: Consumer<Item = (A, B)>,
Self::CF: GrowableProducer<A>,
Self::CF: GrowableProducer<B>,
[src]
fn unzip<A, B>(self) -> (Self::CF, Self::CF) where
Self: Sized,
Self: Consumer<Item = (A, B)>,
Self::CF: GrowableProducer<A>,
Self::CF: GrowableProducer<B>,
[src]fn copied<'a, T>(self) -> Self::CF where
T: 'a + Copy,
Self: Sized,
Self: Consumer<Item = &'a T>,
Self::CF: Producer<T>,
[src]
fn copied<'a, T>(self) -> Self::CF where
T: 'a + Copy,
Self: Sized,
Self: Consumer<Item = &'a T>,
Self::CF: Producer<T>,
[src]fn cloned<'a, T>(self) -> Self::CF where
T: 'a + Clone,
Self: Sized,
Self: Consumer<Item = &'a T>,
Self::CF: Producer<T>,
[src]
fn cloned<'a, T>(self) -> Self::CF where
T: 'a + Clone,
Self: Sized,
Self: Consumer<Item = &'a T>,
Self::CF: Producer<T>,
[src]fn sum<S>(self) -> S where
Self: Sized,
S: Sum<Self::Item>,
[src]
fn sum<S>(self) -> S where
Self: Sized,
S: Sum<Self::Item>,
[src]fn product<S>(self) -> S where
Self: Sized,
S: Product<Self::Item>,
[src]
fn product<S>(self) -> S where
Self: Sized,
S: Product<Self::Item>,
[src]fn cmp<I>(self, other: I) -> Ordering where
I: Consumer<Item = Self::Item>,
Self: Sized,
Self::Item: Ord,
[src]
fn cmp<I>(self, other: I) -> Ordering where
I: Consumer<Item = Self::Item>,
Self: Sized,
Self::Item: Ord,
[src]fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: Consumer,
Self: Sized,
Self::Item: PartialOrd<<I as Consumer>::Item>,
[src]
fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: Consumer,
Self: Sized,
Self::Item: PartialOrd<<I as Consumer>::Item>,
[src]fn eq<I>(self, other: I) -> bool where
I: Consumer,
Self: Sized,
Self::Item: PartialEq<<I as Consumer>::Item>,
[src]
fn eq<I>(self, other: I) -> bool where
I: Consumer,
Self: Sized,
Self::Item: PartialEq<<I as Consumer>::Item>,
[src]fn ne<I>(self, other: I) -> bool where
I: Consumer,
Self: Sized,
Self::Item: PartialEq<<I as Consumer>::Item>,
[src]
fn ne<I>(self, other: I) -> bool where
I: Consumer,
Self: Sized,
Self::Item: PartialEq<<I as Consumer>::Item>,
[src]fn lt<I>(self, other: I) -> bool where
I: Consumer,
Self: Sized,
Self::Item: PartialOrd<<I as Consumer>::Item>,
[src]
fn lt<I>(self, other: I) -> bool where
I: Consumer,
Self: Sized,
Self::Item: PartialOrd<<I as Consumer>::Item>,
[src]fn le<I>(self, other: I) -> bool where
I: Consumer,
Self: Sized,
Self::Item: PartialOrd<<I as Consumer>::Item>,
[src]
fn le<I>(self, other: I) -> bool where
I: Consumer,
Self: Sized,
Self::Item: PartialOrd<<I as Consumer>::Item>,
[src]fn gt<I>(self, other: I) -> bool where
I: Consumer,
Self: Sized,
Self::Item: PartialOrd<<I as Consumer>::Item>,
[src]
fn gt<I>(self, other: I) -> bool where
I: Consumer,
Self: Sized,
Self::Item: PartialOrd<<I as Consumer>::Item>,
[src]fn ge<I>(self, other: I) -> bool where
I: Consumer,
Self: Sized,
Self::Item: PartialOrd<<I as Consumer>::Item>,
[src]
fn ge<I>(self, other: I) -> bool where
I: Consumer,
Self: Sized,
Self::Item: PartialOrd<<I as Consumer>::Item>,
[src]fn join(self, sep: &str) -> String where
Self: Sized,
Self::Item: Display,
[src]
fn join(self, sep: &str) -> String where
Self: Sized,
Self::Item: Display,
[src]fn add_one(self, a: Self::Item) -> Self::C where
Self: Sized,
Self::C: GrowableProducer<Self::Item>,
[src]
fn add_one(self, a: Self::Item) -> Self::C where
Self: Sized,
Self::C: GrowableProducer<Self::Item>,
[src]fn try_add_one<R>(self, r: R) -> R::Map where
R: TryExt<Output = Self::Item>,
Self: Sized,
Self::C: GrowableProducer<Self::Item>,
[src]
fn try_add_one<R>(self, r: R) -> R::Map where
R: TryExt<Output = Self::Item>,
Self: Sized,
Self::C: GrowableProducer<Self::Item>,
[src]fn try_map<B, R, F>(self, f: F) -> R::Map where
F: Fn(Self::Item) -> R,
R: TryExt<Output = B>,
Self: Sized,
Self::CC: GrowableProducer<B>,
[src]
fn try_map<B, R, F>(self, f: F) -> R::Map where
F: Fn(Self::Item) -> R,
R: TryExt<Output = B>,
Self: Sized,
Self::CC: GrowableProducer<B>,
[src]fn try_flat_map<B, R, F>(self, f: F) -> R::Map where
F: Fn(Self::Item) -> R,
R: TryExt<Output = B>,
B: Consumer,
Self: Sized,
Self::CC: GrowableProducer<B::Item>,
[src]
fn try_flat_map<B, R, F>(self, f: F) -> R::Map where
F: Fn(Self::Item) -> R,
R: TryExt<Output = B>,
B: Consumer,
Self: Sized,
Self::CC: GrowableProducer<B::Item>,
[src]fn try_flatten(self) -> <Self::Item as TryExt>::Map where
Self: Sized,
Self::Item: TryExt,
<Self::Item as Try>::Output: Consumer,
Self::CC: GrowableProducer<<<Self::Item as Try>::Output as Consumer>::Item>,
[src]
fn try_flatten(self) -> <Self::Item as TryExt>::Map where
Self: Sized,
Self::Item: TryExt,
<Self::Item as Try>::Output: Consumer,
Self::CC: GrowableProducer<<<Self::Item as Try>::Output as Consumer>::Item>,
[src]fn lazy_step_by(self, step: usize) -> LazyStepBy<Self> where
Self: Sized,
[src]
fn lazy_step_by(self, step: usize) -> LazyStepBy<Self> where
Self: Sized,
[src]fn lazy_chain<C: Consumer>(self, c: C) -> LazyChain<Self, C> where
Self: Sized,
[src]
fn lazy_chain<C: Consumer>(self, c: C) -> LazyChain<Self, C> where
Self: Sized,
[src]fn lazy_zip<C: Consumer>(self, c: C) -> LazyZip<Self, C> where
Self: Sized,
[src]
fn lazy_zip<C: Consumer>(self, c: C) -> LazyZip<Self, C> where
Self: Sized,
[src]fn lazy_filter<F: Fn(&Self::Item) -> bool>(self, f: F) -> LazyFilter<Self, F> where
Self: Sized,
[src]
fn lazy_filter<F: Fn(&Self::Item) -> bool>(self, f: F) -> LazyFilter<Self, F> where
Self: Sized,
[src]fn lazy_map<T, F: Fn(Self::Item) -> T>(self, f: F) -> LazyMap<Self, F> where
Self: Sized,
[src]
fn lazy_map<T, F: Fn(Self::Item) -> T>(self, f: F) -> LazyMap<Self, F> where
Self: Sized,
[src]fn lazy_filter_map<T, F: Fn(Self::Item) -> Option<T>>(
self,
f: F
) -> LazyFilterMap<Self, F> where
Self: Sized,
[src]
fn lazy_filter_map<T, F: Fn(Self::Item) -> Option<T>>(
self,
f: F
) -> LazyFilterMap<Self, F> where
Self: Sized,
[src]fn lazy_enumerate(self) -> LazyEnumerate<Self> where
Self: Sized,
[src]
fn lazy_enumerate(self) -> LazyEnumerate<Self> where
Self: Sized,
[src]fn lazy_skip_while<F: Fn(&Self::Item) -> bool>(
self,
f: F
) -> LazySkipWhile<Self, F> where
Self: Sized,
[src]
fn lazy_skip_while<F: Fn(&Self::Item) -> bool>(
self,
f: F
) -> LazySkipWhile<Self, F> where
Self: Sized,
[src]fn lazy_map_while<T, F: Fn(Self::Item) -> Option<T>>(
self,
f: F
) -> LazyMapWhile<Self, F> where
Self: Sized,
[src]
fn lazy_map_while<T, F: Fn(Self::Item) -> Option<T>>(
self,
f: F
) -> LazyMapWhile<Self, F> where
Self: Sized,
[src]fn lazy_skip(self, n: usize) -> LazySkip<Self> where
Self: Sized,
[src]
fn lazy_skip(self, n: usize) -> LazySkip<Self> where
Self: Sized,
[src]fn lazy_take(self, n: usize) -> LazyTake<Self> where
Self: Sized,
[src]
fn lazy_take(self, n: usize) -> LazyTake<Self> where
Self: Sized,
[src]fn lazy_scan<S, F: Fn(S, Self::Item) -> S>(
self,
state: S,
f: F
) -> LazyScan<S, Self, F> where
Self: Sized,
[src]
fn lazy_scan<S, F: Fn(S, Self::Item) -> S>(
self,
state: S,
f: F
) -> LazyScan<S, Self, F> where
Self: Sized,
[src]fn lazy_flat_map<T: Consumer, F: Fn(Self::Item) -> T>(
self,
f: F
) -> LazyFlatMap<Self, F> where
Self: Sized,
[src]
fn lazy_flat_map<T: Consumer, F: Fn(Self::Item) -> T>(
self,
f: F
) -> LazyFlatMap<Self, F> where
Self: Sized,
[src]fn lazy_flatten(self) -> LazyFlatten<Self> where
Self: Sized,
Self::Item: Consumer,
[src]
fn lazy_flatten(self) -> LazyFlatten<Self> where
Self: Sized,
Self::Item: Consumer,
[src]fn lazy_copied<'a, T>(self) -> LazyCopied<Self> where
T: 'a + Copy,
Self: Sized,
Self: Consumer<Item = &'a T>,
[src]
fn lazy_copied<'a, T>(self) -> LazyCopied<Self> where
T: 'a + Copy,
Self: Sized,
Self: Consumer<Item = &'a T>,
[src]fn lazy_cloned<'a, T>(self) -> LazyCloned<Self> where
T: 'a + Clone,
Self: Sized,
Self: Consumer<Item = &'a T>,
[src]
fn lazy_cloned<'a, T>(self) -> LazyCloned<Self> where
T: 'a + Clone,
Self: Sized,
Self: Consumer<Item = &'a T>,
[src]Implementations on Foreign Types
impl<T> Iterable for BinaryHeap<T>
[src]
impl<T> Iterable for BinaryHeap<T>
[src]type C = BinaryHeap<T>
type CC = BinaryHeap<U>
fn add_one(self, a: Self::Item) -> Self::C where
Self::C: GrowableProducer<Self::Item>,
[src]
Self::C: GrowableProducer<Self::Item>,
impl<'a, T: 'a> Iterable for &'a BinaryHeap<T>
[src]
impl<'a, T: 'a> Iterable for &'a BinaryHeap<T>
[src]impl<T> Iterable for LinkedList<T>
[src]
impl<T> Iterable for LinkedList<T>
[src]impl<'a, T> Iterable for &'a LinkedList<T>
[src]
impl<'a, T> Iterable for &'a LinkedList<T>
[src]Implementors
impl<I> Iterable for LazyEnumerate<I> where
I: Iterable,
[src]
impl<I> Iterable for LazyEnumerate<I> where
I: Iterable,
[src]impl<I, F, T> Iterable for LazyFilterMap<I, F> where
I: Iterable,
F: Fn(I::Item) -> Option<T>,
[src]
impl<I, F, T> Iterable for LazyFilterMap<I, F> where
I: Iterable,
F: Fn(I::Item) -> Option<T>,
[src]impl<I, F, T> Iterable for LazyFlatMap<I, F> where
I: Iterable,
F: Fn(I::Item) -> T,
T: Consumer,
[src]
impl<I, F, T> Iterable for LazyFlatMap<I, F> where
I: Iterable,
F: Fn(I::Item) -> T,
T: Consumer,
[src]