Struct iterable::LazyRev [−][src]
#[must_use = "iterable adaptors are lazy and do nothing unless consumed"]pub struct LazyRev<I> { /* fields omitted */ }
Trait Implementations
impl<I> Iterable for LazyRev<I> where
I: Iterable,
I::IntoIter: DoubleEndedIterator,
[src]
impl<I> Iterable for LazyRev<I> where
I: Iterable,
I::IntoIter: DoubleEndedIterator,
[src]type C = I::C
type CC = I::CC
type F = I::F
type CF = I::CF
fn count(self) -> usize where
Self: Sized,
[src]
Self: Sized,
fn last(self) -> Option<Self::Item> where
Self: Sized,
[src]
Self: Sized,
fn nth(self, n: usize) -> Option<Self::Item> where
Self: Sized,
[src]
Self: Sized,
fn step_by(self, step: usize) -> Self::C where
Self: Sized,
Self::C: Producer<Self::Item>,
[src]
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>,
[src]
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)>,
[src]
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>,
[src]
Self: Sized,
Self::CF: Producer<U>,
fn foreach(self, f: impl Fn(Self::Item)) where
Self: Sized,
[src]
Self: Sized,
fn filter(self, f: impl Fn(&Self::Item) -> bool) -> Self::C where
Self: Sized,
Self::C: Producer<Self::Item>,
[src]
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>,
[src]
Self: Sized,
Self::CC: Producer<U>,
fn enumerate(self) -> Self::CF where
Self: Sized,
Self::CF: Producer<(usize, Self::Item)>,
[src]
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>,
[src]
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>,
[src]
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>,
[src]
Self: Sized,
Self::CC: Producer<U>,
fn skip(self, n: usize) -> Self::C where
Self: Sized,
Self::C: Producer<Self::Item>,
[src]
Self: Sized,
Self::C: Producer<Self::Item>,
fn take(self, n: usize) -> Self::C where
Self: Sized,
Self::C: Producer<Self::Item>,
[src]
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>,
[src]
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>,
[src]
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>,
[src]
Self: Sized,
Self::Item: Consumer,
Self::CC: Producer<<Self::Item as Consumer>::Item>,
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]
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>,
[src]
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 = ()>,
[src]
Self: Sized,
R: Try<Output = ()>,
fn fold<S>(self, init: S, f: impl Fn(S, Self::Item) -> S) -> S where
Self: Sized,
[src]
Self: Sized,
fn all(self, f: impl Fn(Self::Item) -> bool) -> bool where
Self: Sized,
[src]
Self: Sized,
fn any(self, f: impl Fn(Self::Item) -> bool) -> bool where
Self: Sized,
[src]
Self: Sized,
fn find(self, f: impl Fn(&Self::Item) -> bool) -> Option<Self::Item> where
Self: Sized,
[src]
Self: Sized,
fn find_map<B>(self, f: impl Fn(Self::Item) -> Option<B>) -> Option<B> where
Self: Sized,
[src]
Self: Sized,
fn position(self, f: impl Fn(Self::Item) -> bool) -> Option<usize> where
Self: Sized,
[src]
Self: Sized,
fn rposition(self, f: impl Fn(Self::Item) -> bool) -> Option<usize> where
Self: Sized,
Self::IntoIter: ExactSizeIterator + DoubleEndedIterator,
[src]
Self: Sized,
Self::IntoIter: ExactSizeIterator + DoubleEndedIterator,
fn max(self) -> Option<Self::Item> where
Self: Sized,
Self::Item: Ord,
[src]
Self: Sized,
Self::Item: Ord,
fn min(self) -> Option<Self::Item> where
Self: Sized,
Self::Item: Ord,
[src]
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,
[src]
Self: Sized,
B: Ord,
fn max_by(
self,
f: impl Fn(&Self::Item, &Self::Item) -> Ordering
) -> Option<Self::Item> where
Self: Sized,
[src]
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,
[src]
Self: Sized,
B: Ord,
fn min_by(
self,
f: impl Fn(&Self::Item, &Self::Item) -> Ordering
) -> Option<Self::Item> where
Self: Sized,
[src]
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>,
[src]
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>,
[src]
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>,
[src]
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>,
[src]
Self: Sized,
S: Sum<Self::Item>,
fn product<S>(self) -> S where
Self: Sized,
S: Product<Self::Item>,
[src]
Self: Sized,
S: Product<Self::Item>,
fn cmp<I>(self, other: I) -> Ordering where
I: Consumer<Item = Self::Item>,
Self: Sized,
Self::Item: Ord,
[src]
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>,
[src]
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>,
[src]
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>,
[src]
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>,
[src]
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>,
[src]
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>,
[src]
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>,
[src]
I: Consumer,
Self: Sized,
Self::Item: PartialOrd<<I as Consumer>::Item>,
fn join(self, sep: &str) -> String where
Self: Sized,
Self::Item: Display,
[src]
Self: Sized,
Self::Item: Display,
fn add_one(self, a: Self::Item) -> Self::C where
Self: Sized,
Self::C: GrowableProducer<Self::Item>,
[src]
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>,
[src]
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>,
[src]
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>,
[src]
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>,
[src]
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,
[src]
Self: Sized,
fn lazy_chain<C: Consumer>(self, c: C) -> LazyChain<Self, C> where
Self: Sized,
[src]
Self: Sized,
fn lazy_zip<C: Consumer>(self, c: C) -> LazyZip<Self, C> where
Self: Sized,
[src]
Self: Sized,
fn lazy_filter<F: Fn(&Self::Item) -> bool>(self, f: F) -> LazyFilter<Self, F> where
Self: Sized,
[src]
Self: Sized,
fn lazy_map<T, F: Fn(Self::Item) -> T>(self, f: F) -> LazyMap<Self, F> where
Self: Sized,
[src]
Self: Sized,
fn lazy_filter_map<T, F: Fn(Self::Item) -> Option<T>>(
self,
f: F
) -> LazyFilterMap<Self, F> where
Self: Sized,
[src]
self,
f: F
) -> LazyFilterMap<Self, F> where
Self: Sized,
fn lazy_enumerate(self) -> LazyEnumerate<Self> where
Self: Sized,
[src]
Self: Sized,
fn lazy_skip_while<F: Fn(&Self::Item) -> bool>(
self,
f: F
) -> LazySkipWhile<Self, F> where
Self: Sized,
[src]
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,
[src]
self,
f: F
) -> LazyMapWhile<Self, F> where
Self: Sized,
fn lazy_skip(self, n: usize) -> LazySkip<Self> where
Self: Sized,
[src]
Self: Sized,
fn lazy_take(self, n: usize) -> LazyTake<Self> where
Self: Sized,
[src]
Self: Sized,
fn lazy_scan<S, F: Fn(S, Self::Item) -> S>(
self,
state: S,
f: F
) -> LazyScan<S, Self, F> where
Self: Sized,
[src]
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,
[src]
self,
f: F
) -> LazyFlatMap<Self, F> where
Self: Sized,
fn lazy_flatten(self) -> LazyFlatten<Self> where
Self: Sized,
Self::Item: Consumer,
[src]
Self: Sized,
Self::Item: Consumer,
fn lazy_copied<'a, T>(self) -> LazyCopied<Self> where
T: 'a + Copy,
Self: Sized,
Self: Consumer<Item = &'a T>,
[src]
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>,
[src]
T: 'a + Clone,
Self: Sized,
Self: Consumer<Item = &'a T>,
fn lazy_cycle(self) -> LazyCycle<Self> where
Self: Sized,
Self::IntoIter: Clone,
[src]
Self: Sized,
Self::IntoIter: Clone,
impl<I> IterableSeq for LazyRev<I> where
I: IterableSeq,
I::IntoIter: DoubleEndedIterator,
[src]
impl<I> IterableSeq for LazyRev<I> where
I: IterableSeq,
I::IntoIter: DoubleEndedIterator,
[src]fn rev(self) -> Self::F where
Self: Sized,
Self::F: Producer<Self::Item>,
Self::IntoIter: DoubleEndedIterator,
[src]
Self: Sized,
Self::F: Producer<Self::Item>,
Self::IntoIter: DoubleEndedIterator,
fn sorted(self) -> Self::F where
Self: Sized,
Self::Item: Ord,
Self::F: Producer<Self::Item>,
[src]
Self: Sized,
Self::Item: Ord,
Self::F: Producer<Self::Item>,
fn sorted_by<F>(self, f: F) -> Self::F where
F: Fn(&Self::Item, &Self::Item) -> Ordering,
Self: Sized,
Self::F: Producer<Self::Item>,
[src]
F: Fn(&Self::Item, &Self::Item) -> Ordering,
Self: Sized,
Self::F: Producer<Self::Item>,
fn sorted_by_key<K, F>(self, f: F) -> Self::F where
K: Ord,
F: Fn(&Self::Item) -> K,
Self: Sized,
Self::F: Producer<Self::Item>,
[src]
K: Ord,
F: Fn(&Self::Item) -> K,
Self: Sized,
Self::F: Producer<Self::Item>,
fn lazy_rev(self) -> LazyRev<Self> where
Self: Sized,
Self::IntoIter: DoubleEndedIterator,
[src]
Self: Sized,
Self::IntoIter: DoubleEndedIterator,
Auto Trait Implementations
impl<I> RefUnwindSafe for LazyRev<I> where
I: RefUnwindSafe,
I: RefUnwindSafe,
impl<I> Send for LazyRev<I> where
I: Send,
I: Send,
impl<I> Sync for LazyRev<I> where
I: Sync,
I: Sync,
impl<I> Unpin for LazyRev<I> where
I: Unpin,
I: Unpin,
impl<I> UnwindSafe for LazyRev<I> where
I: UnwindSafe,
I: UnwindSafe,
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more