Struct Iter 

#[repr(transparent)]
pub struct Iter<I>(pub I)
where
    I: IntoIterator;

Wrapper around IntoIterator to avoid trait impl conflicts.

Tuple Fields

0: I

Trait Implementations

impl<T, I> CanReceive<Iter<I>> for VecHandoff<T>

where I: Iterator<Item = T>,

fn give(&self, iter: Iter<I>) -> Iter<I>

Give a value to the handoff.

impl<I> Clone for Iter<I>

where I: IntoIterator + Clone,

fn clone(&self) -> Iter<I>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<I> Debug for Iter<I>

where I: IntoIterator + Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<I> Hash for Iter<I>

where I: IntoIterator + Hash,

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<I> IntoIterator for Iter<I>

where I: IntoIterator,

type Item = <I as IntoIterator>::Item

The type of the elements being iterated over.

type IntoIter = <I 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<I> Ord for Iter<I>

where I: IntoIterator + Ord,

fn cmp(&self, other: &Iter<I>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<I> PartialEq for Iter<I>

where I: IntoIterator + PartialEq,

fn eq(&self, other: &Iter<I>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<I> PartialOrd for Iter<I>

where I: IntoIterator + PartialOrd,

fn partial_cmp(&self, other: &Iter<I>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<I> Copy for Iter<I>

where I: IntoIterator + Copy,

impl<I> Eq for Iter<I>

where I: IntoIterator + Eq,

impl<I> StructuralPartialEq for Iter<I>

where I: IntoIterator,