Trait IntoInternalIterator

pub trait IntoInternalIterator {
    type Item;
    type IntoIter: InternalIterator<Item = Self::Item>;

    // Required method
    fn into_internal_iter(self) -> Self::IntoIter;
}

Conversion to an InternalIterator.

This is internal-iterator equivalent of std::iter::IntoIterator.

Required Associated Types

type Item

The type of the elements being iterated over.

type IntoIter: InternalIterator<Item = Self::Item>

Concrete iterator type returned by the conversion.

Required Methods

fn into_internal_iter(self) -> Self::IntoIter

Convert this type to an internal iterator.

Implementations on Foreign Types

impl<'a, K, V> IntoInternalIterator for &'a BTreeMap<K, V>

type Item = <&'a BTreeMap<K, V> as IntoIterator>::Item

type IntoIter = Internal<<&'a BTreeMap<K, V> as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<'a, K, V> IntoInternalIterator for &'a HashMap<K, V>

type Item = <&'a HashMap<K, V> as IntoIterator>::Item

type IntoIter = Internal<<&'a HashMap<K, V> as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<'a, K, V> IntoInternalIterator for &'a mut BTreeMap<K, V>

type Item = <&'a mut BTreeMap<K, V> as IntoIterator>::Item

type IntoIter = Internal<<&'a mut BTreeMap<K, V> as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<'a, K, V> IntoInternalIterator for &'a mut HashMap<K, V>

type Item = <&'a mut HashMap<K, V> as IntoIterator>::Item

type IntoIter = Internal<<&'a mut HashMap<K, V> as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<'a, T> IntoInternalIterator for &'a Option<T>

type Item = <&'a Option<T> as IntoIterator>::Item

type IntoIter = Internal<<&'a Option<T> as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<'a, T> IntoInternalIterator for &'a [T]

type Item = <&'a [T] as IntoIterator>::Item

type IntoIter = Internal<<&'a [T] as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<'a, T> IntoInternalIterator for &'a BTreeSet<T>

type Item = <&'a BTreeSet<T> as IntoIterator>::Item

type IntoIter = Internal<<&'a BTreeSet<T> as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<'a, T> IntoInternalIterator for &'a Vec<T>

type Item = <&'a Vec<T> as IntoIterator>::Item

type IntoIter = Internal<<&'a Vec<T> as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<'a, T> IntoInternalIterator for &'a HashSet<T>

type Item = <&'a HashSet<T> as IntoIterator>::Item

type IntoIter = Internal<<&'a HashSet<T> as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<'a, T> IntoInternalIterator for &'a mut Option<T>

type Item = <&'a mut Option<T> as IntoIterator>::Item

type IntoIter = Internal<<&'a mut Option<T> as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<'a, T> IntoInternalIterator for &'a mut [T]

type Item = <&'a mut [T] as IntoIterator>::Item

type IntoIter = Internal<<&'a mut [T] as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<'a, T> IntoInternalIterator for &'a mut Vec<T>

type Item = <&'a mut Vec<T> as IntoIterator>::Item

type IntoIter = Internal<<&'a mut Vec<T> as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<'a, T, E> IntoInternalIterator for &'a Result<T, E>

type Item = <&'a Result<T, E> as IntoIterator>::Item

type IntoIter = Internal<<&'a Result<T, E> as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<'a, T, E> IntoInternalIterator for &'a mut Result<T, E>

type Item = <&'a mut Result<T, E> as IntoIterator>::Item

type IntoIter = Internal<<&'a mut Result<T, E> as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<'a, T, const N: usize> IntoInternalIterator for &'a [T; N]

type Item = <&'a [T; N] as IntoIterator>::Item

type IntoIter = Internal<<&'a [T; N] as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<'a, T, const N: usize> IntoInternalIterator for &'a mut [T; N]

type Item = <&'a mut [T; N] as IntoIterator>::Item

type IntoIter = Internal<<&'a mut [T; N] as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<K, V> IntoInternalIterator for BTreeMap<K, V>

type Item = <BTreeMap<K, V> as IntoIterator>::Item

type IntoIter = Internal<<BTreeMap<K, V> as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<K, V> IntoInternalIterator for HashMap<K, V>

type Item = <HashMap<K, V> as IntoIterator>::Item

type IntoIter = Internal<<HashMap<K, V> as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<T> IntoInternalIterator for Option<T>

type Item = <Option<T> as IntoIterator>::Item

type IntoIter = Internal<<Option<T> as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<T> IntoInternalIterator for BTreeSet<T>

type Item = <BTreeSet<T> as IntoIterator>::Item

type IntoIter = Internal<<BTreeSet<T> as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<T> IntoInternalIterator for Vec<T>

type Item = <Vec<T> as IntoIterator>::Item

type IntoIter = Internal<<Vec<T> as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<T> IntoInternalIterator for HashSet<T>

type Item = <HashSet<T> as IntoIterator>::Item

type IntoIter = Internal<<HashSet<T> as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<T, E> IntoInternalIterator for Result<T, E>

type Item = <Result<T, E> as IntoIterator>::Item

type IntoIter = Internal<<Result<T, E> as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

impl<T, const N: usize> IntoInternalIterator for [T; N]

type Item = <[T; N] as IntoIterator>::Item

type IntoIter = Internal<<[T; N] as IntoIterator>::IntoIter>

fn into_internal_iter(self) -> Self::IntoIter

Implementors

impl<I> IntoInternalIterator for I

where I: InternalIterator,

type Item = <I as InternalIterator>::Item

type IntoIter = I