Struct Iter
struct Iter<'a, K: Ord + Sync, V: Sync> { ... }
Parallel iterator over an immutable reference to a B-Tree map
Implementations
impl<'a, K, V> Freeze for Iter<'a, K, V>
impl<'a, K, V> RefUnwindSafe for Iter<'a, K, V>
impl<'a, K, V> Send for Iter<'a, K, V>
impl<'a, K, V> Sync for Iter<'a, K, V>
impl<'a, K, V> Unpin for Iter<'a, K, V>
impl<'a, K, V> UnwindSafe for Iter<'a, K, V>
impl<'a, K: $crate::fmt::Debug + Ord + Sync, V: $crate::fmt::Debug + Sync> Debug for Iter<'a, K, V>
fn fmt(self: &Self, f: &mut $crate::fmt::Formatter<'_>) -> $crate::fmt::Result
impl<'a, K: Ord + Sync + 'a, V: Sync + 'a> ParallelIterator for Iter<'a, K, V>
fn drive_unindexed<C>(self: Self, consumer: C) -> <C as >::Result where C: UnindexedConsumer<<Self as >::Item>fn opt_len(self: &Self) -> Option<usize>
impl<'a, K: Ord + Sync, V: Sync> Clone for Iter<'a, K, V>
fn clone(self: &Self) -> Self
impl<T> Any for Iter<'a, K, V>
fn type_id(self: &Self) -> TypeId
impl<T> Borrow for Iter<'a, K, V>
fn borrow(self: &Self) -> &T
impl<T> BorrowMut for Iter<'a, K, V>
fn borrow_mut(self: &mut Self) -> &mut T
impl<T> CloneToUninit for Iter<'a, K, V>
unsafe fn clone_to_uninit(self: &Self, dest: *mut u8)
impl<T> From for Iter<'a, K, V>
fn from(t: T) -> TReturns the argument unchanged.
impl<T> IntoParallelIterator for Iter<'a, K, V>
fn into_par_iter(self: Self) -> T
impl<T> Pointable for Iter<'a, K, V>
unsafe fn init(init: <T as Pointable>::Init) -> usizeunsafe fn deref<'a>(ptr: usize) -> &'a Tunsafe fn deref_mut<'a>(ptr: usize) -> &'a mut Tunsafe fn drop(ptr: usize)
impl<T> ToOwned for Iter<'a, K, V>
fn to_owned(self: &Self) -> Tfn clone_into(self: &Self, target: &mut T)
impl<T, U> Into for Iter<'a, K, V>
fn into(self: Self) -> UCalls
U::from(self).That is, this conversion is whatever the implementation of
[From]<T> for Uchooses to do.
impl<T, U> TryFrom for Iter<'a, K, V>
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
impl<T, U> TryInto for Iter<'a, K, V>
fn try_into(self: Self) -> Result<U, <U as TryFrom<T>>::Error>