Struct fallible_iterator::Filter
source · pub struct Filter<I, F> { /* private fields */ }
Expand description
An iterator which uses a fallible predicate to determine which values of the underlying iterator should be yielded.
Trait Implementations§
source§impl<I, F> DoubleEndedFallibleIterator for Filter<I, F>
impl<I, F> DoubleEndedFallibleIterator for Filter<I, F>
source§fn next_back(&mut self) -> Result<Option<I::Item>, I::Error>
fn next_back(&mut self) -> Result<Option<I::Item>, I::Error>
Advances the end of the iterator, returning the last value.
source§impl<I, F> FallibleIterator for Filter<I, F>
impl<I, F> FallibleIterator for Filter<I, F>
§type Item = <I as FallibleIterator>::Item
type Item = <I as FallibleIterator>::Item
The type being iterated over.
§type Error = <I as FallibleIterator>::Error
type Error = <I as FallibleIterator>::Error
The error type.
source§fn next(&mut self) -> Result<Option<I::Item>, I::Error>
fn next(&mut self) -> Result<Option<I::Item>, I::Error>
Advances the iterator and returns the next value. Read more
source§fn size_hint(&self) -> (usize, Option<usize>)
fn size_hint(&self) -> (usize, Option<usize>)
Returns bounds on the remaining length of the iterator. Read more
source§fn try_fold<B, E, G>(&mut self, init: B, f: G) -> Result<B, E>
fn try_fold<B, E, G>(&mut self, init: B, f: G) -> Result<B, E>
Applies a function over the elements of the iterator, producing a single final value. Read more
source§fn count(self) -> Result<usize, Self::Error>where
Self: Sized,
fn count(self) -> Result<usize, Self::Error>where
Self: Sized,
Consumes the iterator, returning the number of remaining items.
source§fn last(self) -> Result<Option<Self::Item>, Self::Error>where
Self: Sized,
fn last(self) -> Result<Option<Self::Item>, Self::Error>where
Self: Sized,
Returns the last element of the iterator.
source§fn nth(&mut self, n: usize) -> Result<Option<Self::Item>, Self::Error>
fn nth(&mut self, n: usize) -> Result<Option<Self::Item>, Self::Error>
Returns the
n
th element of the iterator.source§fn step_by(self, step: usize) -> StepBy<Self>where
Self: Sized,
fn step_by(self, step: usize) -> StepBy<Self>where
Self: Sized,
Returns an iterator starting at the same point, but stepping by the given amount at each iteration. Read more
source§fn chain<I>(self, it: I) -> Chain<Self, I>
fn chain<I>(self, it: I) -> Chain<Self, I>
Returns an iterator which yields the elements of this iterator followed
by another.
source§fn zip<I>(self, o: I) -> Zip<Self, I::IntoFallibleIter>
fn zip<I>(self, o: I) -> Zip<Self, I::IntoFallibleIter>
Returns an iterator that yields pairs of this iterator’s and another
iterator’s values.
source§fn map<F, B>(self, f: F) -> Map<Self, F>
fn map<F, B>(self, f: F) -> Map<Self, F>
Returns an iterator which applies a fallible transform to the elements
of the underlying iterator.
source§fn for_each<F>(self, f: F) -> Result<(), Self::Error>
fn for_each<F>(self, f: F) -> Result<(), Self::Error>
Calls a fallible closure on each element of an iterator.
source§fn filter<F>(self, f: F) -> Filter<Self, F>
fn filter<F>(self, f: F) -> Filter<Self, F>
Returns an iterator which uses a predicate to determine which values
should be yielded. The predicate may fail; such failures are passed to
the caller.
source§fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>
Returns an iterator which both filters and maps. The closure may fail;
such failures are passed along to the consumer.
source§fn enumerate(self) -> Enumerate<Self>where
Self: Sized,
fn enumerate(self) -> Enumerate<Self>where
Self: Sized,
Returns an iterator which yields the current iteration count as well
as the value.
source§fn peekable(self) -> Peekable<Self>where
Self: Sized,
fn peekable(self) -> Peekable<Self>where
Self: Sized,
Returns an iterator that can peek at the next element without consuming
it.
source§fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>
Returns an iterator that skips elements based on a predicate.
source§fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>
Returns an iterator that yields elements based on a predicate.
source§fn skip(self, n: usize) -> Skip<Self>where
Self: Sized,
fn skip(self, n: usize) -> Skip<Self>where
Self: Sized,
Returns an iterator which skips the first
n
values of this iterator.source§fn take(self, n: usize) -> Take<Self>where
Self: Sized,
fn take(self, n: usize) -> Take<Self>where
Self: Sized,
Returns an iterator that yields only the first
n
values of this
iterator.source§fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>
Returns an iterator which applies a stateful map to values of this
iterator.
source§fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>
Returns an iterator which maps this iterator’s elements to iterators, yielding those iterators’ values.
source§fn fuse(self) -> Fuse<Self>where
Self: Sized,
fn fuse(self) -> Fuse<Self>where
Self: Sized,
Returns an iterator which yields this iterator’s elements and ends after
the first
Ok(None)
. Read moresource§fn inspect<F>(self, f: F) -> Inspect<Self, F>
fn inspect<F>(self, f: F) -> Inspect<Self, F>
Returns an iterator which passes each element to a closure before returning it.
source§fn by_ref(&mut self) -> &mut Selfwhere
Self: Sized,
fn by_ref(&mut self) -> &mut Selfwhere
Self: Sized,
Borrow an iterator rather than consuming it. Read more
source§fn collect<T>(self) -> Result<T, Self::Error>
fn collect<T>(self) -> Result<T, Self::Error>
Transforms the iterator into a collection. Read more
source§fn partition<B, F>(self, f: F) -> Result<(B, B), Self::Error>
fn partition<B, F>(self, f: F) -> Result<(B, B), Self::Error>
Transforms the iterator into two collections, partitioning elements by a closure.
source§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>
Applies a function over the elements of the iterator, producing a single
final value.
source§fn all<F>(&mut self, f: F) -> Result<bool, Self::Error>
fn all<F>(&mut self, f: F) -> Result<bool, Self::Error>
Determines if all elements of this iterator match a predicate.
source§fn any<F>(&mut self, f: F) -> Result<bool, Self::Error>
fn any<F>(&mut self, f: F) -> Result<bool, Self::Error>
Determines if any element of this iterator matches a predicate.
source§fn find<F>(&mut self, f: F) -> Result<Option<Self::Item>, Self::Error>
fn find<F>(&mut self, f: F) -> Result<Option<Self::Item>, Self::Error>
Returns the first element of the iterator that matches a predicate.
source§fn find_map<B, F>(&mut self, f: F) -> Result<Option<B>, Self::Error>
fn find_map<B, F>(&mut self, f: F) -> Result<Option<B>, Self::Error>
Applies a function to the elements of the iterator, returning the first non-
None
result.source§fn position<F>(&mut self, f: F) -> Result<Option<usize>, Self::Error>
fn position<F>(&mut self, f: F) -> Result<Option<usize>, Self::Error>
Returns the position of the first element of this iterator that matches
a predicate. The predicate may fail; such failures are returned to the
caller.
source§fn max_by_key<B, F>(self, f: F) -> Result<Option<Self::Item>, Self::Error>
fn max_by_key<B, F>(self, f: F) -> Result<Option<Self::Item>, Self::Error>
Returns the element of the iterator which gives the maximum value from
the function.
source§fn max_by<F>(self, f: F) -> Result<Option<Self::Item>, Self::Error>
fn max_by<F>(self, f: F) -> Result<Option<Self::Item>, Self::Error>
Returns the element that gives the maximum value with respect to the function.
source§fn min_by_key<B, F>(self, f: F) -> Result<Option<Self::Item>, Self::Error>
fn min_by_key<B, F>(self, f: F) -> Result<Option<Self::Item>, Self::Error>
Returns the element of the iterator which gives the minimum value from
the function.
source§fn min_by<F>(self, f: F) -> Result<Option<Self::Item>, Self::Error>
fn min_by<F>(self, f: F) -> Result<Option<Self::Item>, Self::Error>
Returns the element that gives the minimum value with respect to the function.
source§fn unzip<A, B, FromA, FromB>(self) -> Result<(FromA, FromB), Self::Error>
fn unzip<A, B, FromA, FromB>(self) -> Result<(FromA, FromB), Self::Error>
Converts an iterator of pairs into a pair of containers.
source§fn partial_cmp<I>(self, other: I) -> Result<Option<Ordering>, Self::Error>
fn partial_cmp<I>(self, other: I) -> Result<Option<Ordering>, Self::Error>
Lexicographically compares the elements of this iterator to that of
another.
source§fn eq<I>(self, other: I) -> Result<bool, Self::Error>
fn eq<I>(self, other: I) -> Result<bool, Self::Error>
Determines if the elements of this iterator are equal to those of
another.
source§fn ne<I>(self, other: I) -> Result<bool, Self::Error>
fn ne<I>(self, other: I) -> Result<bool, Self::Error>
Determines if the elements of this iterator are not equal to those of
another.
source§fn lt<I>(self, other: I) -> Result<bool, Self::Error>
fn lt<I>(self, other: I) -> Result<bool, Self::Error>
Determines if the elements of this iterator are lexicographically less
than those of another.
source§fn le<I>(self, other: I) -> Result<bool, Self::Error>
fn le<I>(self, other: I) -> Result<bool, Self::Error>
Determines if the elements of this iterator are lexicographically less
than or equal to those of another.
source§fn gt<I>(self, other: I) -> Result<bool, Self::Error>
fn gt<I>(self, other: I) -> Result<bool, Self::Error>
Determines if the elements of this iterator are lexicographically
greater than those of another.
source§fn ge<I>(self, other: I) -> Result<bool, Self::Error>
fn ge<I>(self, other: I) -> Result<bool, Self::Error>
Determines if the elements of this iterator are lexicographically
greater than or equal to those of another.
Auto Trait Implementations§
impl<I, F> Freeze for Filter<I, F>
impl<I, F> RefUnwindSafe for Filter<I, F>where
I: RefUnwindSafe,
F: RefUnwindSafe,
impl<I, F> Send for Filter<I, F>
impl<I, F> Sync for Filter<I, F>
impl<I, F> Unpin for Filter<I, F>
impl<I, F> UnwindSafe for Filter<I, F>where
I: UnwindSafe,
F: 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
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)source§impl<I> IntoFallibleIterator for Iwhere
I: FallibleIterator,
impl<I> IntoFallibleIterator for Iwhere
I: FallibleIterator,
§type Item = <I as FallibleIterator>::Item
type Item = <I as FallibleIterator>::Item
The elements of the iterator.
§type Error = <I as FallibleIterator>::Error
type Error = <I as FallibleIterator>::Error
The error value of the iterator.
§type IntoFallibleIter = I
type IntoFallibleIter = I
The iterator.
source§fn into_fallible_iter(self) -> I
fn into_fallible_iter(self) -> I
Creates a fallible iterator from a value.