Struct IterMut

#[must_use = "iterators are lazy and do nothing unless consumed"]
pub struct IterMut<'a, K: 'a, V: 'a> { pub(in ::collections::btree::map) range: LazyLeafRange<ValMut<'a>, K, V>, pub(in ::collections::btree::map) length: usize, pub(in ::collections::btree::map) _marker: PhantomData<&'a mut (K, V)> }

A mutable iterator over the entries of a BTreeMap.

This struct is created by the iter_mut method on BTreeMap. See its documentation for more.

Fields

range: LazyLeafRange<ValMut<'a>, K, V>
length: usize
_marker: PhantomData<&'a mut (K, V)>

Implementations

impl<'a, K, V> IterMut<'a, K, V>

fn iter(&self) -> Iter<'_, K, V>

Returns an iterator of references over the remaining items.

Trait Implementations

impl<'a, K, V> DoubleEndedIterator for IterMut<'a, K, V>

fn next_back(&mut self) -> Option<(&'a K, &'a mut V)>

impl<'a, K, V> Iterator for IterMut<'a, K, V>

type Item = (&'a K, &'a mut V);
fn next(&mut self) -> Option<(&'a K, &'a mut V)>
fn size_hint(&self) -> (usize, Option<usize>)
fn last(self) -> Option<(&'a K, &'a mut V)>
fn min(self) -> Option<(&'a K, &'a mut V)>
where
    (&'a K, &'a mut V): Ord,
fn max(self) -> Option<(&'a K, &'a mut V)>
where
    (&'a K, &'a mut V): Ord,

impl<'a, K: 'a, V: 'a> Default for IterMut<'a, K, V>

fn default() -> Self

Creates an empty btree_map::IterMut.

# use std::collections::btree_map;
let iter: btree_map::IterMut<'_, u8, u8> = Default::default();
assert_eq!(iter.len(), 0);

impl<K, V> ExactSizeIterator for IterMut<'_, K, V>

fn len(&self) -> usize

impl<K, V> FusedIterator for IterMut<'_, K, V>

impl<K, V> TrustedLen for IterMut<'_, K, V>

impl<K: Debug, V: Debug> Debug for IterMut<'_, K, V>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Auto Trait Implementations

impl<'a, K, V> !UnwindSafe for IterMut<'a, K, V>

impl<'a, K, V> Freeze for IterMut<'a, K, V> where LazyLeafRange<ValMut<'a>, K, V>: Freeze, PhantomData<&'a mut (K, V)>: Freeze,

impl<'a, K, V> RefUnwindSafe for IterMut<'a, K, V> where LazyLeafRange<ValMut<'a>, K, V>: RefUnwindSafe, PhantomData<&'a mut (K, V)>: RefUnwindSafe,

impl<'a, K, V> Send for IterMut<'a, K, V> where LazyLeafRange<ValMut<'a>, K, V>: Send, PhantomData<&'a mut (K, V)>: Send,

impl<'a, K, V> Sync for IterMut<'a, K, V> where LazyLeafRange<ValMut<'a>, K, V>: Sync, PhantomData<&'a mut (K, V)>: Sync,

impl<'a, K, V> Unpin for IterMut<'a, K, V> where LazyLeafRange<ValMut<'a>, K, V>: Unpin, PhantomData<&'a mut (K, V)>: Unpin,

impl<'a, K, V> UnsafeUnpin for IterMut<'a, K, V> where LazyLeafRange<ValMut<'a>, K, V>: UnsafeUnpin, PhantomData<&'a mut (K, V)>: UnsafeUnpin,

Blanket Implementations

impl<I> IntoIterator for IterMut<'a, K, V> where I: Iterator,

type Item = <I as Iterator>::Item;
type IntoIter = I;
fn into_iter(self) -> I

impl<T> Any for IterMut<'a, K, V> where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for IterMut<'a, K, V> where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for IterMut<'a, K, V> where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for IterMut<'a, K, V>

fn from(t: T) -> T

Returns the argument unchanged.

impl<T> SizeHint for IterMut<'a, K, V> where T: ?Sized,

fn lower_bound(&self) -> usize
fn upper_bound(&self) -> Option<usize>

impl<T> SizedTypeProperties for IterMut<'a, K, V>

impl<T, U> Into<U> for IterMut<'a, K, V> where U: From<T>,

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of [From]<T> for U chooses to do.

impl<T, U> TryFrom<U> for IterMut<'a, K, V> where U: Into<T>,

type Error = Infallible;
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for IterMut<'a, K, V> where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error;
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>