pub fn values_mut(&mut self) -> ValuesMut<'_, K, V> {
        ValuesMut {
            iter: self.iter_mut(),
        }
    }
/// Returns a mutable iterator over the elements of the map, sorted by key.
///
/// # Examples
///
/// ```
/// use bptree::BpTreeMap;
///
/// let mut map = BpTreeMap::from([(3, "Three"), (1, "One"), (4, "Four"), (2, "Two")]);
///
/// let first_value = map.values_mut().next().unwrap();
/// assert_eq!(first_value, &mut "One");
/// *first_value = "Another";
/// drop(first_value);
///
/// for value in map.values_mut() {
///     println!("{}", value);
/// }
/// ```
Returns a mutable iterator over the elements of the map, sorted by key.
Returns a mutable iterator over the elements of the map sorted by key .
pub fn values_mut(&mut self) -> ValuesMut<'_, K, V> {
        ValuesMut {
            iter: self.iter_mut(),
        }
    }
pub fn values_mut ( & mut self ) -> ValuesMut < ' _ , K , V > { ValuesMut { iter : self . iter_mut ( ) , } }
Returns a mutable iterator over the elements of the map, sorted by key.
Returns a mutable iterator over the elements of the map sorted by key .
&mut self
&mut self
examples
```
use bptree::BpTreeMap.



let first_value = map.values_mut().next().unwrap();
assert_eq!(first_value, &mut "One");
first_value = "Another";
drop(first_value).

for value in map.values_mut() {
println!("{}", value);
}
```
` ` ` use bptree :: BpTreeMap . let first_value = map . values_mut () . next () . unwrap () ; assert_eq! ( first_value &mut " One " ) ; first_value = " Another " ; drop ( first_value ) . for value in map . values_mut () { println! ( " {} " value ) ; } ` ` `