Trait tor_hsservice::internal_prelude::iter::IntoIterator
1.0.0 · source · pub trait IntoIterator {
type Item;
type IntoIter: Iterator<Item = Self::Item>;
// Required method
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 = [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()
}
Required Associated Types§
Required Methods§
1.0.0 · sourcefn into_iter(self) -> Self::IntoIter
fn into_iter(self) -> Self::IntoIter
Creates an iterator from a value.
See the module-level documentation for more.
§Examples
let v = [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());
Implementors§
source§impl IntoIterator for IndexVec
impl IntoIterator for IndexVec
source§impl IntoIterator for CipherCtxFlags
impl IntoIterator for CipherCtxFlags
type Item = CipherCtxFlags
type IntoIter = Iter<CipherCtxFlags>
source§impl IntoIterator for CMSOptions
impl IntoIterator for CMSOptions
type Item = CMSOptions
type IntoIter = Iter<CMSOptions>
source§impl IntoIterator for Pkcs7Flags
impl IntoIterator for Pkcs7Flags
type Item = Pkcs7Flags
type IntoIter = Iter<Pkcs7Flags>
source§impl IntoIterator for ExtensionContext
impl IntoIterator for ExtensionContext
type Item = ExtensionContext
type IntoIter = Iter<ExtensionContext>
source§impl IntoIterator for ShutdownState
impl IntoIterator for ShutdownState
type Item = ShutdownState
type IntoIter = Iter<ShutdownState>
source§impl IntoIterator for SslOptions
impl IntoIterator for SslOptions
type Item = SslOptions
type IntoIter = Iter<SslOptions>
source§impl IntoIterator for SslSessionCacheMode
impl IntoIterator for SslSessionCacheMode
type Item = SslSessionCacheMode
type IntoIter = Iter<SslSessionCacheMode>
source§impl IntoIterator for SslVerifyMode
impl IntoIterator for SslVerifyMode
type Item = SslVerifyMode
type IntoIter = Iter<SslVerifyMode>
source§impl IntoIterator for X509CheckFlags
impl IntoIterator for X509CheckFlags
type Item = X509CheckFlags
type IntoIter = Iter<X509CheckFlags>
source§impl IntoIterator for X509VerifyFlags
impl IntoIterator for X509VerifyFlags
type Item = X509VerifyFlags
type IntoIter = Iter<X509VerifyFlags>
source§impl IntoIterator for ByteBuf
impl IntoIterator for ByteBuf
§impl IntoIterator for ArrayOfTables
impl IntoIterator for ArrayOfTables
§impl IntoIterator for FallocateFlags
impl IntoIterator for FallocateFlags
§impl IntoIterator for FloatingPointEmulationControl
impl IntoIterator for FloatingPointEmulationControl
§impl IntoIterator for FloatingPointExceptionMode
impl IntoIterator for FloatingPointExceptionMode
§impl IntoIterator for InlineTable
impl IntoIterator for InlineTable
§impl IntoIterator for MembarrierQuery
impl IntoIterator for MembarrierQuery
§impl IntoIterator for MountPropagationFlags
impl IntoIterator for MountPropagationFlags
§impl IntoIterator for PidfdGetfdFlags
impl IntoIterator for PidfdGetfdFlags
§impl IntoIterator for ReadWriteFlags
impl IntoIterator for ReadWriteFlags
§impl IntoIterator for SockaddrXdpFlags
impl IntoIterator for SockaddrXdpFlags
§impl IntoIterator for SpeculationFeatureControl
impl IntoIterator for SpeculationFeatureControl
§impl IntoIterator for SpeculationFeatureState
impl IntoIterator for SpeculationFeatureState
§impl IntoIterator for StatVfsMountFlags
impl IntoIterator for StatVfsMountFlags
§impl IntoIterator for Table
impl IntoIterator for Table
§impl IntoIterator for TimerfdTimerFlags
impl IntoIterator for TimerfdTimerFlags
§impl IntoIterator for UnalignedAccessControl
impl IntoIterator for UnalignedAccessControl
§impl IntoIterator for XdpDescOptions
impl IntoIterator for XdpDescOptions
§impl IntoIterator for XdpOptionsFlags
impl IntoIterator for XdpOptionsFlags
§impl IntoIterator for XdpUmemRegFlags
impl IntoIterator for XdpUmemRegFlags
1.6.0 · source§impl<'a> IntoIterator for &'a tor_hsservice::internal_prelude::Path
impl<'a> IntoIterator for &'a tor_hsservice::internal_prelude::Path
1.6.0 · source§impl<'a> IntoIterator for &'a tor_hsservice::internal_prelude::PathBuf
impl<'a> IntoIterator for &'a tor_hsservice::internal_prelude::PathBuf
1.10.0 · source§impl<'a> IntoIterator for &'a UnixListener
impl<'a> IntoIterator for &'a UnixListener
source§impl<'a> IntoIterator for &'a ByteBuf
impl<'a> IntoIterator for &'a ByteBuf
source§impl<'a> IntoIterator for &'a serde_bytes::bytes::Bytes
impl<'a> IntoIterator for &'a serde_bytes::bytes::Bytes
§impl<'a> IntoIterator for &'a AsciiStr
impl<'a> IntoIterator for &'a AsciiStr
Produces references for compatibility with [u8]
.
(str
doesn’t implement IntoIterator
for its references,
so there is no compatibility to lose.)
§impl<'a> IntoIterator for &'a BorrowedCertRevocationList<'a>
impl<'a> IntoIterator for &'a BorrowedCertRevocationList<'a>
§impl<'a> IntoIterator for &'a EventVec
Available on crate feature alloc
only.
impl<'a> IntoIterator for &'a EventVec
alloc
only.§impl<'a> IntoIterator for &'a Map<String, Value>
impl<'a> IntoIterator for &'a Map<String, Value>
§impl<'a> IntoIterator for &'a Utf8Sequence
impl<'a> IntoIterator for &'a Utf8Sequence
source§impl<'a> IntoIterator for &'a mut ByteBuf
impl<'a> IntoIterator for &'a mut ByteBuf
source§impl<'a> IntoIterator for &'a mut serde_bytes::bytes::Bytes
impl<'a> IntoIterator for &'a mut serde_bytes::bytes::Bytes
§impl<'a> IntoIterator for &'a mut AsciiStr
impl<'a> IntoIterator for &'a mut AsciiStr
§impl<'a> IntoIterator for &'a mut Map<String, Value>
impl<'a> IntoIterator for &'a mut Map<String, Value>
§impl<'a, 'b, T> IntoIterator for &'b GetAll<'a, T>where
'b: 'a,
impl<'a, 'b, T> IntoIterator for &'b GetAll<'a, T>where
'b: 'a,
§impl<'a, 'b, T> IntoIterator for &'b OccupiedEntry<'a, T>where
'b: 'a,
impl<'a, 'b, T> IntoIterator for &'b OccupiedEntry<'a, T>where
'b: 'a,
§impl<'a, 'b, T> IntoIterator for &'b mut OccupiedEntry<'a, T>where
'b: 'a,
impl<'a, 'b, T> IntoIterator for &'b mut OccupiedEntry<'a, T>where
'b: 'a,
§impl<'a, A> IntoIterator for &'a ArrayVec<A>where
A: Array,
impl<'a, A> IntoIterator for &'a ArrayVec<A>where
A: Array,
§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 TinyVec<A>where
A: Array,
impl<'a, A> IntoIterator for &'a TinyVec<A>where
A: Array,
§impl<'a, A> IntoIterator for &'a mut ArrayVec<A>where
A: Array,
impl<'a, A> IntoIterator for &'a mut ArrayVec<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, A> IntoIterator for &'a mut TinyVec<A>where
A: Array,
impl<'a, A> IntoIterator for &'a mut TinyVec<A>where
A: Array,
§impl<'a, A, O> IntoIterator for &'a BitArray<A, O>where
O: BitOrder,
A: 'a + BitViewSized,
Available on non-tarpaulin_include
only.
impl<'a, A, O> IntoIterator for &'a BitArray<A, O>where
O: BitOrder,
A: 'a + BitViewSized,
tarpaulin_include
only.type IntoIter = <&'a BitSlice<<A as BitView>::Store, O> as IntoIterator>::IntoIter
type Item = <&'a BitSlice<<A as BitView>::Store, O> as IntoIterator>::Item
§impl<'a, A, O> IntoIterator for &'a mut BitArray<A, O>where
O: BitOrder,
A: 'a + BitViewSized,
Available on non-tarpaulin_include
only.
impl<'a, A, O> IntoIterator for &'a mut BitArray<A, O>where
O: BitOrder,
A: 'a + BitViewSized,
tarpaulin_include
only.type IntoIter = <&'a mut BitSlice<<A as BitView>::Store, O> as IntoIterator>::IntoIter
type Item = <&'a mut BitSlice<<A as BitView>::Store, O> as IntoIterator>::Item
§impl<'a, Fut> IntoIterator for &'a FuturesUnordered<Fut>where
Fut: Unpin,
impl<'a, Fut> IntoIterator for &'a FuturesUnordered<Fut>where
Fut: Unpin,
§impl<'a, Fut> IntoIterator for &'a mut FuturesUnordered<Fut>where
Fut: Unpin,
impl<'a, Fut> IntoIterator for &'a mut FuturesUnordered<Fut>where
Fut: Unpin,
type Item = &'a mut Fut
type IntoIter = IterMut<'a, Fut>
§impl<'a, I> IntoIterator for &'a IntoChunks<I>
impl<'a, I> IntoIterator for &'a IntoChunks<I>
§impl<'a, I> IntoIterator for &'a RcIter<I>where
I: Iterator,
impl<'a, I> IntoIterator for &'a RcIter<I>where
I: Iterator,
Return an iterator from &RcIter<I>
(by simply cloning it).
§impl<'a, K, I, F> IntoIterator for &'a GroupBy<K, I, F>
impl<'a, K, I, F> IntoIterator for &'a GroupBy<K, I, F>
source§impl<'a, K, V> IntoIterator for &'a phf::map::Map<K, V>
impl<'a, K, V> IntoIterator for &'a phf::map::Map<K, V>
source§impl<'a, K, V> IntoIterator for &'a OrderedMap<K, V>
impl<'a, K, V> IntoIterator for &'a OrderedMap<K, V>
§impl<'a, K, V> IntoIterator for &'a Slice<K, V>
impl<'a, K, V> IntoIterator for &'a Slice<K, V>
§impl<'a, K, V> IntoIterator for &'a mut Slice<K, V>
impl<'a, K, V> IntoIterator for &'a mut Slice<K, V>
§impl<'a, K, V> IntoIterator for &'a mut TiSlice<K, V>
impl<'a, K, V> IntoIterator for &'a mut TiSlice<K, V>
§impl<'a, K, V> IntoIterator for &'a mut TiVec<K, V>
impl<'a, K, V> IntoIterator for &'a mut TiVec<K, V>
1.0.0 · source§impl<'a, K, V, A> IntoIterator for &'a BTreeMap<K, V, A>
impl<'a, K, V, A> IntoIterator for &'a BTreeMap<K, V, A>
1.0.0 · source§impl<'a, K, V, A> IntoIterator for &'a mut BTreeMap<K, V, A>
impl<'a, K, V, A> IntoIterator for &'a mut BTreeMap<K, V, A>
1.0.0 · source§impl<'a, K, V, S> IntoIterator for &'a tor_hsservice::internal_prelude::HashMap<K, V, S>
impl<'a, K, V, S> IntoIterator for &'a tor_hsservice::internal_prelude::HashMap<K, V, S>
source§impl<'a, K, V, S> IntoIterator for &'a PtrWeakKeyHashMap<K, V, S>where
K: WeakElement,
impl<'a, K, V, S> IntoIterator for &'a PtrWeakKeyHashMap<K, V, S>where
K: WeakElement,
source§impl<'a, K, V, S> IntoIterator for &'a PtrWeakWeakHashMap<K, V, S>where
K: WeakElement,
V: WeakElement,
impl<'a, K, V, S> IntoIterator for &'a PtrWeakWeakHashMap<K, V, S>where
K: WeakElement,
V: WeakElement,
type Item = (<K as WeakElement>::Strong, <V as WeakElement>::Strong)
type IntoIter = Iter<'a, ByPtr<K>, V>
source§impl<'a, K, V, S> IntoIterator for &'a WeakKeyHashMap<K, V, S>where
K: WeakElement,
impl<'a, K, V, S> IntoIterator for &'a WeakKeyHashMap<K, V, S>where
K: WeakElement,
source§impl<'a, K, V, S> IntoIterator for &'a WeakValueHashMap<K, V, S>where
V: WeakElement,
impl<'a, K, V, S> IntoIterator for &'a WeakValueHashMap<K, V, S>where
V: WeakElement,
source§impl<'a, K, V, S> IntoIterator for &'a WeakWeakHashMap<K, V, S>where
K: WeakElement,
V: WeakElement,
impl<'a, K, V, S> IntoIterator for &'a WeakWeakHashMap<K, V, S>where
K: WeakElement,
V: WeakElement,
type Item = (<K as WeakElement>::Strong, <V as WeakElement>::Strong)
type IntoIter = Iter<'a, K, V>
§impl<'a, K, V, S> IntoIterator for &'a IndexMap<K, V, S>
impl<'a, K, V, S> IntoIterator for &'a IndexMap<K, V, S>
1.0.0 · source§impl<'a, K, V, S> IntoIterator for &'a mut tor_hsservice::internal_prelude::HashMap<K, V, S>
impl<'a, K, V, S> IntoIterator for &'a mut tor_hsservice::internal_prelude::HashMap<K, V, S>
source§impl<'a, K, V, S> IntoIterator for &'a mut PtrWeakKeyHashMap<K, V, S>where
K: WeakElement,
impl<'a, K, V, S> IntoIterator for &'a mut PtrWeakKeyHashMap<K, V, S>where
K: WeakElement,
source§impl<'a, K, V, S> IntoIterator for &'a mut WeakKeyHashMap<K, V, S>where
K: WeakElement,
impl<'a, K, V, S> IntoIterator for &'a mut WeakKeyHashMap<K, V, S>where
K: WeakElement,
§impl<'a, K, V, S> IntoIterator for &'a mut IndexMap<K, V, S>
impl<'a, K, V, S> IntoIterator for &'a mut IndexMap<K, V, S>
§impl<'a, K, V, S, A> IntoIterator for &'a HashMap<K, V, S, A>where
A: Allocator,
impl<'a, K, V, S, A> IntoIterator for &'a HashMap<K, V, S, A>where
A: Allocator,
§impl<'a, K, V, S, A> IntoIterator for &'a mut HashMap<K, V, S, A>where
A: Allocator,
impl<'a, K, V, S, A> IntoIterator for &'a mut HashMap<K, V, S, A>where
A: Allocator,
§impl<'a, St> IntoIterator for &'a SelectAll<St>
impl<'a, St> IntoIterator for &'a SelectAll<St>
§impl<'a, St> IntoIterator for &'a mut SelectAll<St>
impl<'a, St> IntoIterator for &'a mut SelectAll<St>
type Item = &'a mut St
type IntoIter = IterMut<'a, St>
1.4.0 · source§impl<'a, T> IntoIterator for &'a Option<T>
impl<'a, T> IntoIterator for &'a Option<T>
1.1.0 · source§impl<'a, T> IntoIterator for &'a Receiver<T>
impl<'a, T> IntoIterator for &'a Receiver<T>
source§impl<'a, T> IntoIterator for &'a Stack<T>where
T: Stackable,
impl<'a, T> IntoIterator for &'a Stack<T>where
T: Stackable,
source§impl<'a, T> IntoIterator for &'a StackRef<T>where
T: Stackable,
impl<'a, T> IntoIterator for &'a StackRef<T>where
T: Stackable,
source§impl<'a, T> IntoIterator for &'a OrderedSet<T>
impl<'a, T> IntoIterator for &'a OrderedSet<T>
§impl<'a, T> IntoIterator for &'a HeaderMap<T>
impl<'a, T> IntoIterator for &'a HeaderMap<T>
1.4.0 · source§impl<'a, T> IntoIterator for &'a mut Option<T>
impl<'a, T> IntoIterator for &'a mut Option<T>
1.0.0 · source§impl<'a, T> IntoIterator for &'a mut [T]
impl<'a, T> IntoIterator for &'a mut [T]
source§impl<'a, T> IntoIterator for &'a mut Stack<T>where
T: Stackable,
impl<'a, T> IntoIterator for &'a mut Stack<T>where
T: Stackable,
source§impl<'a, T> IntoIterator for &'a mut StackRef<T>where
T: Stackable,
impl<'a, T> IntoIterator for &'a mut StackRef<T>where
T: Stackable,
§impl<'a, T> IntoIterator for &'a mut BoundedVecDeque<T>
impl<'a, T> IntoIterator for &'a mut BoundedVecDeque<T>
§impl<'a, T> IntoIterator for &'a mut HeaderMap<T>
impl<'a, T> IntoIterator for &'a mut HeaderMap<T>
§impl<'a, T> IntoIterator for &'a mut Slab<T>
impl<'a, T> IntoIterator for &'a mut Slab<T>
§impl<'a, T> IntoIterator for OccupiedEntry<'a, T>
impl<'a, T> IntoIterator for OccupiedEntry<'a, T>
1.0.0 · source§impl<'a, T, A> IntoIterator for &'a BinaryHeap<T, A>where
A: Allocator,
impl<'a, T, A> IntoIterator for &'a BinaryHeap<T, A>where
A: Allocator,
1.0.0 · source§impl<'a, T, A> IntoIterator for &'a VecDeque<T, A>where
A: Allocator,
impl<'a, T, A> IntoIterator for &'a VecDeque<T, A>where
A: Allocator,
1.0.0 · source§impl<'a, T, A> IntoIterator for &'a BTreeSet<T, A>
impl<'a, T, A> IntoIterator for &'a BTreeSet<T, A>
1.0.0 · source§impl<'a, T, A> IntoIterator for &'a LinkedList<T, A>where
A: Allocator,
impl<'a, T, A> IntoIterator for &'a LinkedList<T, A>where
A: Allocator,
1.0.0 · source§impl<'a, T, A> IntoIterator for &'a alloc::vec::Vec<T, A>where
A: Allocator,
impl<'a, T, A> IntoIterator for &'a alloc::vec::Vec<T, A>where
A: Allocator,
§impl<'a, T, A> IntoIterator for &'a HashTable<T, A>where
A: Allocator,
impl<'a, T, A> IntoIterator for &'a HashTable<T, A>where
A: Allocator,
§impl<'a, T, A> IntoIterator for &'a Vec<T, A>where
A: Allocator,
impl<'a, T, A> IntoIterator for &'a Vec<T, A>where
A: Allocator,
1.0.0 · source§impl<'a, T, A> IntoIterator for &'a mut VecDeque<T, A>where
A: Allocator,
impl<'a, T, A> IntoIterator for &'a mut VecDeque<T, A>where
A: Allocator,
1.0.0 · source§impl<'a, T, A> IntoIterator for &'a mut LinkedList<T, A>where
A: Allocator,
impl<'a, T, A> IntoIterator for &'a mut LinkedList<T, A>where
A: Allocator,
1.0.0 · source§impl<'a, T, A> IntoIterator for &'a mut alloc::vec::Vec<T, A>where
A: Allocator,
impl<'a, T, A> IntoIterator for &'a mut alloc::vec::Vec<T, A>where
A: Allocator,
§impl<'a, T, A> IntoIterator for &'a mut HashTable<T, A>where
A: Allocator,
impl<'a, T, A> IntoIterator for &'a mut HashTable<T, A>where
A: Allocator,
§impl<'a, T, A> IntoIterator for &'a mut Vec<T, A>where
A: Allocator,
impl<'a, T, A> IntoIterator for &'a mut Vec<T, A>where
A: Allocator,
1.4.0 · source§impl<'a, T, E> IntoIterator for &'a Result<T, E>
impl<'a, T, E> IntoIterator for &'a Result<T, E>
1.4.0 · source§impl<'a, T, E> IntoIterator for &'a mut Result<T, E>
impl<'a, T, E> IntoIterator for &'a mut Result<T, E>
§impl<'a, T, N> IntoIterator for &'a GenericArray<T, N>where
T: 'a,
N: ArrayLength<T>,
impl<'a, T, N> IntoIterator for &'a GenericArray<T, N>where
T: 'a,
N: ArrayLength<T>,
§impl<'a, T, N> IntoIterator for &'a mut GenericArray<T, N>where
T: 'a,
N: ArrayLength<T>,
impl<'a, T, N> IntoIterator for &'a mut GenericArray<T, N>where
T: 'a,
N: ArrayLength<T>,
§impl<'a, T, O> IntoIterator for &'a BitSlice<T, O>where
T: 'a + BitStore,
O: BitOrder,
Available on non-tarpaulin_include
only.
impl<'a, T, O> IntoIterator for &'a BitSlice<T, O>where
T: 'a + BitStore,
O: BitOrder,
tarpaulin_include
only.§impl<'a, T, O> IntoIterator for &'a BitVec<T, O>where
O: BitOrder,
T: 'a + BitStore,
Available on non-tarpaulin_include
only.
impl<'a, T, O> IntoIterator for &'a BitVec<T, O>where
O: BitOrder,
T: 'a + BitStore,
tarpaulin_include
only.type IntoIter = <&'a BitSlice<T, O> as IntoIterator>::IntoIter
type Item = <&'a BitSlice<T, O> as IntoIterator>::Item
§impl<'a, T, O> IntoIterator for &'a mut BitSlice<T, O>where
T: 'a + BitStore,
O: BitOrder,
Available on non-tarpaulin_include
only.
impl<'a, T, O> IntoIterator for &'a mut BitSlice<T, O>where
T: 'a + BitStore,
O: BitOrder,
tarpaulin_include
only.§impl<'a, T, O> IntoIterator for &'a mut BitVec<T, O>where
O: BitOrder,
T: 'a + BitStore,
Available on non-tarpaulin_include
only.
impl<'a, T, O> IntoIterator for &'a mut BitVec<T, O>where
O: BitOrder,
T: 'a + BitStore,
tarpaulin_include
only.type IntoIter = <&'a mut BitSlice<T, O> as IntoIterator>::IntoIter
type Item = <&'a mut BitSlice<T, O> as IntoIterator>::Item
1.0.0 · source§impl<'a, T, S> IntoIterator for &'a tor_hsservice::internal_prelude::HashSet<T, S>
impl<'a, T, S> IntoIterator for &'a tor_hsservice::internal_prelude::HashSet<T, S>
source§impl<'a, T, S> IntoIterator for &'a PtrWeakHashSet<T, S>
impl<'a, T, S> IntoIterator for &'a PtrWeakHashSet<T, S>
source§impl<'a, T, S> IntoIterator for &'a WeakHashSet<T, S>where
T: WeakKey,
impl<'a, T, S> IntoIterator for &'a WeakHashSet<T, S>where
T: WeakKey,
§impl<'a, T, S, A> IntoIterator for &'a HashSet<T, S, A>where
A: Allocator,
impl<'a, T, S, A> IntoIterator for &'a HashSet<T, S, A>where
A: Allocator,
source§impl<'a, T, const CAP: usize> IntoIterator for &'a arrayvec::arrayvec::ArrayVec<T, CAP>where
T: 'a,
impl<'a, T, const CAP: usize> IntoIterator for &'a arrayvec::arrayvec::ArrayVec<T, CAP>where
T: 'a,
Iterate the ArrayVec
with references to each element.
use arrayvec::ArrayVec;
let array = ArrayVec::from([1, 2, 3]);
for elt in &array {
// ...
}
source§impl<'a, T, const CAP: usize> IntoIterator for &'a mut arrayvec::arrayvec::ArrayVec<T, CAP>where
T: 'a,
impl<'a, T, const CAP: usize> IntoIterator for &'a mut arrayvec::arrayvec::ArrayVec<T, CAP>where
T: 'a,
Iterate the ArrayVec
with mutable references to each element.
use arrayvec::ArrayVec;
let mut array = ArrayVec::from([1, 2, 3]);
for elt in &mut array {
// ...
}
1.0.0 · source§impl<'a, T, const N: usize> IntoIterator for &'a [T; N]
impl<'a, T, const N: usize> IntoIterator for &'a [T; N]
1.0.0 · source§impl<'a, T, const N: usize> IntoIterator for &'a mut [T; N]
impl<'a, T, const N: usize> IntoIterator for &'a mut [T; N]
source§impl<'a, const N: usize> IntoIterator for &'a ByteArray<N>
impl<'a, const N: usize> IntoIterator for &'a ByteArray<N>
source§impl<'a, const N: usize> IntoIterator for &'a mut ByteArray<N>
impl<'a, const N: usize> IntoIterator for &'a mut ByteArray<N>
source§impl<'inp, 'out, T> IntoIterator for InOutBuf<'inp, 'out, T>
impl<'inp, 'out, T> IntoIterator for InOutBuf<'inp, 'out, T>
§impl<'s> IntoIterator for &'s Array
impl<'s> IntoIterator for &'s Array
§impl<'s> IntoIterator for &'s ArrayOfTables
impl<'s> IntoIterator for &'s ArrayOfTables
§impl<'s> IntoIterator for &'s InlineTable
impl<'s> IntoIterator for &'s InlineTable
§impl<'s> IntoIterator for &'s Table
impl<'s> IntoIterator for &'s Table
§impl<A> IntoIterator for ArrayVec<A>where
A: Array,
impl<A> IntoIterator for ArrayVec<A>where
A: Array,
§impl<A> IntoIterator for SmallVec<A>where
A: Array,
impl<A> IntoIterator for SmallVec<A>where
A: Array,
§impl<A> IntoIterator for TinyVec<A>where
A: Array,
impl<A> IntoIterator for TinyVec<A>where
A: Array,
§impl<A, O> IntoIterator for BitArray<A, O>where
A: BitViewSized,
O: BitOrder,
impl<A, O> IntoIterator for BitArray<A, O>where
A: BitViewSized,
O: BitOrder,
§impl<E> IntoIterator for RetryError<E>
impl<E> IntoIterator for RetryError<E>
§impl<Fut> IntoIterator for FuturesUnordered<Fut>where
Fut: Unpin,
impl<Fut> IntoIterator for FuturesUnordered<Fut>where
Fut: Unpin,
1.0.0 (const: unstable) · source§impl<I> IntoIterator for Iwhere
I: Iterator,
impl<I> IntoIterator for Iwhere
I: Iterator,
§impl<K, V> IntoIterator for RangeInclusiveMap<K, V>
impl<K, V> IntoIterator for RangeInclusiveMap<K, V>
type Item = (RangeInclusive<K>, V)
type IntoIter = IntoIter<K, V>
§impl<K, V> IntoIterator for RangeMap<K, V>
impl<K, V> IntoIterator for RangeMap<K, V>
1.0.0 · source§impl<K, V, A> IntoIterator for BTreeMap<K, V, A>
impl<K, V, A> IntoIterator for BTreeMap<K, V, A>
1.0.0 · source§impl<K, V, S> IntoIterator for tor_hsservice::internal_prelude::HashMap<K, V, S>
impl<K, V, S> IntoIterator for tor_hsservice::internal_prelude::HashMap<K, V, S>
source§impl<K, V, S> IntoIterator for PtrWeakKeyHashMap<K, V, S>where
K: WeakElement,
impl<K, V, S> IntoIterator for PtrWeakKeyHashMap<K, V, S>where
K: WeakElement,
source§impl<K, V, S> IntoIterator for PtrWeakWeakHashMap<K, V, S>where
K: WeakElement,
V: WeakElement,
impl<K, V, S> IntoIterator for PtrWeakWeakHashMap<K, V, S>where
K: WeakElement,
V: WeakElement,
type Item = (<K as WeakElement>::Strong, <V as WeakElement>::Strong)
type IntoIter = IntoIter<ByPtr<K>, V>
source§impl<K, V, S> IntoIterator for WeakKeyHashMap<K, V, S>where
K: WeakElement,
impl<K, V, S> IntoIterator for WeakKeyHashMap<K, V, S>where
K: WeakElement,
source§impl<K, V, S> IntoIterator for WeakValueHashMap<K, V, S>where
V: WeakElement,
impl<K, V, S> IntoIterator for WeakValueHashMap<K, V, S>where
V: WeakElement,
source§impl<K, V, S> IntoIterator for WeakWeakHashMap<K, V, S>where
K: WeakElement,
V: WeakElement,
impl<K, V, S> IntoIterator for WeakWeakHashMap<K, V, S>where
K: WeakElement,
V: WeakElement,
type Item = (<K as WeakElement>::Strong, <V as WeakElement>::Strong)
type IntoIter = IntoIter<K, V>
§impl<K, V, S, A> IntoIterator for HashMap<K, V, S, A>where
A: Allocator,
impl<K, V, S, A> IntoIterator for HashMap<K, V, S, A>where
A: Allocator,
§impl<St> IntoIterator for SelectAll<St>
impl<St> IntoIterator for SelectAll<St>
source§impl<T> IntoIterator for Stack<T>where
T: Stackable,
impl<T> IntoIterator for Stack<T>where
T: Stackable,
§impl<T> IntoIterator for HeaderMap<T>
impl<T> IntoIterator for HeaderMap<T>
§impl<T> IntoIterator for RangeInclusiveSet<T>
impl<T> IntoIterator for RangeInclusiveSet<T>
type Item = RangeInclusive<T>
type IntoIter = IntoIter<T>
1.0.0 · source§impl<T, A> IntoIterator for BinaryHeap<T, A>where
A: Allocator,
impl<T, A> IntoIterator for BinaryHeap<T, A>where
A: Allocator,
1.0.0 · source§impl<T, A> IntoIterator for VecDeque<T, A>where
A: Allocator,
impl<T, A> IntoIterator for VecDeque<T, A>where
A: Allocator,
1.0.0 · source§impl<T, A> IntoIterator for BTreeSet<T, A>
impl<T, A> IntoIterator for BTreeSet<T, A>
1.0.0 · source§impl<T, A> IntoIterator for LinkedList<T, A>where
A: Allocator,
impl<T, A> IntoIterator for LinkedList<T, A>where
A: Allocator,
1.0.0 · source§impl<T, A> IntoIterator for alloc::vec::Vec<T, A>where
A: Allocator,
impl<T, A> IntoIterator for alloc::vec::Vec<T, A>where
A: Allocator,
§impl<T, A> IntoIterator for HashTable<T, A>where
A: Allocator,
impl<T, A> IntoIterator for HashTable<T, A>where
A: Allocator,
§impl<T, A> IntoIterator for RawTable<T, A>where
A: Allocator,
impl<T, A> IntoIterator for RawTable<T, A>where
A: Allocator,
§impl<T, A> IntoIterator for Vec<T, A>where
A: Allocator,
impl<T, A> IntoIterator for Vec<T, A>where
A: Allocator,
§impl<T, N> IntoIterator for GenericArray<T, N>where
N: ArrayLength<T>,
impl<T, N> IntoIterator for GenericArray<T, N>where
N: ArrayLength<T>,
§impl<T, O> IntoIterator for BitBox<T, O>where
T: BitStore,
O: BitOrder,
impl<T, O> IntoIterator for BitBox<T, O>where
T: BitStore,
O: BitOrder,
§impl<T, O> IntoIterator for BitVec<T, O>where
T: BitStore,
O: BitOrder,
impl<T, O> IntoIterator for BitVec<T, O>where
T: BitStore,
O: BitOrder,
§Bit-Vector Iteration
Bit-vectors have the advantage that iteration consumes the whole structure, so they can simply freeze the allocation into a bit-box, then use its iteration and destructor.
§Original
type IntoIter = <BitBox<T, O> as IntoIterator>::IntoIter
type Item = <BitBox<T, O> as IntoIterator>::Item
1.0.0 · source§impl<T, S> IntoIterator for tor_hsservice::internal_prelude::HashSet<T, S>
impl<T, S> IntoIterator for tor_hsservice::internal_prelude::HashSet<T, S>
source§impl<T, S> IntoIterator for PtrWeakHashSet<T, S>where
T: WeakElement,
impl<T, S> IntoIterator for PtrWeakHashSet<T, S>where
T: WeakElement,
source§impl<T, S> IntoIterator for WeakHashSet<T, S>where
T: WeakKey,
impl<T, S> IntoIterator for WeakHashSet<T, S>where
T: WeakKey,
§impl<T, S, A> IntoIterator for HashSet<T, S, A>where
A: Allocator,
impl<T, S, A> IntoIterator for HashSet<T, S, A>where
A: Allocator,
§impl<T, U> IntoIterator for Chain<T, U>where
T: Buf,
U: Buf,
impl<T, U> IntoIterator for Chain<T, U>where
T: Buf,
U: Buf,
source§impl<T, const CAP: usize> IntoIterator for arrayvec::arrayvec::ArrayVec<T, CAP>
impl<T, const CAP: usize> IntoIterator for arrayvec::arrayvec::ArrayVec<T, CAP>
Iterate the ArrayVec
with each element by value.
The vector is consumed by this operation.
use arrayvec::ArrayVec;
for elt in ArrayVec::from([1, 2, 3]) {
// ...
}