Trait enso_prelude::iter::IntoIterator 1.0.0[−][src]
pub trait IntoIterator { type Item; type IntoIter: Iterator; fn into_iter(self) -> Self::IntoIter; }
Expand description
Conversion into an Iterator
.
By implementing IntoIterator
for a type, you define how it will be
converted to an iterator. This is common for types which describe a
collection of some kind.
One benefit of implementing IntoIterator
is that your type will work
with Rust’s for
loop syntax.
See also: FromIterator
.
Examples
Basic usage:
let v = vec![1, 2, 3]; let mut iter = v.into_iter(); assert_eq!(Some(1), iter.next()); assert_eq!(Some(2), iter.next()); assert_eq!(Some(3), iter.next()); assert_eq!(None, iter.next());
Implementing IntoIterator
for your type:
// A sample collection, that's just a wrapper over Vec<T> #[derive(Debug)] struct MyCollection(Vec<i32>); // Let's give it some methods so we can create one and add things // to it. impl MyCollection { fn new() -> MyCollection { MyCollection(Vec::new()) } fn add(&mut self, elem: i32) { self.0.push(elem); } } // and we'll implement IntoIterator impl IntoIterator for MyCollection { type Item = i32; type IntoIter = std::vec::IntoIter<Self::Item>; fn into_iter(self) -> Self::IntoIter { self.0.into_iter() } } // Now we can make a new collection... let mut c = MyCollection::new(); // ... add some stuff to it ... c.add(0); c.add(1); c.add(2); // ... and then turn it into an Iterator: for (i, n) in c.into_iter().enumerate() { assert_eq!(i as i32, n); }
It is common to use IntoIterator
as a trait bound. This allows
the input collection type to change, so long as it is still an
iterator. Additional bounds can be specified by restricting on
Item
:
fn collect_as_strings<T>(collection: T) -> Vec<String> where T: IntoIterator, T::Item: std::fmt::Debug, { collection .into_iter() .map(|item| format!("{:?}", item)) .collect() }
Associated Types
Required methods
fn into_iter(self) -> Self::IntoIter
[src]
fn into_iter(self) -> Self::IntoIter
[src]Creates an iterator from a value.
See the module-level documentation for more.
Examples
Basic usage:
let v = vec![1, 2, 3]; let mut iter = v.into_iter(); assert_eq!(Some(1), iter.next()); assert_eq!(Some(2), iter.next()); assert_eq!(Some(3), iter.next()); assert_eq!(None, iter.next());
Implementations on Foreign Types
impl<'a> IntoIterator for &'a Path
[src]
impl<'a> IntoIterator for &'a Path
[src]impl<T> IntoIterator for Receiver<T>
[src]
impl<T> IntoIterator for Receiver<T>
[src]impl<'a, T> IntoIterator for &'a Receiver<T>
[src]
impl<'a, T> IntoIterator for &'a Receiver<T>
[src]impl<'a> IntoIterator for &'a PathBuf
[src]
impl<'a> IntoIterator for &'a PathBuf
[src]impl<'a, T, const N: usize> IntoIterator for &'a [T; N]
[src]
impl<'a, T, const N: usize> IntoIterator for &'a [T; N]
[src]impl<'a, T, const N: usize> IntoIterator for &'a mut [T; N]
[src]
impl<'a, T, const N: usize> IntoIterator for &'a mut [T; N]
[src]impl<'a, T, E> IntoIterator for &'a mut Result<T, E>
[src]
impl<'a, T, E> IntoIterator for &'a mut Result<T, E>
[src]impl<'a, T> IntoIterator for &'a Option<T>
[src]
impl<'a, T> IntoIterator for &'a Option<T>
[src]impl<'a, T, E> IntoIterator for &'a Result<T, E>
[src]
impl<'a, T, E> IntoIterator for &'a Result<T, E>
[src]impl<'a, T> IntoIterator for &'a [T]
[src]
impl<'a, T> IntoIterator for &'a [T]
[src]impl<'a, T> IntoIterator for &'a mut [T]
[src]
impl<'a, T> IntoIterator for &'a mut [T]
[src]impl<T, E> IntoIterator for Result<T, E>
[src]
impl<T, E> IntoIterator for Result<T, E>
[src]pub fn into_iter(self) -> IntoIter<T>ⓘ
[src]
pub fn into_iter(self) -> IntoIter<T>ⓘ
[src]Returns a consuming iterator over the possibly contained value.
The iterator yields one value if the result is Result::Ok
, otherwise none.
Examples
Basic usage:
let x: Result<u32, &str> = Ok(5); let v: Vec<u32> = x.into_iter().collect(); assert_eq!(v, [5]); let x: Result<u32, &str> = Err("nothing!"); let v: Vec<u32> = x.into_iter().collect(); assert_eq!(v, []);
impl<T, const N: usize> IntoIterator for [T; N]
[src]
impl<T, const N: usize> IntoIterator for [T; N]
[src]pub fn into_iter(self) -> <[T; N] as IntoIterator>::IntoIter
[src]
pub fn into_iter(self) -> <[T; N] as IntoIterator>::IntoIter
[src]Creates a consuming iterator, that is, one that moves each value out of
the array (from start to end). The array cannot be used after calling
this unless T
implements Copy
, so the whole array is copied.
Arrays have special behavior when calling .into_iter()
prior to the
2021 edition – see the array Editions section for more information.
impl<'a, T> IntoIterator for &'a mut Option<T>
[src]
impl<'a, T> IntoIterator for &'a mut Option<T>
[src]impl<T> IntoIterator for Option<T>
[src]
impl<T> IntoIterator for Option<T>
[src]impl<'a, T> IntoIterator for &'a mut VecDeque<T>
[src]
impl<'a, T> IntoIterator for &'a mut VecDeque<T>
[src]impl<'a, T> IntoIterator for &'a mut LinkedList<T>
[src]
impl<'a, T> IntoIterator for &'a mut LinkedList<T>
[src]impl<T> IntoIterator for BinaryHeap<T>
[src]
impl<T> IntoIterator for BinaryHeap<T>
[src]pub fn into_iter(self) -> IntoIter<T>ⓘ
[src]
pub fn into_iter(self) -> IntoIter<T>ⓘ
[src]Creates a consuming iterator, that is, one that moves each value out of the binary heap in arbitrary order. The binary heap cannot be used after calling this.
Examples
Basic usage:
use std::collections::BinaryHeap; let heap = BinaryHeap::from(vec![1, 2, 3, 4]); // Print 1, 2, 3, 4 in arbitrary order for x in heap.into_iter() { // x has type i32, not &i32 println!("{}", x); }
impl<'a, T> IntoIterator for &'a BinaryHeap<T>
[src]
impl<'a, T> IntoIterator for &'a BinaryHeap<T>
[src]impl<'a, T, A> IntoIterator for &'a mut Vec<T, A> where
A: Allocator,
[src]
impl<'a, T, A> IntoIterator for &'a mut Vec<T, A> where
A: Allocator,
[src]impl<T, A> IntoIterator for Vec<T, A> where
A: Allocator,
[src]
impl<T, A> IntoIterator for Vec<T, A> where
A: Allocator,
[src]pub fn into_iter(self) -> IntoIter<T, A>ⓘ
[src]
pub fn into_iter(self) -> IntoIter<T, A>ⓘ
[src]Creates a consuming iterator, that is, one that moves each value out of the vector (from start to end). The vector cannot be used after calling this.
Examples
let v = vec!["a".to_string(), "b".to_string()]; for s in v.into_iter() { // s has type String, not &String println!("{}", s); }
impl<'a, T> IntoIterator for &'a VecDeque<T>
[src]
impl<'a, T> IntoIterator for &'a VecDeque<T>
[src]impl<'a, T> IntoIterator for &'a LinkedList<T>
[src]
impl<'a, T> IntoIterator for &'a LinkedList<T>
[src]impl<T> IntoIterator for BTreeSet<T>
[src]
impl<T> IntoIterator for BTreeSet<T>
[src]impl<T> IntoIterator for LinkedList<T>
[src]
impl<T> IntoIterator for LinkedList<T>
[src]impl<'a, T, A> IntoIterator for &'a Vec<T, A> where
A: Allocator,
[src]
impl<'a, T, A> IntoIterator for &'a Vec<T, A> where
A: Allocator,
[src]impl<'a, T> IntoIterator for &'a BTreeSet<T>
[src]
impl<'a, T> IntoIterator for &'a BTreeSet<T>
[src]impl<T> IntoIterator for VecDeque<T>
[src]
impl<T> IntoIterator for VecDeque<T>
[src]impl<'a, K, I, F> IntoIterator for &'a GroupBy<K, I, F> where
F: FnMut(&<I as Iterator>::Item) -> K,
I: Iterator,
K: PartialEq<K>,
<I as Iterator>::Item: 'a,
[src]
impl<'a, K, I, F> IntoIterator for &'a GroupBy<K, I, F> where
F: FnMut(&<I as Iterator>::Item) -> K,
I: Iterator,
K: PartialEq<K>,
<I as Iterator>::Item: 'a,
[src]impl<'a, I> IntoIterator for &'a IntoChunks<I> where
I: Iterator,
<I as Iterator>::Item: 'a,
[src]
impl<'a, I> IntoIterator for &'a IntoChunks<I> where
I: Iterator,
<I as Iterator>::Item: 'a,
[src]type Item = Chunk<'a, I>
type IntoIter = Chunks<'a, I>
pub fn into_iter(self) -> <&'a IntoChunks<I> as IntoIterator>::IntoIter
[src]
impl<'a, I> IntoIterator for &'a RcIter<I> where
I: Iterator,
[src]
impl<'a, I> IntoIterator for &'a RcIter<I> where
I: Iterator,
[src]Return an iterator from &RcIter<I>
(by simply cloning it).
impl<T, S> IntoIterator for PtrWeakHashSet<T, S> where
T: WeakElement,
[src]
impl<T, S> IntoIterator for PtrWeakHashSet<T, S> where
T: WeakElement,
[src]type Item = <T as WeakElement>::Strong
type IntoIter = IntoIter<T>
pub fn into_iter(self) -> <PtrWeakHashSet<T, S> as IntoIterator>::IntoIter
[src]
impl<'a, K, V, S> IntoIterator for &'a PtrWeakKeyHashMap<K, V, S> where
K: WeakElement,
[src]
impl<'a, K, V, S> IntoIterator for &'a PtrWeakKeyHashMap<K, V, S> where
K: WeakElement,
[src]type Item = (<K as WeakElement>::Strong, &'a V)
type IntoIter = Iter<'a, ByPtr<K>, V>
pub fn into_iter(
self
) -> <&'a PtrWeakKeyHashMap<K, V, S> as IntoIterator>::IntoIter
[src]
self
) -> <&'a PtrWeakKeyHashMap<K, V, S> as IntoIterator>::IntoIter
impl<'a, K, V, S> IntoIterator for &'a mut PtrWeakKeyHashMap<K, V, S> where
K: WeakElement,
[src]
impl<'a, K, V, S> IntoIterator for &'a mut PtrWeakKeyHashMap<K, V, S> where
K: WeakElement,
[src]type Item = (<K as WeakElement>::Strong, &'a mut V)
type IntoIter = IterMut<'a, ByPtr<K>, V>
pub fn into_iter(
self
) -> <&'a mut PtrWeakKeyHashMap<K, V, S> as IntoIterator>::IntoIter
[src]
self
) -> <&'a mut PtrWeakKeyHashMap<K, V, S> as IntoIterator>::IntoIter
impl<'a, T, S> IntoIterator for &'a WeakHashSet<T, S> where
T: WeakKey,
[src]
impl<'a, T, S> IntoIterator for &'a WeakHashSet<T, S> where
T: WeakKey,
[src]type Item = <T as WeakElement>::Strong
type IntoIter = Iter<'a, T>
pub fn into_iter(self) -> <&'a WeakHashSet<T, S> as IntoIterator>::IntoIter
[src]
impl<'a, K, V, S> IntoIterator for &'a WeakWeakHashMap<K, V, S> where
K: WeakElement,
V: WeakElement,
[src]
impl<'a, K, V, S> IntoIterator for &'a WeakWeakHashMap<K, V, S> where
K: WeakElement,
V: WeakElement,
[src]type Item = (<K as WeakElement>::Strong, <V as WeakElement>::Strong)
type IntoIter = Iter<'a, K, V>
pub fn into_iter(
self
) -> <&'a WeakWeakHashMap<K, V, S> as IntoIterator>::IntoIter
[src]
self
) -> <&'a WeakWeakHashMap<K, V, S> as IntoIterator>::IntoIter
impl<'a, T, S> IntoIterator for &'a PtrWeakHashSet<T, S> where
T: WeakElement,
<T as WeakElement>::Strong: Deref,
[src]
impl<'a, T, S> IntoIterator for &'a PtrWeakHashSet<T, S> where
T: WeakElement,
<T as WeakElement>::Strong: Deref,
[src]type Item = <T as WeakElement>::Strong
type IntoIter = Iter<'a, T>
pub fn into_iter(self) -> <&'a PtrWeakHashSet<T, S> as IntoIterator>::IntoIter
[src]
impl<'a, K, V, S> IntoIterator for &'a PtrWeakWeakHashMap<K, V, S> where
K: WeakElement,
V: WeakElement,
[src]
impl<'a, K, V, S> IntoIterator for &'a PtrWeakWeakHashMap<K, V, S> where
K: WeakElement,
V: WeakElement,
[src]type Item = (<K as WeakElement>::Strong, <V as WeakElement>::Strong)
type IntoIter = Iter<'a, ByPtr<K>, V>
pub fn into_iter(
self
) -> <&'a PtrWeakWeakHashMap<K, V, S> as IntoIterator>::IntoIter
[src]
self
) -> <&'a PtrWeakWeakHashMap<K, V, S> as IntoIterator>::IntoIter
impl<K, V, S> IntoIterator for WeakWeakHashMap<K, V, S> where
K: WeakElement,
V: WeakElement,
[src]
impl<K, V, S> IntoIterator for WeakWeakHashMap<K, V, S> where
K: WeakElement,
V: WeakElement,
[src]type Item = (<K as WeakElement>::Strong, <V as WeakElement>::Strong)
type IntoIter = IntoIter<K, V>
pub fn into_iter(self) -> <WeakWeakHashMap<K, V, S> as IntoIterator>::IntoIter
[src]
impl<T, S> IntoIterator for WeakHashSet<T, S> where
T: WeakKey,
[src]
impl<T, S> IntoIterator for WeakHashSet<T, S> where
T: WeakKey,
[src]type Item = <T as WeakElement>::Strong
type IntoIter = IntoIter<T>
pub fn into_iter(self) -> <WeakHashSet<T, S> as IntoIterator>::IntoIter
[src]
impl<K, V, S> IntoIterator for PtrWeakWeakHashMap<K, V, S> where
K: WeakElement,
V: WeakElement,
[src]
impl<K, V, S> IntoIterator for PtrWeakWeakHashMap<K, V, S> where
K: WeakElement,
V: WeakElement,
[src]type Item = (<K as WeakElement>::Strong, <V as WeakElement>::Strong)
type IntoIter = IntoIter<ByPtr<K>, V>
pub fn into_iter(
self
) -> <PtrWeakWeakHashMap<K, V, S> as IntoIterator>::IntoIter
[src]
self
) -> <PtrWeakWeakHashMap<K, V, S> as IntoIterator>::IntoIter
impl<K, V, S> IntoIterator for PtrWeakKeyHashMap<K, V, S> where
K: WeakElement,
[src]
impl<K, V, S> IntoIterator for PtrWeakKeyHashMap<K, V, S> where
K: WeakElement,
[src]type Item = (<K as WeakElement>::Strong, V)
type IntoIter = IntoIter<ByPtr<K>, V>
pub fn into_iter(self) -> <PtrWeakKeyHashMap<K, V, S> as IntoIterator>::IntoIter
[src]
impl IntoIterator for Iterator
[src]
impl IntoIterator for Iterator
[src]impl<'a> IntoIterator for &'a Iterator
[src]
impl<'a> IntoIterator for &'a Iterator
[src]impl<'a, T, R, C, S> IntoIterator for &'a mut Matrix<T, R, C, S> where
C: Dim,
T: Scalar,
R: Dim,
S: StorageMut<T, R, C>,
[src]
impl<'a, T, R, C, S> IntoIterator for &'a mut Matrix<T, R, C, S> where
C: Dim,
T: Scalar,
R: Dim,
S: StorageMut<T, R, C>,
[src]type Item = &'a mut T
type IntoIter = MatrixIterMut<'a, T, R, C, S>
pub fn into_iter(self) -> <&'a mut Matrix<T, R, C, S> as IntoIterator>::IntoIter
[src]
impl<'a, T, R, C, S> IntoIterator for &'a Matrix<T, R, C, S> where
C: Dim,
T: Scalar,
R: Dim,
S: Storage<T, R, C>,
[src]
impl<'a, T, R, C, S> IntoIterator for &'a Matrix<T, R, C, S> where
C: Dim,
T: Scalar,
R: Dim,
S: Storage<T, R, C>,
[src]type Item = &'a T
type IntoIter = MatrixIter<'a, T, R, C, S>
pub fn into_iter(self) -> <&'a Matrix<T, R, C, S> as IntoIterator>::IntoIter
[src]
Implementors
impl<'a, A> IntoIterator for &'a SmallVec<A> where
A: Array,
[src]
impl<'a, A> IntoIterator for &'a SmallVec<A> where
A: Array,
[src]impl<'a, A> IntoIterator for &'a mut SmallVec<A> where
A: Array,
[src]
impl<'a, A> IntoIterator for &'a mut SmallVec<A> where
A: Array,
[src]impl<'a, K, V> IntoIterator for &'a BTreeMap<K, V>
[src]
impl<'a, K, V> IntoIterator for &'a BTreeMap<K, V>
[src]impl<'a, K, V> IntoIterator for &'a mut BTreeMap<K, V>
[src]
impl<'a, K, V> IntoIterator for &'a mut BTreeMap<K, V>
[src]impl<'a, K, V, S> IntoIterator for &'a HashMap<K, V, S>
[src]
impl<'a, K, V, S> IntoIterator for &'a HashMap<K, V, S>
[src]impl<'a, K, V, S> IntoIterator for &'a WeakKeyHashMap<K, V, S> where
K: WeakElement,
[src]
impl<'a, K, V, S> IntoIterator for &'a WeakKeyHashMap<K, V, S> where
K: WeakElement,
[src]type Item = (<K as WeakElement>::Strong, &'a V)
type IntoIter = Iter<'a, K, V>
pub fn into_iter(
self
) -> <&'a WeakKeyHashMap<K, V, S> as IntoIterator>::IntoIter
[src]
self
) -> <&'a WeakKeyHashMap<K, V, S> as IntoIterator>::IntoIter
impl<'a, K, V, S> IntoIterator for &'a WeakValueHashMap<K, V, S> where
V: WeakElement,
[src]
impl<'a, K, V, S> IntoIterator for &'a WeakValueHashMap<K, V, S> where
V: WeakElement,
[src]type Item = (&'a K, <V as WeakElement>::Strong)
type IntoIter = Iter<'a, K, V>
pub fn into_iter(
self
) -> <&'a WeakValueHashMap<K, V, S> as IntoIterator>::IntoIter
[src]
self
) -> <&'a WeakValueHashMap<K, V, S> as IntoIterator>::IntoIter
impl<'a, K, V, S> IntoIterator for &'a mut HashMap<K, V, S>
[src]
impl<'a, K, V, S> IntoIterator for &'a mut HashMap<K, V, S>
[src]impl<'a, K, V, S> IntoIterator for &'a mut WeakKeyHashMap<K, V, S> where
K: WeakElement,
[src]
impl<'a, K, V, S> IntoIterator for &'a mut WeakKeyHashMap<K, V, S> where
K: WeakElement,
[src]type Item = (<K as WeakElement>::Strong, &'a mut V)
type IntoIter = IterMut<'a, K, V>
pub fn into_iter(
self
) -> <&'a mut WeakKeyHashMap<K, V, S> as IntoIterator>::IntoIter
[src]
self
) -> <&'a mut WeakKeyHashMap<K, V, S> as IntoIterator>::IntoIter
impl<'a, T, S> IntoIterator for &'a HashSet<T, S>
[src]
impl<'a, T, S> IntoIterator for &'a HashSet<T, S>
[src]impl<A> IntoIterator for SmallVec<A> where
A: Array,
[src]
impl<A> IntoIterator for SmallVec<A> where
A: Array,
[src]impl<I> IntoIterator for I where
I: Iterator,
[src]
impl<I> IntoIterator for I where
I: Iterator,
[src]impl<K, V> IntoIterator for BTreeMap<K, V>
[src]
impl<K, V> IntoIterator for BTreeMap<K, V>
[src]impl<K, V, S> IntoIterator for HashMap<K, V, S>
[src]
impl<K, V, S> IntoIterator for HashMap<K, V, S>
[src]pub fn into_iter(self) -> IntoIter<K, V>ⓘ
[src]
pub fn into_iter(self) -> IntoIter<K, V>ⓘ
[src]Creates a consuming iterator, that is, one that moves each key-value pair out of the map in arbitrary order. The map cannot be used after calling this.
Examples
use std::collections::HashMap; let mut map = HashMap::new(); map.insert("a", 1); map.insert("b", 2); map.insert("c", 3); // Not possible with .iter() let vec: Vec<(&str, i32)> = map.into_iter().collect();
impl<K, V, S> IntoIterator for WeakKeyHashMap<K, V, S> where
K: WeakElement,
[src]
impl<K, V, S> IntoIterator for WeakKeyHashMap<K, V, S> where
K: WeakElement,
[src]type Item = (<K as WeakElement>::Strong, V)
type IntoIter = IntoIter<K, V>
pub fn into_iter(self) -> <WeakKeyHashMap<K, V, S> as IntoIterator>::IntoIter
[src]
impl<K, V, S> IntoIterator for WeakValueHashMap<K, V, S> where
V: WeakElement,
[src]
impl<K, V, S> IntoIterator for WeakValueHashMap<K, V, S> where
V: WeakElement,
[src]type Item = (K, <V as WeakElement>::Strong)
type IntoIter = IntoIter<K, V>
pub fn into_iter(self) -> <WeakValueHashMap<K, V, S> as IntoIterator>::IntoIter
[src]
impl<T, S> IntoIterator for HashSet<T, S>
[src]
impl<T, S> IntoIterator for HashSet<T, S>
[src]pub fn into_iter(self) -> IntoIter<T>ⓘ
[src]
pub fn into_iter(self) -> IntoIter<T>ⓘ
[src]Creates a consuming iterator, that is, one that moves each value out of the set in arbitrary order. The set cannot be used after calling this.
Examples
use std::collections::HashSet; let mut set = HashSet::new(); set.insert("a".to_string()); set.insert("b".to_string()); // Not possible to collect to a Vec<String> with a regular `.iter()`. let v: Vec<String> = set.into_iter().collect(); // Will print in an arbitrary order. for x in &v { println!("{}", x); }