Trait wasmtime_wiggle::bitflags::_core::prelude::rust_2015::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 UnixListener
[src]
impl<'a> IntoIterator for &'a UnixListener
[src]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 &'a PathBuf
[src]
impl<'a> IntoIterator for &'a PathBuf
[src]impl<T> IntoIterator for Receiver<T>
[src]
impl<T> IntoIterator for Receiver<T>
[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); }
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<'a> IntoIterator for &'a Path
[src]
impl<'a> IntoIterator for &'a Path
[src]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 HashMap<K, V, S>
[src]
impl<'a, K, V, S> IntoIterator for &'a HashMap<K, V, S>
[src]impl<'a, T> IntoIterator for &'a Receiver<T>
[src]
impl<'a, T> IntoIterator for &'a Receiver<T>
[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<'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<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, const N: usize> IntoIterator for &'a [T; N]
[src]
impl<'a, T, const N: usize> IntoIterator for &'a [T; N]
[src]impl<'a, T> IntoIterator for &'a BinaryHeap<T>
[src]
impl<'a, T> IntoIterator for &'a BinaryHeap<T>
[src]impl<K, V> IntoIterator for BTreeMap<K, V>
[src]
impl<K, V> IntoIterator for BTreeMap<K, V>
[src]impl<T> IntoIterator for BTreeSet<T>
[src]
impl<T> IntoIterator for BTreeSet<T>
[src]impl<'a, T> IntoIterator for &'a LinkedList<T>
[src]
impl<'a, T> IntoIterator for &'a LinkedList<T>
[src]impl<T> IntoIterator for VecDeque<T>
[src]
impl<T> IntoIterator for VecDeque<T>
[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, K, V> IntoIterator for &'a BTreeMap<K, V>
[src]
impl<'a, K, V> IntoIterator for &'a BTreeMap<K, V>
[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, 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> IntoIterator for LinkedList<T>
[src]
impl<T> IntoIterator for LinkedList<T>
[src]impl<'a, T> IntoIterator for &'a BTreeSet<T>
[src]
impl<'a, T> IntoIterator for &'a BTreeSet<T>
[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, T> IntoIterator for &'a mut VecDeque<T>
[src]
impl<'a, T> IntoIterator for &'a mut VecDeque<T>
[src]impl<'a, T> IntoIterator for &'a VecDeque<T>
[src]
impl<'a, T> IntoIterator for &'a VecDeque<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 mut LinkedList<T>
[src]
impl<'a, T> IntoIterator for &'a mut LinkedList<T>
[src]impl<'a, A> IntoIterator for &'a SmallVec<A> where
A: Array,
impl<'a, A> IntoIterator for &'a SmallVec<A> where
A: Array,
impl<'a, A> IntoIterator for &'a mut SmallVec<A> where
A: Array,
impl<'a, A> IntoIterator for &'a mut SmallVec<A> where
A: Array,
impl<A> IntoIterator for SmallVec<A> where
A: Array,
impl<A> IntoIterator for SmallVec<A> where
A: Array,
type IntoIter = IntoIter<A>
type Item = <A as Array>::Item
pub fn into_iter(self) -> <SmallVec<A> as IntoIterator>::IntoIter
impl<'f> IntoIterator for &'f Layout
impl<'f> IntoIterator for &'f Layout
Use a layout reference in a for loop.
impl<K, V> IntoIterator for PrimaryMap<K, V> where
K: EntityRef,
impl<K, V> IntoIterator for PrimaryMap<K, V> where
K: EntityRef,
impl<'a, K, V> IntoIterator for &'a PrimaryMap<K, V> where
K: EntityRef,
impl<'a, K, V> IntoIterator for &'a PrimaryMap<K, V> where
K: EntityRef,
impl<'a, K, V> IntoIterator for &'a mut BoxedSlice<K, V> where
K: EntityRef,
impl<'a, K, V> IntoIterator for &'a mut BoxedSlice<K, V> where
K: EntityRef,
impl<'a, K, V> IntoIterator for &'a mut PrimaryMap<K, V> where
K: EntityRef,
impl<'a, K, V> IntoIterator for &'a mut PrimaryMap<K, V> where
K: EntityRef,
impl<'a, K, V> IntoIterator for &'a SparseMap<K, V> where
K: EntityRef,
V: SparseMapValue<K>,
impl<'a, K, V> IntoIterator for &'a SparseMap<K, V> where
K: EntityRef,
V: SparseMapValue<K>,
Iterating over the elements of a set.
impl<'a, K, V> IntoIterator for &'a BoxedSlice<K, V> where
K: EntityRef,
impl<'a, K, V> IntoIterator for &'a BoxedSlice<K, V> where
K: EntityRef,
impl<'a, K, V, S> IntoIterator for &'a mut IndexMap<K, V, S>
[src]
impl<'a, K, V, S> IntoIterator for &'a mut IndexMap<K, V, S>
[src]impl<'a, K, V, S> IntoIterator for &'a IndexMap<K, V, S>
[src]
impl<'a, K, V, S> IntoIterator for &'a IndexMap<K, V, S>
[src]impl<T, S> IntoIterator for IndexSet<T, S>
[src]
impl<T, S> IntoIterator for IndexSet<T, S>
[src]impl<K, V, S> IntoIterator for IndexMap<K, V, S>
[src]
impl<K, V, S> IntoIterator for IndexMap<K, V, S>
[src]impl<'a, T, S> IntoIterator for &'a IndexSet<T, S>
[src]
impl<'a, T, S> IntoIterator for &'a IndexSet<T, S>
[src]impl<K, V, S> IntoIterator for HashMap<K, V, S>
impl<K, V, S> IntoIterator for HashMap<K, V, S>
pub fn into_iter(self) -> IntoIter<K, V>ⓘ
pub fn into_iter(self) -> IntoIter<K, V>ⓘ
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 hashbrown::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<'a, T, S> IntoIterator for &'a HashSet<T, S>
impl<'a, T, S> IntoIterator for &'a HashSet<T, S>
impl<T> IntoIterator for RawTable<T>
impl<T> IntoIterator for RawTable<T>
impl<T, S> IntoIterator for HashSet<T, S>
impl<T, S> IntoIterator for HashSet<T, S>
pub fn into_iter(self) -> IntoIter<T>ⓘ
pub fn into_iter(self) -> IntoIter<T>ⓘ
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 hashbrown::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, K, V, S> IntoIterator for &'a mut HashMap<K, V, S>
impl<'a, K, V, S> IntoIterator for &'a mut HashMap<K, V, S>
impl<'a, K, V, S> IntoIterator for &'a HashMap<K, V, S>
impl<'a, K, V, S> IntoIterator for &'a HashMap<K, V, S>
impl<T> IntoIterator for Range<T> where
T: Copy + PartialOrd<T> + PlusN,
impl<T> IntoIterator for Range<T> where
T: Copy + PartialOrd<T> + PlusN,
type Item = T
type IntoIter = MyIterator<T>
pub fn into_iter(self) -> <Range<T> as IntoIterator>::IntoIter
impl<'a> IntoIterator for DataSectionReader<'a>
impl<'a> IntoIterator for DataSectionReader<'a>
impl<'a> IntoIterator for RelocSectionReader<'a>
impl<'a> IntoIterator for RelocSectionReader<'a>
impl<'a> IntoIterator for ProducersSectionReader<'a>
impl<'a> IntoIterator for ProducersSectionReader<'a>
impl<'a> IntoIterator for ElementItemsReader<'a>
impl<'a> IntoIterator for ElementItemsReader<'a>
impl<'a> IntoIterator for CodeSectionReader<'a>
impl<'a> IntoIterator for CodeSectionReader<'a>
pub fn into_iter(self) -> <CodeSectionReader<'a> as IntoIterator>::IntoIter
pub fn into_iter(self) -> <CodeSectionReader<'a> as IntoIterator>::IntoIter
Implements iterator over the code section.
Examples
use wasmparser::CodeSectionReader; let mut code_reader = CodeSectionReader::new(data, 0).unwrap(); for body in code_reader { let mut binary_reader = body.expect("b").get_binary_reader(); assert!(binary_reader.read_var_u32().expect("local count") == 0); let op = binary_reader.read_operator().expect("first operator"); println!("First operator: {:?}", op); }
impl<'a> IntoIterator for AliasSectionReader<'a>
impl<'a> IntoIterator for AliasSectionReader<'a>
impl<'a> IntoIterator for LocalsReader<'a>
impl<'a> IntoIterator for LocalsReader<'a>
impl<'a> IntoIterator for TypeSectionReader<'a>
impl<'a> IntoIterator for TypeSectionReader<'a>
pub fn into_iter(self) -> <TypeSectionReader<'a> as IntoIterator>::IntoIter
pub fn into_iter(self) -> <TypeSectionReader<'a> as IntoIterator>::IntoIter
Implements iterator over the type section.
Examples
use wasmparser::TypeSectionReader; let mut type_reader = TypeSectionReader::new(data, 0).unwrap(); for ty in type_reader { println!("Type {:?}", ty); }
impl<'a> IntoIterator for EventSectionReader<'a>
impl<'a> IntoIterator for EventSectionReader<'a>
impl<'a> IntoIterator for OperatorsReader<'a>
impl<'a> IntoIterator for OperatorsReader<'a>
pub fn into_iter(self) -> <OperatorsReader<'a> as IntoIterator>::IntoIter
pub fn into_iter(self) -> <OperatorsReader<'a> as IntoIterator>::IntoIter
Reads content of the code section.
Examples
use wasmparser::{Operator, CodeSectionReader, Result}; let mut code_reader = CodeSectionReader::new(data, 0).unwrap(); for _ in 0..code_reader.get_count() { let body = code_reader.read().expect("function body"); let mut op_reader = body.get_operators_reader().expect("op reader"); let ops = op_reader.into_iter().collect::<Result<Vec<Operator>>>().expect("ops"); assert!( if let [Operator::Nop, Operator::End] = ops.as_slice() { true } else { false }, "found {:?}", ops ); }
impl<'a> IntoIterator for ElementSectionReader<'a>
impl<'a> IntoIterator for ElementSectionReader<'a>
impl<'a> IntoIterator for FunctionSectionReader<'a>
impl<'a> IntoIterator for FunctionSectionReader<'a>
impl<'a> IntoIterator for InstanceArgsReader<'a>
impl<'a> IntoIterator for InstanceArgsReader<'a>
impl<'a> IntoIterator for GlobalSectionReader<'a>
impl<'a> IntoIterator for GlobalSectionReader<'a>
impl<'a> IntoIterator for ImportSectionReader<'a>
impl<'a> IntoIterator for ImportSectionReader<'a>
impl<'a> IntoIterator for NameSectionReader<'a>
impl<'a> IntoIterator for NameSectionReader<'a>
impl<'a> IntoIterator for InstanceSectionReader<'a>
impl<'a> IntoIterator for InstanceSectionReader<'a>
impl<'a> IntoIterator for ModuleSectionReader<'a>
impl<'a> IntoIterator for ModuleSectionReader<'a>
impl<'a> IntoIterator for ExportSectionReader<'a>
impl<'a> IntoIterator for ExportSectionReader<'a>
impl<'a> IntoIterator for ProducersFieldValuesReader<'a>
impl<'a> IntoIterator for ProducersFieldValuesReader<'a>
impl<'a> IntoIterator for MemorySectionReader<'a>
impl<'a> IntoIterator for MemorySectionReader<'a>
impl<'a> IntoIterator for TableSectionReader<'a>
impl<'a> IntoIterator for TableSectionReader<'a>
impl<'a> IntoIterator for LinkingSectionReader<'a>
impl<'a> IntoIterator for LinkingSectionReader<'a>
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<'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, K, I, F> IntoIterator for &'a GroupBy<K, I, F> where
F: FnMut(&<I as Iterator>::Item) -> K,
K: PartialEq<K>,
I: Iterator,
<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,
K: PartialEq<K>,
I: Iterator,
<I as Iterator>::Item: 'a,
[src]impl IntoIterator for IndexVec
[src]
impl IntoIterator for IndexVec
[src]pub fn into_iter(self) -> IndexVecIntoIterⓘNotable traits for IndexVecIntoIter
impl Iterator for IndexVecIntoIter type Item = usize;
[src]
pub fn into_iter(self) -> IndexVecIntoIterⓘNotable traits for IndexVecIntoIter
impl Iterator for IndexVecIntoIter type Item = usize;
[src]Convert into an iterator over the indices as a sequence of usize
values
Implementors
impl<'a> IntoIterator for &'a FieldSet
[src]
impl<'a> IntoIterator for &'a FieldSet
[src]impl<'a, T> IntoIterator for &'a Option<T>
1.4.0[src]
impl<'a, T> IntoIterator for &'a Option<T>
1.4.0[src]impl<'a, T> IntoIterator for &'a mut Option<T>
1.4.0[src]
impl<'a, T> IntoIterator for &'a mut Option<T>
1.4.0[src]impl<'a, T, E> IntoIterator for &'a Result<T, E>
1.4.0[src]
impl<'a, T, E> IntoIterator for &'a Result<T, E>
1.4.0[src]impl<'a, T, E> IntoIterator for &'a mut Result<T, E>
1.4.0[src]
impl<'a, T, E> IntoIterator for &'a mut Result<T, E>
1.4.0[src]impl<I> IntoIterator for I where
I: Iterator,
[src]
impl<I> IntoIterator for I where
I: Iterator,
[src]impl<T> IntoIterator for Option<T>
[src]
impl<T> IntoIterator for Option<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, []);