Struct IterMut
struct IterMut<'a, K: Ord + Sync, V: Send> { ... }
Parallel iterator over a mutable reference to a B-Tree map
Implementations
impl<'a, K, V> Freeze for IterMut<'a, K, V>
impl<'a, K, V> RefUnwindSafe for IterMut<'a, K, V>
impl<'a, K, V> Send for IterMut<'a, K, V>
impl<'a, K, V> Sync for IterMut<'a, K, V>
impl<'a, K, V> Unpin for IterMut<'a, K, V>
impl<'a, K, V> UnwindSafe for IterMut<'a, K, V>
impl<'a, K: $crate::fmt::Debug + Ord + Sync, V: $crate::fmt::Debug + Send> Debug for IterMut<'a, K, V>
fn fmt(self: &Self, f: &mut $crate::fmt::Formatter<'_>) -> $crate::fmt::Result
impl<'a, K: Ord + Sync + 'a, V: Send + 'a> ParallelIterator for IterMut<'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<T> Any for IterMut<'a, K, V>
fn type_id(self: &Self) -> TypeId
impl<T> Borrow for IterMut<'a, K, V>
fn borrow(self: &Self) -> &T
impl<T> BorrowMut for IterMut<'a, K, V>
fn borrow_mut(self: &mut Self) -> &mut T
impl<T> From for IterMut<'a, K, V>
fn from(t: T) -> TReturns the argument unchanged.
impl<T> IntoParallelIterator for IterMut<'a, K, V>
fn into_par_iter(self: Self) -> T
impl<T> Pointable for IterMut<'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, U> Into for IterMut<'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 IterMut<'a, K, V>
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
impl<T, U> TryInto for IterMut<'a, K, V>
fn try_into(self: Self) -> Result<U, <U as TryFrom<T>>::Error>