Trait stdcli::prelude::itertools::__std_iter::IntoIterator 1.0.0
[−]
[src]
pub trait IntoIterator where
<Self::IntoIter as Iterator>::Item == Self::Item, { type Item; type IntoIter: Iterator; fn into_iter(self) -> Self::IntoIter; }
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<i32>; 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
type Item
The type of the elements being iterated over.
type IntoIter: Iterator
Which kind of iterator are we turning this into?
Required Methods
fn into_iter(self) -> Self::IntoIter
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, T> IntoIterator for &'a [T; 2]
[src]
impl<'a, T> IntoIterator for &'a [T; 12]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 3]
[src]
impl<'a, T> IntoIterator for &'a [T; 16]
[src]
impl<'a, T> IntoIterator for &'a [T; 10]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 21]
[src]
impl<'a, T> IntoIterator for &'a [T; 21]
[src]
impl<'a, T> IntoIterator for &'a [T; 1]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 22]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 1]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 26]
[src]
impl<'a, T> IntoIterator for &'a [T; 3]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 4]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 11]
[src]
impl<'a, T> IntoIterator for &'a [T; 25]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 9]
[src]
impl<'a, T> IntoIterator for &'a [T; 9]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 12]
[src]
impl<'a, T> IntoIterator for &'a [T; 20]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 18]
[src]
impl<'a, T> IntoIterator for &'a [T; 22]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 5]
[src]
impl<'a, T> IntoIterator for &'a [T; 13]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 2]
[src]
impl<'a, T> IntoIterator for &'a [T; 32]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 13]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 16]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 25]
[src]
impl<'a, T> IntoIterator for &'a [T; 18]
[src]
impl<'a, T> IntoIterator for &'a [T; 30]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 31]
[src]
impl<'a, T> IntoIterator for &'a [T; 27]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 0]
[src]
impl<'a, T> IntoIterator for &'a [T; 26]
[src]
impl<'a, T> IntoIterator for &'a [T; 6]
[src]
impl<'a, T> IntoIterator for &'a [T; 4]
[src]
impl<T> IntoIterator for Option<T>
[src]
type Item = T
type IntoIter = IntoIter<T>
fn into_iter(self) -> IntoIter<T>
[src]
Returns a consuming iterator over the possibly contained value.
Examples
let x = Some("string"); let v: Vec<&str> = x.into_iter().collect(); assert_eq!(v, ["string"]); let x = None; let v: Vec<&str> = x.into_iter().collect(); assert!(v.is_empty());
impl<'a, T> IntoIterator for &'a mut [T; 19]
[src]
impl<'a, T> IntoIterator for &'a [T; 17]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 20]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 7]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 28]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 32]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 8]
[src]
impl<'a, T, E> IntoIterator for &'a Result<T, E>
[src]
impl<'a, T> IntoIterator for &'a [T; 23]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 27]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 15]
[src]
impl<'a, T> IntoIterator for &'a [T; 8]
[src]
impl<'a, T> IntoIterator for &'a Option<T>
[src]
impl<'a, T> IntoIterator for &'a mut [T; 6]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 23]
[src]
impl<'a, T> IntoIterator for &'a [T; 28]
[src]
impl<'a, T> IntoIterator for &'a [T; 29]
[src]
impl<'a, T> IntoIterator for &'a [T; 19]
[src]
impl<'a, T> IntoIterator for &'a mut Option<T>
[src]
impl<'a, T> IntoIterator for &'a [T; 7]
[src]
impl<'a, T> IntoIterator for &'a [T]
[src]
impl<T, E> IntoIterator for Result<T, E>
[src]
type Item = T
type IntoIter = IntoIter<T>
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 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<'a, T> IntoIterator for &'a mut [T; 29]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 24]
[src]
impl<'a, T> IntoIterator for &'a [T; 11]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 10]
[src]
impl<'a, T> IntoIterator for &'a [T; 0]
[src]
impl<'a, T> IntoIterator for &'a [T; 14]
[src]
impl<'a, T> IntoIterator for &'a [T; 5]
[src]
impl<'a, T> IntoIterator for &'a [T; 31]
[src]
impl<'a, T> IntoIterator for &'a mut [T]
[src]
impl<'a, T> IntoIterator for &'a [T; 24]
[src]
impl<'a, T> IntoIterator for &'a [T; 15]
[src]
impl<'a, T, E> IntoIterator for &'a mut Result<T, E>
[src]
impl<'a, T> IntoIterator for &'a mut [T; 17]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 30]
[src]
impl<'a, T> IntoIterator for &'a mut [T; 14]
[src]
impl<'a, T> IntoIterator for &'a OrderedSet<T>
[src]
impl<'a, K, V> IntoIterator for &'a Map<K, V>
[src]
impl<'a, K, V> IntoIterator for &'a OrderedMap<K, V>
[src]
impl<'a, T> IntoIterator for &'a Set<T>
[src]
impl IntoIterator for Events
[src]
impl<'a> IntoIterator for &'a Events
[src]
impl<K, V, S> IntoIterator for LinkedHashMap<K, V, S> where
K: Eq + Hash,
S: BuildHasher,
K: Eq + Hash,
S: BuildHasher,
impl<'a, K, V, S> IntoIterator for &'a mut LinkedHashMap<K, V, S> where
K: Eq + Hash,
S: BuildHasher,
K: Eq + Hash,
S: BuildHasher,
impl<'a, K, V, S> IntoIterator for &'a LinkedHashMap<K, V, S> where
K: Eq + Hash,
S: BuildHasher,
K: Eq + Hash,
S: BuildHasher,
impl<'a> IntoIterator for &'a ByteClass
impl IntoIterator for CharClass
impl IntoIterator for ByteClass
impl<'a> IntoIterator for &'a CharClass
impl<'a, T> IntoIterator for &'a VecDeque<T>
[src]
impl<'a, T> IntoIterator for &'a Vec<T>
[src]
impl<T> IntoIterator for Vec<T>
[src]
type Item = T
type IntoIter = IntoIter<T>
fn into_iter(self) -> IntoIter<T>
[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, K, V> IntoIterator for &'a BTreeMap<K, V> where
K: 'a,
V: 'a,
[src]
K: 'a,
V: 'a,
impl<T> IntoIterator for VecDeque<T>
[src]
impl<'a, K, V> IntoIterator for &'a mut BTreeMap<K, V> where
K: 'a,
V: 'a,
[src]
K: 'a,
V: 'a,
impl<K, V> IntoIterator for BTreeMap<K, V>
[src]
impl<'a, T> IntoIterator for &'a BTreeSet<T>
[src]
impl<T> IntoIterator for LinkedList<T>
[src]
impl<'a, T> IntoIterator for &'a LinkedList<T>
[src]
impl<'a, T> IntoIterator for &'a mut Vec<T>
[src]
impl<T> IntoIterator for BinaryHeap<T> where
T: Ord,
[src]
T: Ord,
type Item = T
type IntoIter = IntoIter<T>
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<T> IntoIterator for BTreeSet<T>
[src]
type Item = T
type IntoIter = IntoIter<T>
fn into_iter(self) -> IntoIter<T>
[src]
Gets an iterator for moving out the BTreeSet
's contents.
Examples
use std::collections::BTreeSet; let set: BTreeSet<usize> = [1, 2, 3, 4].iter().cloned().collect(); let v: Vec<_> = set.into_iter().collect(); assert_eq!(v, [1, 2, 3, 4]);
impl<'a, T> IntoIterator for &'a BinaryHeap<T> where
T: Ord,
[src]
T: Ord,
impl<'a, T> IntoIterator for &'a mut LinkedList<T>
[src]
impl<'a, T> IntoIterator for &'a mut VecDeque<T>
[src]
impl<'a> IntoIterator for &'a Bytes
[src]
impl IntoIterator for BytesMut
[src]
impl<'a> IntoIterator for &'a BytesMut
[src]
impl IntoIterator for Bytes
[src]
impl<'a, T> IntoIterator for &'a mut ThreadLocal<T> where
T: 'a + Send + ?Sized,
T: 'a + Send + ?Sized,
impl<T> IntoIterator for CachedThreadLocal<T> where
T: Send + ?Sized,
T: Send + ?Sized,
impl<T> IntoIterator for ThreadLocal<T> where
T: Send + ?Sized,
T: Send + ?Sized,
impl<'a, T> IntoIterator for &'a mut CachedThreadLocal<T> where
T: 'a + Send + ?Sized,
T: 'a + Send + ?Sized,
impl<'a, T> IntoIterator for &'a mut Slab<T>
[src]
impl<'a, T> IntoIterator for &'a Slab<T>
[src]
impl<'a> IntoIterator for &'a Path
[src]
impl<'a> IntoIterator for &'a UnixListener
[src]
impl<T> IntoIterator for Receiver<T>
[src]
impl<'a> IntoIterator for &'a PathBuf
[src]
impl<'a, T> IntoIterator for &'a Receiver<T>
[src]
impl<'a, K, V, S> IntoIterator for &'a mut HashMap<K, V, S> where
K: Eq + Hash,
S: BuildHasher,
[src]
K: Eq + Hash,
S: BuildHasher,
impl<K, V, S> IntoIterator for HashMap<K, V, S> where
K: Eq + Hash,
S: BuildHasher,
[src]
K: Eq + Hash,
S: BuildHasher,
type Item = (K, V)
type IntoIter = IntoIter<K, V>
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, isize)> = map.into_iter().collect();
impl<'a, K, V, S> IntoIterator for &'a HashMap<K, V, S> where
K: Eq + Hash,
S: BuildHasher,
[src]
K: Eq + Hash,
S: BuildHasher,
impl<T, S> IntoIterator for HashSet<T, S> where
S: BuildHasher,
T: Eq + Hash,
[src]
S: BuildHasher,
T: Eq + Hash,
type Item = T
type IntoIter = IntoIter<T>
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); }
impl<'a, T, S> IntoIterator for &'a HashSet<T, S> where
S: BuildHasher,
T: Eq + Hash,
[src]
S: BuildHasher,
T: Eq + Hash,
impl<T> IntoIterator for VecMap<T>
type Item = (usize, T)
type IntoIter = IntoIter<T>
fn into_iter(self) -> IntoIter<T>
Returns an iterator visiting all key-value pairs in ascending order of
the keys, consuming the original VecMap
.
The iterator's element type is (usize, &'r V)
.
Examples
use vec_map::VecMap; let mut map = VecMap::new(); map.insert(1, "a"); map.insert(3, "c"); map.insert(2, "b"); let vec: Vec<(usize, &str)> = map.into_iter().collect(); assert_eq!(vec, [(1, "a"), (2, "b"), (3, "c")]);
impl<'a, T> IntoIterator for &'a mut VecMap<T>
impl<'a, T> IntoIterator for &'a VecMap<T>
impl<A> IntoIterator for SmallVec<A> where
A: Array,
A: Array,
type IntoIter = IntoIter<A>
type Item = <A as Array>::Item
fn into_iter(self) -> <SmallVec<A> as IntoIterator>::IntoIter
impl<'a, A> IntoIterator for &'a mut SmallVec<A> where
A: Array,
A: Array,
impl<'a, A> IntoIterator for &'a SmallVec<A> where
A: Array,
A: Array,
impl<'a, T> IntoIterator for &'a StackRef<T> where
T: Stackable,
[src]
T: Stackable,
impl<'a, T> IntoIterator for &'a Stack<T> where
T: Stackable,
[src]
T: Stackable,
impl<T> IntoIterator for Stack<T> where
T: Stackable,
[src]
T: Stackable,
impl<'a, T> IntoIterator for &'a mut StackRef<T> where
T: Stackable,
[src]
T: Stackable,
impl<'a, T> IntoIterator for &'a mut Stack<T> where
T: Stackable,
[src]
T: Stackable,
impl IntoIterator for Chunk
[src]
impl IntoIterator for Yaml
impl<'a> IntoIterator for &'a Utf8Sequence
impl<'a, A> IntoIterator for &'a SmallVec<A> where
A: Array,
A: Array,
impl<A> IntoIterator for SmallVec<A> where
A: Array,
A: Array,
type IntoIter = IntoIter<A>
type Item = <A as Array>::Item
fn into_iter(self) -> <SmallVec<A> as IntoIterator>::IntoIter
impl<'a, A> IntoIterator for &'a mut SmallVec<A> where
A: Array,
A: Array,
impl<'a, T, I> IntoIterator for &'a Slab<T, I> where
I: Into<usize> + From<usize>,
I: Into<usize> + From<usize>,
impl<'a, T, I> IntoIterator for &'a mut Slab<T, I> where
I: Into<usize> + From<usize>,
I: Into<usize> + From<usize>,
Implementors
impl<'a> IntoIterator for &'a stdcli::prelude::serde_json::Map<String, Value> type Item = (&'a String, &'a Value); type IntoIter = Iter<'a>;
impl IntoIterator for stdcli::prelude::serde_json::Map<String, Value> type Item = (String, Value); type IntoIter = IntoIter;
impl<'a> IntoIterator for &'a mut stdcli::prelude::serde_json::Map<String, Value> type Item = (&'a String, &'a mut Value); type IntoIter = IterMut<'a>;
impl<I> IntoIterator for I where
I: Iterator, type Item = <I as Iterator>::Item; type IntoIter = I;impl<'a, I> IntoIterator for &'a RcIter<I> where
I: Iterator, type Item = <I as Iterator>::Item; type IntoIter = RcIter<I>;impl<'a, I> IntoIterator for &'a IntoChunks<I> where
I: Iterator,
<I as Iterator>::Item: 'a, type Item = Chunk<'a, I>; type IntoIter = Chunks<'a, I>;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, type Item = (K, Group<'a, K, I, F>); type IntoIter = Groups<'a, K, I, F>;impl IntoIterator for WalkDir type Item = Result<DirEntry, Error>; type IntoIter = IntoIter;
impl<'a> IntoIterator for &'a mut Mapping type Item = (&'a Value, &'a mut Value); type IntoIter = IterMut<'a>;
impl IntoIterator for Mapping type Item = (Value, Value); type IntoIter = IntoIter;
impl<'a> IntoIterator for &'a Mapping type Item = (&'a Value, &'a Value); type IntoIter = Iter<'a>;
impl IntoIterator for stdcli::prelude::regex::SetMatches type IntoIter = SetMatchesIntoIter; type Item = usize;
impl<'a> IntoIterator for &'a stdcli::prelude::regex::SetMatches type IntoIter = SetMatchesIter<'a>; type Item = usize;
impl<'a> IntoIterator for &'a stdcli::prelude::regex::bytes::SetMatches type IntoIter = SetMatchesIter<'a>; type Item = usize;
impl IntoIterator for stdcli::prelude::regex::bytes::SetMatches type IntoIter = SetMatchesIntoIter; type Item = usize;
impl<'a> IntoIterator for &'a Raw type IntoIter = RawLines<'a>; type Item = &'a [u8];