pub struct SkipWhile<L, P> { /* private fields */ }Implementations§
Source§impl<L, P> SkipWhile<L, P>
impl<L, P> SkipWhile<L, P>
pub fn into_inner(self) -> L
pub fn into_parts(self) -> (L, P)
Trait Implementations§
Source§impl<L, P> FallibleLender for SkipWhile<L, P>
impl<L, P> FallibleLender for SkipWhile<L, P>
Source§type Error = <L as FallibleLender>::Error
type Error = <L as FallibleLender>::Error
The error type.
Source§fn next(&mut self) -> Result<Option<FallibleLend<'_, Self>>, Self::Error>
fn next(&mut self) -> Result<Option<FallibleLend<'_, Self>>, Self::Error>
Yield the next lend, if any, of the lender.
Returns Ok(None) when iteration is finished.
The behavior of calling this method after a previous call has returned
Ok(None) or Err is implementation defined. Read more
Source§fn size_hint(&self) -> (usize, Option<usize>)
fn size_hint(&self) -> (usize, Option<usize>)
Get the estimated minimum and maximum length of the lender.
Both bounds assume that all remaining calls to next succeed.
That is, next could return an Err in fewer calls than specified by the lower bound. Read more
Source§fn try_fold<B, F, R>(&mut self, init: B, f: F) -> Result<R, Self::Error>
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> Result<R, Self::Error>
Documentation is incomplete. Refer to
Iterator::try_fold for more informationSource§fn fold<B, F>(self, init: B, f: F) -> Result<B, Self::Error>
fn fold<B, F>(self, init: B, f: F) -> Result<B, Self::Error>
Documentation is incomplete. Refer to
Iterator::fold for more information Read moreSource§fn next_chunk(&mut self, chunk_size: usize) -> Chunk<'_, Self>where
Self: Sized,
fn next_chunk(&mut self, chunk_size: usize) -> Chunk<'_, Self>where
Self: Sized,
Take the next
len lends of the lender with temporary lender Chunk.
This is equivalent to cloning the lender and calling take(len) on it. Read moreSource§fn count(self) -> Result<usize, Self::Error>where
Self: Sized,
fn count(self) -> Result<usize, Self::Error>where
Self: Sized,
Count the number of lends in the lender by consuming it until the
lender yields
Ok(None) or Err(_). Read moreSource§fn last<'call>(
&'call mut self,
) -> Result<Option<FallibleLend<'call, Self>>, Self::Error>where
Self: Sized,
fn last<'call>(
&'call mut self,
) -> Result<Option<FallibleLend<'call, Self>>, Self::Error>where
Self: Sized,
Returns the last element of the iterator.
Source§fn advance_by(&mut self, n: usize) -> Result<Option<NonZeroUsize>, Self::Error>
fn advance_by(&mut self, n: usize) -> Result<Option<NonZeroUsize>, Self::Error>
Advance the lender by
n lends. If the lender does not have enough lends, return the number of lends left.Source§fn nth(
&mut self,
n: usize,
) -> Result<Option<FallibleLend<'_, Self>>, Self::Error>
fn nth( &mut self, n: usize, ) -> Result<Option<FallibleLend<'_, Self>>, Self::Error>
Yield the nth lend of the lender, if any, by consuming it. If the lender does not have enough lends, returns
None. Read moreSource§fn step_by(self, step: usize) -> StepBy<Self>where
Self: Sized,
fn step_by(self, step: usize) -> StepBy<Self>where
Self: Sized,
Skip
step - 1 lends between each lend of the lender. Read moreSource§fn chain<U>(
self,
other: U,
) -> Chain<Self, <U as IntoFallibleLender>::FallibleLender>where
Self: Sized,
U: IntoFallibleLender + for<'all> FallibleLending<'all, Lend = FallibleLend<'all, Self>>,
fn chain<U>(
self,
other: U,
) -> Chain<Self, <U as IntoFallibleLender>::FallibleLender>where
Self: Sized,
U: IntoFallibleLender + for<'all> FallibleLending<'all, Lend = FallibleLend<'all, Self>>,
Chain the lender with another lender of the same type. Read more
Source§fn zip<U: IntoFallibleLender>(
self,
other: U,
) -> Zip<Self, <U as IntoFallibleLender>::FallibleLender>where
Self: Sized,
fn zip<U: IntoFallibleLender>(
self,
other: U,
) -> Zip<Self, <U as IntoFallibleLender>::FallibleLender>where
Self: Sized,
Zip the lender with another lender of the same or different type.
Source§fn intersperse<'call>(
self,
separator: FallibleLend<'call, Self>,
) -> FallibleIntersperse<'call, Self>
fn intersperse<'call>( self, separator: FallibleLend<'call, Self>, ) -> FallibleIntersperse<'call, Self>
Intersperse each lend of this lender with the given seperator.
Source§fn intersperse_with<'call, G>(
self,
separator: G,
) -> FallibleIntersperseWith<'call, Self, G>
fn intersperse_with<'call, G>( self, separator: G, ) -> FallibleIntersperseWith<'call, Self, G>
Intersperse each lend of this lender with the seperator produced by the given function.
Source§fn map<F>(self, f: F) -> Map<Self, F>
fn map<F>(self, f: F) -> Map<Self, F>
Map each lend of this lender using the given function. Read more
Source§fn map_err<E, F>(self, f: F) -> MapErr<E, Self, F>
fn map_err<E, F>(self, f: F) -> MapErr<E, Self, F>
Map the error of this lender using the given function.
Source§fn map_into_iter<O, F>(self, f: F) -> MapIntoIter<Self, O, F> ⓘ
fn map_into_iter<O, F>(self, f: F) -> MapIntoIter<Self, O, F> ⓘ
Map each lend of this lender into an owned value using the given function. Read more
Source§fn for_each<F>(self, f: F) -> Result<(), Self::Error>
fn for_each<F>(self, f: F) -> Result<(), Self::Error>
Call the given function with each lend of this lender.
Source§fn filter<P>(self, predicate: P) -> Filter<Self, P>
fn filter<P>(self, predicate: P) -> Filter<Self, P>
Filter this lender using the given predicate.
Source§fn filter_map<F>(self, f: F) -> FilterMap<Self, F>
fn filter_map<F>(self, f: F) -> FilterMap<Self, F>
Filter and map this lender using the given function.
Source§fn enumerate(self) -> Enumerate<Self>where
Self: Sized,
fn enumerate(self) -> Enumerate<Self>where
Self: Sized,
Enumerate this lender. Each lend is paired with its zero-based index.
Source§fn peekable<'call>(self) -> FalliblePeekable<'call, Self>where
Self: Sized,
fn peekable<'call>(self) -> FalliblePeekable<'call, Self>where
Self: Sized,
Make this lender peekable, so that it is possible to peek at the next lend without consuming it.
Source§fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>
Skip the first contiguous sequence lends of this lender that satisfy the given predicate.
Source§fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>
Take the first contiguous sequence lends of this lender that satisfy the given predicate.
Source§fn map_while<P>(self, predicate: P) -> MapWhile<Self, P>
fn map_while<P>(self, predicate: P) -> MapWhile<Self, P>
Map this lender using the given function while it returns
Some.Source§fn skip(self, n: usize) -> Skip<Self>where
Self: Sized,
fn skip(self, n: usize) -> Skip<Self>where
Self: Sized,
Skip the first
n lends of this lender.Source§fn take(self, n: usize) -> Take<Self>where
Self: Sized,
fn take(self, n: usize) -> Take<Self>where
Self: Sized,
Take the first
n lends of this lender.Source§fn scan<St, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>where
Self: Sized,
F: for<'all> FnMutHKAResOpt<'all, (&'all mut St, FallibleLend<'all, Self>), Self::Error>,
fn scan<St, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>where
Self: Sized,
F: for<'all> FnMutHKAResOpt<'all, (&'all mut St, FallibleLend<'all, Self>), Self::Error>,
Documentation is incomplete. Refer to
Iterator::scan for more information.Source§fn flat_map<'call, F>(self, f: F) -> FallibleFlatMap<'call, Self, F>where
Self: Sized,
F: for<'all> FnMutHKARes<'all, FallibleLend<'all, Self>, Self::Error>,
for<'all> <F as FnMutHKARes<'all, FallibleLend<'all, Self>, Self::Error>>::B: IntoFallibleLender<Error = Self::Error>,
fn flat_map<'call, F>(self, f: F) -> FallibleFlatMap<'call, Self, F>where
Self: Sized,
F: for<'all> FnMutHKARes<'all, FallibleLend<'all, Self>, Self::Error>,
for<'all> <F as FnMutHKARes<'all, FallibleLend<'all, Self>, Self::Error>>::B: IntoFallibleLender<Error = Self::Error>,
Documentation is incomplete. Refer to
Iterator::flat_map for more informationSource§fn flatten<'call>(self) -> FallibleFlatten<'call, Self>
fn flatten<'call>(self) -> FallibleFlatten<'call, Self>
Documentation is incomplete. Refer to
Iterator::flatten for more informationSource§fn fuse(self) -> Fuse<Self>where
Self: Sized,
fn fuse(self) -> Fuse<Self>where
Self: Sized,
Documentation is incomplete. Refer to
Iterator::fuse for more informationSource§fn inspect<F>(self, f: F) -> Inspect<Self, F>
fn inspect<F>(self, f: F) -> Inspect<Self, F>
Documentation is incomplete. Refer to
Iterator::inspect for more information Read moreSource§fn by_ref(&mut self) -> &mut Selfwhere
Self: Sized,
fn by_ref(&mut self) -> &mut Selfwhere
Self: Sized,
Documentation is incomplete. Refer to
Iterator::by_ref for more informationSource§fn collect<B>(self) -> Result<B, (B, Self::Error)>where
Self: Sized,
for<'all> B: FromLender<NonFallibleAdapter<'all, Self>>,
fn collect<B>(self) -> Result<B, (B, Self::Error)>where
Self: Sized,
for<'all> B: FromLender<NonFallibleAdapter<'all, Self>>,
Transforms the iterator into a collection.
If any invocation of next returns Err, returns the collection built
from values yielded successfully, together with the error.
Source§fn try_collect<'a, B, T>(&'a mut self) -> Result<T, (T, Self::Error)>where
Self: Sized,
for<'all> FallibleLend<'all, Self>: Try,
for<'all> <FallibleLend<'all, Self> as Try>::Residual: Residual<B, TryType = T>,
for<'b, 'c, 'd> B: FromLender<FallibleTryShuntAdapter<'b, 'c, 'd, 'a, Self>>,
fn try_collect<'a, B, T>(&'a mut self) -> Result<T, (T, Self::Error)>where
Self: Sized,
for<'all> FallibleLend<'all, Self>: Try,
for<'all> <FallibleLend<'all, Self> as Try>::Residual: Residual<B, TryType = T>,
for<'b, 'c, 'd> B: FromLender<FallibleTryShuntAdapter<'b, 'c, 'd, 'a, Self>>,
Transforms the iterator into a collection.
If any invocation of next returns Err, returns the collection built
from values yielded successfully, together with the error.
Source§fn collect_into<E>(
self,
collection: &mut E,
) -> Result<&mut E, (&mut E, Self::Error)>where
Self: Sized,
for<'all> E: ExtendLender<NonFallibleAdapter<'all, Self>>,
fn collect_into<E>(
self,
collection: &mut E,
) -> Result<&mut E, (&mut E, Self::Error)>where
Self: Sized,
for<'all> E: ExtendLender<NonFallibleAdapter<'all, Self>>,
Transforms the iterator into a collection.
If any invocation of next returns Err, returns the collection built
from values yielded successfully, together with the error.
Source§fn partition<'this, A, E, F>(self, f: F) -> Result<(E, E), Self::Error>where
Self: Sized + 'this,
E: Default + ExtendLender<NonFallibleAdapter<'this, Self>>,
F: FnMut(&FallibleLend<'_, Self>) -> Result<bool, Self::Error>,
fn partition<'this, A, E, F>(self, f: F) -> Result<(E, E), Self::Error>where
Self: Sized + 'this,
E: Default + ExtendLender<NonFallibleAdapter<'this, Self>>,
F: FnMut(&FallibleLend<'_, Self>) -> Result<bool, Self::Error>,
Documentation is incomplete. Refer to
Iterator::partition for more informationSource§fn is_partitioned<P>(self, predicate: P) -> Result<bool, Self::Error>
fn is_partitioned<P>(self, predicate: P) -> Result<bool, Self::Error>
Documentation is incomplete. Refer to
Iterator::is_partitioned for more informationSource§fn try_for_each<F, R>(&mut self, f: F) -> Result<R, Self::Error>
fn try_for_each<F, R>(&mut self, f: F) -> Result<R, Self::Error>
Documentation is incomplete. Refer to
Iterator::try_for_each for more informationSource§fn reduce<T, F>(self, f: F) -> Result<Option<T>, Self::Error>where
Self: Sized,
for<'all> FallibleLend<'all, Self>: ToOwned<Owned = T>,
F: FnMut(T, FallibleLend<'_, Self>) -> Result<T, Self::Error>,
fn reduce<T, F>(self, f: F) -> Result<Option<T>, Self::Error>where
Self: Sized,
for<'all> FallibleLend<'all, Self>: ToOwned<Owned = T>,
F: FnMut(T, FallibleLend<'_, Self>) -> Result<T, Self::Error>,
Documentation is incomplete. Refer to
Iterator::reduce for more informationSource§fn try_reduce<T, F, R>(
self,
f: F,
) -> Result<ChangeOutputType<R, Option<T>>, Self::Error>
fn try_reduce<T, F, R>( self, f: F, ) -> Result<ChangeOutputType<R, Option<T>>, Self::Error>
Documentation is incomplete. Refer to
Iterator::try_reduce for more informationSource§fn all<F>(&mut self, f: F) -> Result<bool, Self::Error>
fn all<F>(&mut self, f: F) -> Result<bool, Self::Error>
Documentation is incomplete. Refer to
Iterator::all for more information Read moreSource§fn any<F>(&mut self, f: F) -> Result<bool, Self::Error>
fn any<F>(&mut self, f: F) -> Result<bool, Self::Error>
Documentation is incomplete. Refer to
Iterator::any for more information Read moreSource§fn find<P>(
&mut self,
predicate: P,
) -> Result<Option<FallibleLend<'_, Self>>, Self::Error>
fn find<P>( &mut self, predicate: P, ) -> Result<Option<FallibleLend<'_, Self>>, Self::Error>
Documentation is incomplete. Refer to
Iterator::find for more information Read moreSource§fn find_map<'a, F>(
&'a mut self,
f: F,
) -> Result<Option<<F as FnMutHKAResOpt<'a, FallibleLend<'a, Self>, Self::Error>>::B>, Self::Error>
fn find_map<'a, F>( &'a mut self, f: F, ) -> Result<Option<<F as FnMutHKAResOpt<'a, FallibleLend<'a, Self>, Self::Error>>::B>, Self::Error>
Documentation is incomplete. Refer to
Iterator::find_map for more informationSource§fn try_find<F, R>(
&mut self,
f: F,
) -> Result<ChangeOutputType<R, Option<FallibleLend<'_, Self>>>, Self::Error>
fn try_find<F, R>( &mut self, f: F, ) -> Result<ChangeOutputType<R, Option<FallibleLend<'_, Self>>>, Self::Error>
Documentation is incomplete. Refer to
Iterator::try_find for more informationSource§fn position<P>(&mut self, predicate: P) -> Result<Option<usize>, Self::Error>
fn position<P>(&mut self, predicate: P) -> Result<Option<usize>, Self::Error>
Documentation is incomplete. Refer to
Iterator::position for more information Read moreSource§fn max<T>(self) -> Result<Option<T>, Self::Error>where
Self: Sized,
T: for<'all> PartialOrd<FallibleLend<'all, Self>>,
for<'all> FallibleLend<'all, Self>: ToOwned<Owned = T>,
fn max<T>(self) -> Result<Option<T>, Self::Error>where
Self: Sized,
T: for<'all> PartialOrd<FallibleLend<'all, Self>>,
for<'all> FallibleLend<'all, Self>: ToOwned<Owned = T>,
Documentation is incomplete. Refer to
Iterator::max for more informationSource§fn min<T>(self) -> Result<Option<T>, Self::Error>where
Self: Sized,
T: for<'all> PartialOrd<FallibleLend<'all, Self>>,
for<'all> FallibleLend<'all, Self>: ToOwned<Owned = T>,
fn min<T>(self) -> Result<Option<T>, Self::Error>where
Self: Sized,
T: for<'all> PartialOrd<FallibleLend<'all, Self>>,
for<'all> FallibleLend<'all, Self>: ToOwned<Owned = T>,
Documentation is incomplete. Refer to
Iterator::min for more informationSource§fn max_by_key<B: Ord, T, F>(self, f: F) -> Result<Option<T>, Self::Error>
fn max_by_key<B: Ord, T, F>(self, f: F) -> Result<Option<T>, Self::Error>
Documentation is incomplete. Refer to
Iterator::max_by_key for more informationSource§fn max_by<T, F>(self, compare: F) -> Result<Option<T>, Self::Error>where
Self: Sized,
for<'all> FallibleLend<'all, Self>: ToOwned<Owned = T>,
F: FnMut(&T, &FallibleLend<'_, Self>) -> Result<Ordering, Self::Error>,
fn max_by<T, F>(self, compare: F) -> Result<Option<T>, Self::Error>where
Self: Sized,
for<'all> FallibleLend<'all, Self>: ToOwned<Owned = T>,
F: FnMut(&T, &FallibleLend<'_, Self>) -> Result<Ordering, Self::Error>,
Documentation is incomplete. Refer to
Iterator::max_by for more informationSource§fn min_by_key<B: Ord, T, F>(self, f: F) -> Result<Option<T>, Self::Error>
fn min_by_key<B: Ord, T, F>(self, f: F) -> Result<Option<T>, Self::Error>
Documentation is incomplete. Refer to
Iterator::min_by_key for more informationSource§fn min_by<T, F>(self, compare: F) -> Result<Option<T>, Self::Error>where
Self: Sized,
for<'all> FallibleLend<'all, Self>: ToOwned<Owned = T>,
F: FnMut(&T, &FallibleLend<'_, Self>) -> Result<Ordering, Self::Error>,
fn min_by<T, F>(self, compare: F) -> Result<Option<T>, Self::Error>where
Self: Sized,
for<'all> FallibleLend<'all, Self>: ToOwned<Owned = T>,
F: FnMut(&T, &FallibleLend<'_, Self>) -> Result<Ordering, Self::Error>,
Documentation is incomplete. Refer to
Iterator::min_by for more informationSource§fn unzip<ExtA, ExtB>(self) -> Result<(ExtA, ExtB), Self::Error>where
Self: Sized,
for<'all> FallibleLend<'all, Self>: TupleLend<'all>,
ExtA: Default + for<'this> ExtendLender<NonFallibleAdapter<'this, <FirstShunt<Self> as IntoFallibleLender>::FallibleLender>>,
ExtB: Default + for<'this> ExtendLender<NonFallibleAdapter<'this, <SecondShunt<Self> as IntoFallibleLender>::FallibleLender>>,
fn unzip<ExtA, ExtB>(self) -> Result<(ExtA, ExtB), Self::Error>where
Self: Sized,
for<'all> FallibleLend<'all, Self>: TupleLend<'all>,
ExtA: Default + for<'this> ExtendLender<NonFallibleAdapter<'this, <FirstShunt<Self> as IntoFallibleLender>::FallibleLender>>,
ExtB: Default + for<'this> ExtendLender<NonFallibleAdapter<'this, <SecondShunt<Self> as IntoFallibleLender>::FallibleLender>>,
Documentation is incomplete. Refer to
Iterator::unzip for more informationSource§fn copied<T>(self) -> Copied<Self> ⓘ
fn copied<T>(self) -> Copied<Self> ⓘ
Documentation is incomplete. Refer to
Iterator::copied for more information. Read moreSource§fn cloned<T>(self) -> Cloned<Self> ⓘ
fn cloned<T>(self) -> Cloned<Self> ⓘ
Documentation is incomplete. Refer to
Iterator::cloned for more information. Read moreSource§fn cycle(self) -> Cycle<Self>
fn cycle(self) -> Cycle<Self>
Documentation is incomplete. Refer to
Iterator::cycle for more informationSource§fn sum<S>(self) -> Result<S, Self::Error>where
Self: Sized,
S: SumFallibleLender<Self>,
fn sum<S>(self) -> Result<S, Self::Error>where
Self: Sized,
S: SumFallibleLender<Self>,
Documentation is incomplete. Refer to
Iterator::sum for more informationSource§fn product<P>(self) -> Result<P, Self::Error>where
Self: Sized,
P: ProductFallibleLender<Self>,
fn product<P>(self) -> Result<P, Self::Error>where
Self: Sized,
P: ProductFallibleLender<Self>,
Documentation is incomplete. Refer to
Iterator::product for more informationSource§fn cmp<L>(self, other: L) -> Result<Ordering, Self::Error>where
L: IntoFallibleLender<Error = Self::Error>,
L::FallibleLender: for<'all> FallibleLending<'all, Lend = FallibleLend<'all, Self>>,
for<'all> FallibleLend<'all, Self>: Ord,
Self: Sized,
fn cmp<L>(self, other: L) -> Result<Ordering, Self::Error>where
L: IntoFallibleLender<Error = Self::Error>,
L::FallibleLender: for<'all> FallibleLending<'all, Lend = FallibleLend<'all, Self>>,
for<'all> FallibleLend<'all, Self>: Ord,
Self: Sized,
Documentation is incomplete. Refer to
Iterator::cmp for more informationSource§fn cmp_by<L, F>(self, other: L, cmp: F) -> Result<Ordering, Self::Error>where
Self: Sized,
L: IntoFallibleLender<Error = Self::Error>,
F: for<'all> FnMut(FallibleLend<'all, Self>, FallibleLend<'all, L::FallibleLender>) -> Result<Ordering, Self::Error>,
fn cmp_by<L, F>(self, other: L, cmp: F) -> Result<Ordering, Self::Error>where
Self: Sized,
L: IntoFallibleLender<Error = Self::Error>,
F: for<'all> FnMut(FallibleLend<'all, Self>, FallibleLend<'all, L::FallibleLender>) -> Result<Ordering, Self::Error>,
Documentation is incomplete. Refer to
Iterator::cmp_by for more informationSource§fn partial_cmp<L>(self, other: L) -> Result<Option<Ordering>, Self::Error>where
L: IntoFallibleLender<Error = Self::Error>,
for<'all> FallibleLend<'all, Self>: PartialOrd<FallibleLend<'all, L::FallibleLender>>,
Self: Sized,
fn partial_cmp<L>(self, other: L) -> Result<Option<Ordering>, Self::Error>where
L: IntoFallibleLender<Error = Self::Error>,
for<'all> FallibleLend<'all, Self>: PartialOrd<FallibleLend<'all, L::FallibleLender>>,
Self: Sized,
Documentation is incomplete. Refer to
Iterator::partial_cmp for more informationSource§fn partial_cmp_by<L, F>(
self,
other: L,
partial_cmp: F,
) -> Result<Option<Ordering>, Self::Error>where
Self: Sized,
L: IntoFallibleLender<Error = Self::Error>,
F: for<'all> FnMut(FallibleLend<'all, Self>, FallibleLend<'all, L::FallibleLender>) -> Result<Option<Ordering>, Self::Error>,
fn partial_cmp_by<L, F>(
self,
other: L,
partial_cmp: F,
) -> Result<Option<Ordering>, Self::Error>where
Self: Sized,
L: IntoFallibleLender<Error = Self::Error>,
F: for<'all> FnMut(FallibleLend<'all, Self>, FallibleLend<'all, L::FallibleLender>) -> Result<Option<Ordering>, Self::Error>,
Documentation is incomplete. Refer to
Iterator::partial_cmp_by for more informationSource§fn eq<L>(self, other: L) -> Result<bool, Self::Error>where
L: IntoFallibleLender<Error = Self::Error>,
for<'all> FallibleLend<'all, Self>: PartialEq<FallibleLend<'all, L::FallibleLender>>,
Self: Sized,
fn eq<L>(self, other: L) -> Result<bool, Self::Error>where
L: IntoFallibleLender<Error = Self::Error>,
for<'all> FallibleLend<'all, Self>: PartialEq<FallibleLend<'all, L::FallibleLender>>,
Self: Sized,
Documentation is incomplete. Refer to
Iterator::eq for more informationSource§fn eq_by<L, F>(self, other: L, eq: F) -> Result<bool, Self::Error>where
Self: Sized,
L: IntoFallibleLender<Error = Self::Error>,
F: for<'all> FnMut(FallibleLend<'all, Self>, FallibleLend<'all, L::FallibleLender>) -> Result<bool, Self::Error>,
fn eq_by<L, F>(self, other: L, eq: F) -> Result<bool, Self::Error>where
Self: Sized,
L: IntoFallibleLender<Error = Self::Error>,
F: for<'all> FnMut(FallibleLend<'all, Self>, FallibleLend<'all, L::FallibleLender>) -> Result<bool, Self::Error>,
Documentation is incomplete. Refer to
Iterator::eq_by for more informationSource§fn ne<L>(self, other: L) -> Result<bool, Self::Error>where
L: IntoFallibleLender<Error = Self::Error>,
for<'all> FallibleLend<'all, Self>: PartialEq<FallibleLend<'all, L::FallibleLender>>,
Self: Sized,
fn ne<L>(self, other: L) -> Result<bool, Self::Error>where
L: IntoFallibleLender<Error = Self::Error>,
for<'all> FallibleLend<'all, Self>: PartialEq<FallibleLend<'all, L::FallibleLender>>,
Self: Sized,
Documentation is incomplete. Refer to
Iterator::ne for more informationSource§fn lt<L>(self, other: L) -> Result<bool, Self::Error>where
L: IntoFallibleLender<Error = Self::Error>,
for<'all> FallibleLend<'all, Self>: PartialOrd<FallibleLend<'all, L::FallibleLender>>,
Self: Sized,
fn lt<L>(self, other: L) -> Result<bool, Self::Error>where
L: IntoFallibleLender<Error = Self::Error>,
for<'all> FallibleLend<'all, Self>: PartialOrd<FallibleLend<'all, L::FallibleLender>>,
Self: Sized,
Documentation is incomplete. Refer to
Iterator::lt for more informationSource§fn le<L>(self, other: L) -> Result<bool, Self::Error>where
L: IntoFallibleLender<Error = Self::Error>,
for<'all> FallibleLend<'all, Self>: PartialOrd<FallibleLend<'all, L::FallibleLender>>,
Self: Sized,
fn le<L>(self, other: L) -> Result<bool, Self::Error>where
L: IntoFallibleLender<Error = Self::Error>,
for<'all> FallibleLend<'all, Self>: PartialOrd<FallibleLend<'all, L::FallibleLender>>,
Self: Sized,
Documentation is incomplete. Refer to
Iterator::le for more informationSource§fn gt<L>(self, other: L) -> Result<bool, Self::Error>where
L: IntoFallibleLender<Error = Self::Error>,
for<'all> FallibleLend<'all, Self>: PartialOrd<FallibleLend<'all, L::FallibleLender>>,
Self: Sized,
fn gt<L>(self, other: L) -> Result<bool, Self::Error>where
L: IntoFallibleLender<Error = Self::Error>,
for<'all> FallibleLend<'all, Self>: PartialOrd<FallibleLend<'all, L::FallibleLender>>,
Self: Sized,
Documentation is incomplete. Refer to
Iterator::gt for more informationSource§fn ge<L>(self, other: L) -> Result<bool, Self::Error>where
L: IntoFallibleLender<Error = Self::Error>,
for<'all> FallibleLend<'all, Self>: PartialOrd<FallibleLend<'all, L::FallibleLender>>,
Self: Sized,
fn ge<L>(self, other: L) -> Result<bool, Self::Error>where
L: IntoFallibleLender<Error = Self::Error>,
for<'all> FallibleLend<'all, Self>: PartialOrd<FallibleLend<'all, L::FallibleLender>>,
Self: Sized,
Documentation is incomplete. Refer to
Iterator::ge for more informationSource§fn is_sorted<T>(self) -> Result<bool, Self::Error>
fn is_sorted<T>(self) -> Result<bool, Self::Error>
Documentation is incomplete. Refer to
Iterator::is_sorted for more informationSource§fn is_sorted_by<T, F>(self, compare: F) -> Result<bool, Self::Error>
fn is_sorted_by<T, F>(self, compare: F) -> Result<bool, Self::Error>
Documentation is incomplete. Refer to
Iterator::is_sorted_by for more informationSource§fn is_sorted_by_key<F, K>(self, f: F) -> Result<bool, Self::Error>
fn is_sorted_by_key<F, K>(self, f: F) -> Result<bool, Self::Error>
Documentation is incomplete. Refer to
Iterator::is_sorted_by_key for more informationSource§impl<'lend, L, P> FallibleLending<'lend> for SkipWhile<L, P>
impl<'lend, L, P> FallibleLending<'lend> for SkipWhile<L, P>
Source§type Lend = <L as FallibleLending<'lend>>::Lend
type Lend = <L as FallibleLending<'lend>>::Lend
The type being lent.
Source§impl<L, P> Lender for SkipWhile<L, P>
impl<L, P> Lender for SkipWhile<L, P>
Source§fn next(&mut self) -> Option<Lend<'_, Self>>
fn next(&mut self) -> Option<Lend<'_, Self>>
Yield the next lend, if any, of the lender. Read more
Source§fn size_hint(&self) -> (usize, Option<usize>)
fn size_hint(&self) -> (usize, Option<usize>)
Get the estimated minimum and maximum length of the lender. Use
.len() for the exact length if the lender implements ExactSizeLender. Read moreSource§fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R
Documentation is incomplete. Refer to
Iterator::try_fold for more informationSource§fn fold<B, F>(self, init: B, f: F) -> B
fn fold<B, F>(self, init: B, f: F) -> B
Documentation is incomplete. Refer to
Iterator::fold for more informationSource§fn next_chunk(&mut self, chunk_size: usize) -> Chunk<'_, Self>where
Self: Sized,
fn next_chunk(&mut self, chunk_size: usize) -> Chunk<'_, Self>where
Self: Sized,
Take the next
len lends of the lender with temporary lender Chunk. This is equivalent to cloning the lender and calling take(len) on it. Read moreSource§fn count(self) -> usizewhere
Self: Sized,
fn count(self) -> usizewhere
Self: Sized,
Count the number of lends in the lender by consuming it. Read more
Source§fn last<'call>(&'call mut self) -> Option<Lend<'call, Self>>where
Self: Sized,
fn last<'call>(&'call mut self) -> Option<Lend<'call, Self>>where
Self: Sized,
Get the last lend of the lender, if any, by consuming it. Read more
Source§fn advance_by(&mut self, n: usize) -> Result<(), NonZeroUsize>
fn advance_by(&mut self, n: usize) -> Result<(), NonZeroUsize>
Advance the lender by
n lends. If the lender does not have enough lends, return the number of lends left. Read moreSource§fn nth(&mut self, n: usize) -> Option<Lend<'_, Self>>
fn nth(&mut self, n: usize) -> Option<Lend<'_, Self>>
Yield the nth lend of the lender, if any, by consuming it. If the lender does not have enough lends, returns
None. Read moreSource§fn step_by(self, step: usize) -> StepBy<Self>where
Self: Sized,
fn step_by(self, step: usize) -> StepBy<Self>where
Self: Sized,
Skip
step - 1 lends between each lend of the lender. Read moreSource§fn chain<U>(self, other: U) -> Chain<Self, <U as IntoLender>::Lender>
fn chain<U>(self, other: U) -> Chain<Self, <U as IntoLender>::Lender>
Chain the lender with another lender of the same type. Read more
Source§fn zip<U: IntoLender>(self, other: U) -> Zip<Self, <U as IntoLender>::Lender>where
Self: Sized,
fn zip<U: IntoLender>(self, other: U) -> Zip<Self, <U as IntoLender>::Lender>where
Self: Sized,
Zip the lender with another lender of the same or different type. Read more
Source§fn intersperse<'call>(
self,
separator: Lend<'call, Self>,
) -> Intersperse<'call, Self>
fn intersperse<'call>( self, separator: Lend<'call, Self>, ) -> Intersperse<'call, Self>
Intersperse each lend of this lender with the given seperator. Read more
Source§fn intersperse_with<'call, G>(
self,
separator: G,
) -> IntersperseWith<'call, Self, G>
fn intersperse_with<'call, G>( self, separator: G, ) -> IntersperseWith<'call, Self, G>
Intersperse each lend of this lender with the seperator produced by the given function. Read more
Source§fn map<F>(self, f: F) -> Map<Self, F>
fn map<F>(self, f: F) -> Map<Self, F>
Map each lend of this lender using the given function. Read more
Source§fn map_into_iter<O, F: FnMut(Lend<'_, Self>) -> O>(
self,
f: F,
) -> MapIntoIter<Self, O, F> ⓘwhere
Self: Sized,
fn map_into_iter<O, F: FnMut(Lend<'_, Self>) -> O>(
self,
f: F,
) -> MapIntoIter<Self, O, F> ⓘwhere
Self: Sized,
Map each lend of this lender into an owned value using the given function. Read more
Source§fn filter<P>(self, predicate: P) -> Filter<Self, P>
fn filter<P>(self, predicate: P) -> Filter<Self, P>
Filter this lender using the given predicate. Read more
Source§fn filter_map<F>(self, f: F) -> FilterMap<Self, F>
fn filter_map<F>(self, f: F) -> FilterMap<Self, F>
Filter and map this lender using the given function. Read more
Source§fn enumerate(self) -> Enumerate<Self>where
Self: Sized,
fn enumerate(self) -> Enumerate<Self>where
Self: Sized,
Enumerate this lender. Each lend is paired with its zero-based index. Read more
Source§fn peekable<'call>(self) -> Peekable<'call, Self>where
Self: Sized,
fn peekable<'call>(self) -> Peekable<'call, Self>where
Self: Sized,
Make this lender peekable, so that it is possible to peek at the next lend without consuming it. Read more
Source§fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>
Skip the first contiguous sequence lends of this lender that satisfy the given predicate. Read more
Source§fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>
Take the first contiguous sequence lends of this lender that satisfy the given predicate. Read more
Source§fn map_while<P>(self, predicate: P) -> MapWhile<Self, P>
fn map_while<P>(self, predicate: P) -> MapWhile<Self, P>
Map this lender using the given function while it returns
Some. Read moreSource§fn skip(self, n: usize) -> Skip<Self>where
Self: Sized,
fn skip(self, n: usize) -> Skip<Self>where
Self: Sized,
Skip the first
n lends of this lender. Read moreSource§fn take(self, n: usize) -> Take<Self>where
Self: Sized,
fn take(self, n: usize) -> Take<Self>where
Self: Sized,
Take the first
n lends of this lender. Read moreSource§fn scan<St, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>
fn scan<St, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>
Documentation is incomplete. Refer to
Iterator::scan for more information.Source§fn flat_map<'call, F>(self, f: F) -> FlatMap<'call, Self, F>
fn flat_map<'call, F>(self, f: F) -> FlatMap<'call, Self, F>
Documentation is incomplete. Refer to
Iterator::flat_map for more informationSource§fn flatten<'call>(self) -> Flatten<'call, Self>
fn flatten<'call>(self) -> Flatten<'call, Self>
Documentation is incomplete. Refer to
Iterator::flatten for more informationSource§fn fuse(self) -> Fuse<Self>where
Self: Sized,
fn fuse(self) -> Fuse<Self>where
Self: Sized,
Documentation is incomplete. Refer to
Iterator::fuse for more informationSource§fn inspect<F>(self, f: F) -> Inspect<Self, F>
fn inspect<F>(self, f: F) -> Inspect<Self, F>
Documentation is incomplete. Refer to
Iterator::inspect for more informationSource§fn by_ref(&mut self) -> &mut Selfwhere
Self: Sized,
fn by_ref(&mut self) -> &mut Selfwhere
Self: Sized,
Documentation is incomplete. Refer to
Iterator::by_ref for more informationSource§fn collect<B>(self) -> Bwhere
Self: Sized,
B: FromLender<Self>,
fn collect<B>(self) -> Bwhere
Self: Sized,
B: FromLender<Self>,
Documentation is incomplete. Refer to
Iterator::collect for more informationSource§fn try_collect<'a, B>(&'a mut self) -> ChangeOutputType<Lend<'a, Self>, B>
fn try_collect<'a, B>(&'a mut self) -> ChangeOutputType<Lend<'a, Self>, B>
Documentation is incomplete. Refer to
Iterator::try_collect for more informationSource§fn collect_into<E>(self, collection: &mut E) -> &mut Ewhere
Self: Sized,
E: ExtendLender<Self>,
fn collect_into<E>(self, collection: &mut E) -> &mut Ewhere
Self: Sized,
E: ExtendLender<Self>,
Documentation is incomplete. Refer to
Iterator::collect_into for more informationSource§fn partition<A, E, F>(self, f: F) -> (E, E)
fn partition<A, E, F>(self, f: F) -> (E, E)
Documentation is incomplete. Refer to
Iterator::partition for more informationSource§fn is_partitioned<P>(self, predicate: P) -> bool
fn is_partitioned<P>(self, predicate: P) -> bool
Documentation is incomplete. Refer to
Iterator::is_partitioned for more informationSource§fn try_for_each<F, R>(&mut self, f: F) -> R
fn try_for_each<F, R>(&mut self, f: F) -> R
Documentation is incomplete. Refer to
Iterator::try_for_each for more informationSource§fn reduce<T, F>(self, f: F) -> Option<T>
fn reduce<T, F>(self, f: F) -> Option<T>
Documentation is incomplete. Refer to
Iterator::reduce for more informationSource§fn try_reduce<T, F, R>(self, f: F) -> ChangeOutputType<R, Option<T>>
fn try_reduce<T, F, R>(self, f: F) -> ChangeOutputType<R, Option<T>>
Documentation is incomplete. Refer to
Iterator::try_reduce for more informationSource§fn all<F>(&mut self, f: F) -> bool
fn all<F>(&mut self, f: F) -> bool
Documentation is incomplete. Refer to
Iterator::all for more informationSource§fn any<F>(&mut self, f: F) -> bool
fn any<F>(&mut self, f: F) -> bool
Documentation is incomplete. Refer to
Iterator::any for more informationSource§fn find<P>(&mut self, predicate: P) -> Option<Lend<'_, Self>>
fn find<P>(&mut self, predicate: P) -> Option<Lend<'_, Self>>
Documentation is incomplete. Refer to
Iterator::find for more informationSource§fn find_map<'a, F>(
&'a mut self,
f: F,
) -> Option<<F as FnMutHKAOpt<'a, Lend<'a, Self>>>::B>
fn find_map<'a, F>( &'a mut self, f: F, ) -> Option<<F as FnMutHKAOpt<'a, Lend<'a, Self>>>::B>
Documentation is incomplete. Refer to
Iterator::find_map for more informationSource§fn try_find<F, R>(
&mut self,
f: F,
) -> ChangeOutputType<R, Option<Lend<'_, Self>>>
fn try_find<F, R>( &mut self, f: F, ) -> ChangeOutputType<R, Option<Lend<'_, Self>>>
Documentation is incomplete. Refer to
Iterator::try_find for more informationSource§fn position<P>(&mut self, predicate: P) -> Option<usize>
fn position<P>(&mut self, predicate: P) -> Option<usize>
Documentation is incomplete. Refer to
Iterator::position for more informationSource§fn max<T>(self) -> Option<T>where
Self: Sized,
T: for<'all> PartialOrd<Lend<'all, Self>>,
for<'all> Lend<'all, Self>: ToOwned<Owned = T>,
fn max<T>(self) -> Option<T>where
Self: Sized,
T: for<'all> PartialOrd<Lend<'all, Self>>,
for<'all> Lend<'all, Self>: ToOwned<Owned = T>,
Documentation is incomplete. Refer to
Iterator::max for more informationSource§fn min<T>(self) -> Option<T>where
Self: Sized,
T: for<'all> PartialOrd<Lend<'all, Self>>,
for<'all> Lend<'all, Self>: ToOwned<Owned = T>,
fn min<T>(self) -> Option<T>where
Self: Sized,
T: for<'all> PartialOrd<Lend<'all, Self>>,
for<'all> Lend<'all, Self>: ToOwned<Owned = T>,
Documentation is incomplete. Refer to
Iterator::min for more informationSource§fn max_by_key<B: Ord, T, F>(self, f: F) -> Option<T>
fn max_by_key<B: Ord, T, F>(self, f: F) -> Option<T>
Documentation is incomplete. Refer to
Iterator::max_by_key for more informationSource§fn max_by<T, F>(self, compare: F) -> Option<T>
fn max_by<T, F>(self, compare: F) -> Option<T>
Documentation is incomplete. Refer to
Iterator::max_by for more informationSource§fn min_by_key<B: Ord, T, F>(self, f: F) -> Option<T>
fn min_by_key<B: Ord, T, F>(self, f: F) -> Option<T>
Documentation is incomplete. Refer to
Iterator::min_by_key for more informationSource§fn min_by<T, F>(self, compare: F) -> Option<T>
fn min_by<T, F>(self, compare: F) -> Option<T>
Documentation is incomplete. Refer to
Iterator::min_by for more informationSource§fn unzip<ExtA, ExtB>(self) -> (ExtA, ExtB)where
Self: Sized,
for<'all> Lend<'all, Self>: TupleLend<'all>,
ExtA: Default + ExtendLender<FirstShunt<Self>>,
ExtB: Default + ExtendLender<SecondShunt<Self>>,
fn unzip<ExtA, ExtB>(self) -> (ExtA, ExtB)where
Self: Sized,
for<'all> Lend<'all, Self>: TupleLend<'all>,
ExtA: Default + ExtendLender<FirstShunt<Self>>,
ExtB: Default + ExtendLender<SecondShunt<Self>>,
Documentation is incomplete. Refer to
Iterator::unzip for more informationSource§fn copied<T>(self) -> Copied<Self> ⓘ
fn copied<T>(self) -> Copied<Self> ⓘ
Documentation is incomplete. Refer to
Iterator::copied for more information. Read moreSource§fn cloned<T>(self) -> Cloned<Self> ⓘ
fn cloned<T>(self) -> Cloned<Self> ⓘ
Documentation is incomplete. Refer to
Iterator::cloned for more information. Read moreSource§fn cycle(self) -> Cycle<Self>
fn cycle(self) -> Cycle<Self>
Documentation is incomplete. Refer to
Iterator::cycle for more informationSource§fn sum<S>(self) -> S
fn sum<S>(self) -> S
Documentation is incomplete. Refer to
Iterator::sum for more informationSource§fn product<P>(self) -> Pwhere
Self: Sized,
P: ProductLender<Self>,
fn product<P>(self) -> Pwhere
Self: Sized,
P: ProductLender<Self>,
Documentation is incomplete. Refer to
Iterator::product for more informationSource§fn cmp<L>(self, other: L) -> Ordering
fn cmp<L>(self, other: L) -> Ordering
Documentation is incomplete. Refer to
Iterator::cmp for more informationSource§fn cmp_by<L, F>(self, other: L, cmp: F) -> Ordering
fn cmp_by<L, F>(self, other: L, cmp: F) -> Ordering
Documentation is incomplete. Refer to
Iterator::cmp_by for more informationSource§fn partial_cmp<L>(self, other: L) -> Option<Ordering>
fn partial_cmp<L>(self, other: L) -> Option<Ordering>
Documentation is incomplete. Refer to
Iterator::partial_cmp for more informationSource§fn partial_cmp_by<L, F>(self, other: L, partial_cmp: F) -> Option<Ordering>
fn partial_cmp_by<L, F>(self, other: L, partial_cmp: F) -> Option<Ordering>
Documentation is incomplete. Refer to
Iterator::partial_cmp_by for more informationSource§fn eq<L>(self, other: L) -> bool
fn eq<L>(self, other: L) -> bool
Documentation is incomplete. Refer to
Iterator::eq for more informationSource§fn eq_by<L, F>(self, other: L, eq: F) -> bool
fn eq_by<L, F>(self, other: L, eq: F) -> bool
Documentation is incomplete. Refer to
Iterator::eq_by for more informationSource§fn ne<L>(self, other: L) -> bool
fn ne<L>(self, other: L) -> bool
Documentation is incomplete. Refer to
Iterator::ne for more informationSource§fn lt<L>(self, other: L) -> bool
fn lt<L>(self, other: L) -> bool
Documentation is incomplete. Refer to
Iterator::lt for more informationSource§fn le<L>(self, other: L) -> bool
fn le<L>(self, other: L) -> bool
Documentation is incomplete. Refer to
Iterator::le for more informationSource§fn gt<L>(self, other: L) -> bool
fn gt<L>(self, other: L) -> bool
Documentation is incomplete. Refer to
Iterator::gt for more informationSource§fn ge<L>(self, other: L) -> bool
fn ge<L>(self, other: L) -> bool
Documentation is incomplete. Refer to
Iterator::ge for more informationSource§fn is_sorted<T>(self) -> bool
fn is_sorted<T>(self) -> bool
Documentation is incomplete. Refer to
Iterator::is_sorted for more informationSource§fn is_sorted_by<T, F>(self, compare: F) -> bool
fn is_sorted_by<T, F>(self, compare: F) -> bool
Documentation is incomplete. Refer to
Iterator::is_sorted_by for more informationSource§fn is_sorted_by_key<F, K>(self, f: F) -> bool
fn is_sorted_by_key<F, K>(self, f: F) -> bool
Documentation is incomplete. Refer to
Iterator::is_sorted_by_key for more informationSource§fn iter<'this>(self) -> Iter<'this, Self> ⓘ
fn iter<'this>(self) -> Iter<'this, Self> ⓘ
Turn this lender into an Iterator where it has already fulfilled the requirements of the
Iterator trait.Source§fn into_fallible<E>(self) -> IntoFallible<E, Self>where
Self: Sized,
fn into_fallible<E>(self) -> IntoFallible<E, Self>where
Self: Sized,
Convert an lender of anything into
FallibleLender by wrapping
into Result<Lend<'_, Self>, E> where E is an
error that can never actually happen.impl<L, P> FusedLender for SkipWhile<L, P>
Auto Trait Implementations§
impl<L, P> Freeze for SkipWhile<L, P>
impl<L, P> RefUnwindSafe for SkipWhile<L, P>where
L: RefUnwindSafe,
P: RefUnwindSafe,
impl<L, P> Send for SkipWhile<L, P>
impl<L, P> Sync for SkipWhile<L, P>
impl<L, P> Unpin for SkipWhile<L, P>
impl<L, P> UnwindSafe for SkipWhile<L, P>where
L: UnwindSafe,
P: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more