Struct nonempty_collections::iter::Chain

pub struct Chain<A, B> { /* private fields */ }

A non-empty iterator that links two iterators together, in a chain.

Trait Implementations

impl<A, B> IntoIterator for Chain<A, B>

where A: IntoIterator, B: IntoIterator<Item = A::Item>,

type Item = <A as IntoIterator>::Item

The type of the elements being iterated over.

type IntoIter = Chain<<A as IntoIterator>::IntoIter, <B as IntoIterator>::IntoIter>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<A, B> NonEmptyIterator for Chain<A, B>

where A: NonEmptyIterator, B: Iterator<Item = A::Item>,

type Item = <A as NonEmptyIterator>::Item

The value produced by this iterator.

type IntoIter = Chain<<<A as NonEmptyIterator>::IntoIter as IntoIterator>::IntoIter, B>

Each NonEmptyIterator knows about a possibly-empty variant of itself, likely from std. Critically, they share an Item.

fn first(self) -> (Self::Item, Self::IntoIter)

A NonEmptyIterator can, by consuming itself, reliably produce its first element, alongside its possibly-empty variant.

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value.

fn all<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate.

fn any<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate.

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter>

where Self: Sized, U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new non-empty iterator over both in sequence.

fn cloned<'a, T>(self) -> Cloned<Self>

where Self: Sized + NonEmptyIterator<Item = &'a T>, T: Clone + 'a,

Creates a non-empty iterator which clones all of its elements.

fn collect<B>(self) -> B

where Self: Sized, B: FromNonEmptyIterator<Self::Item>,

Transforms an iterator into a collection, or some other concrete value.

fn copied<'a, T>(self) -> Copied<Self>

where Self: Sized + NonEmptyIterator<Item = &'a T>, T: Copy + 'a,

Creates a non-empty iterator which copies all of its elements.

fn count(self) -> NonZeroUsize

where Self: Sized,

Consumes the non-empty iterator, counting the number of iterations and returning it.

fn enumerate(self) -> Enumerate<Self>

where Self: Sized,

Creates a non-empty iterator which gives the current iteration count as well as the next value.

fn flat_map<U, V, F>(self, f: F) -> FlatMap<Self, V, F>

where Self: Sized, F: FnMut(Self::Item) -> U, U: IntoNonEmptyIterator<IntoIter = V, Item = V::Item>, V: NonEmptyIterator,

Creates an iterator that works like map, but flattens nested, non-empty structure.

fn fold<B, F>(self, init: B, f: F) -> B

where Self: Sized, F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, returning the final result.

fn map<U, F>(self, f: F) -> Map<Self, F>

where Self: Sized, F: FnMut(Self::Item) -> U,

Takes a closure and creates a non-empty iterator which calls that closure on each element.

fn max_by<F>(self, compare: F) -> Self::Item

where Self: Sized, F: Fn(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the maximum value with respect to the given comparison function.

fn max_by_key<B, F>(self, key: F) -> Self::Item

where Self: Sized, B: Ord, F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the specified function.

fn min_by<F>(self, compare: F) -> Self::Item

where Self: Sized, F: Fn(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the minimum value with respect to the given comparison function.

fn min_by_key<B, F>(self, key: F) -> Self::Item

where Self: Sized, B: Ord, F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the specified function.

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator.

fn take(self, n: usize) -> Take<Self>

where Self: Sized,

Iterates over the first n elements, or fewer if the underlying iterator ends sooner.

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter>

where Self: Sized, U: IntoNonEmptyIterator,

“Zips up” two non-empty iterators into a single one, while preserving non-emptiness.

fn reduce<F>(self, f: F) -> Self::Item

where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Self::Item,

Reduces the elements to a single one, by repeatedly applying a reducing operation.