Struct futures_signals::signal_map::MutableBTreeMapLockMut
source · [−]pub struct MutableBTreeMapLockMut<'a, K, V> where
K: 'a,
V: 'a, { /* private fields */ }
Implementations
sourceimpl<'a, K, V> MutableBTreeMapLockMut<'a, K, V> where
K: Ord,
impl<'a, K, V> MutableBTreeMapLockMut<'a, K, V> where
K: Ord,
sourceimpl<'a, K, V> MutableBTreeMapLockMut<'a, K, V> where
K: Ord + Clone,
impl<'a, K, V> MutableBTreeMapLockMut<'a, K, V> where
K: Ord + Clone,
sourceimpl<'a, K, V> MutableBTreeMapLockMut<'a, K, V> where
K: Ord + Clone,
V: Clone,
impl<'a, K, V> MutableBTreeMapLockMut<'a, K, V> where
K: Ord + Clone,
V: Clone,
pub fn replace_cloned(&mut self, values: BTreeMap<K, V>)
pub fn insert_cloned(&mut self, key: K, value: V) -> Option<V>
Methods from Deref<Target = BTreeMap<K, V>>
1.0.0 · sourcepub fn get<Q>(&self, key: &Q) -> Option<&V> where
K: Borrow<Q> + Ord,
Q: Ord + ?Sized,
pub fn get<Q>(&self, key: &Q) -> Option<&V> where
K: Borrow<Q> + Ord,
Q: Ord + ?Sized,
Returns a reference to the value corresponding to the key.
The key may be any borrowed form of the map’s key type, but the ordering on the borrowed form must match the ordering on the key type.
Examples
Basic usage:
use std::collections::BTreeMap;
let mut map = BTreeMap::new();
map.insert(1, "a");
assert_eq!(map.get(&1), Some(&"a"));
assert_eq!(map.get(&2), None);
1.40.0 · sourcepub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)> where
K: Borrow<Q> + Ord,
Q: Ord + ?Sized,
pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)> where
K: Borrow<Q> + Ord,
Q: Ord + ?Sized,
Returns the key-value pair corresponding to the supplied key.
The supplied key may be any borrowed form of the map’s key type, but the ordering on the borrowed form must match the ordering on the key type.
Examples
use std::collections::BTreeMap;
let mut map = BTreeMap::new();
map.insert(1, "a");
assert_eq!(map.get_key_value(&1), Some((&1, &"a")));
assert_eq!(map.get_key_value(&2), None);
sourcepub fn first_key_value(&self) -> Option<(&K, &V)> where
K: Ord,
🔬 This is a nightly-only experimental API. (map_first_last
)
pub fn first_key_value(&self) -> Option<(&K, &V)> where
K: Ord,
map_first_last
)Returns the first key-value pair in the map. The key in this pair is the minimum key in the map.
Examples
Basic usage:
#![feature(map_first_last)]
use std::collections::BTreeMap;
let mut map = BTreeMap::new();
assert_eq!(map.first_key_value(), None);
map.insert(1, "b");
map.insert(2, "a");
assert_eq!(map.first_key_value(), Some((&1, &"b")));
sourcepub fn last_key_value(&self) -> Option<(&K, &V)> where
K: Ord,
🔬 This is a nightly-only experimental API. (map_first_last
)
pub fn last_key_value(&self) -> Option<(&K, &V)> where
K: Ord,
map_first_last
)Returns the last key-value pair in the map. The key in this pair is the maximum key in the map.
Examples
Basic usage:
#![feature(map_first_last)]
use std::collections::BTreeMap;
let mut map = BTreeMap::new();
map.insert(1, "b");
map.insert(2, "a");
assert_eq!(map.last_key_value(), Some((&2, &"a")));
1.0.0 · sourcepub fn contains_key<Q>(&self, key: &Q) -> bool where
K: Borrow<Q> + Ord,
Q: Ord + ?Sized,
pub fn contains_key<Q>(&self, key: &Q) -> bool where
K: Borrow<Q> + Ord,
Q: Ord + ?Sized,
Returns true
if the map contains a value for the specified key.
The key may be any borrowed form of the map’s key type, but the ordering on the borrowed form must match the ordering on the key type.
Examples
Basic usage:
use std::collections::BTreeMap;
let mut map = BTreeMap::new();
map.insert(1, "a");
assert_eq!(map.contains_key(&1), true);
assert_eq!(map.contains_key(&2), false);
1.17.0 · sourcepub fn range<T, R>(&self, range: R) -> Range<'_, K, V> where
T: Ord + ?Sized,
K: Borrow<T> + Ord,
R: RangeBounds<T>,
pub fn range<T, R>(&self, range: R) -> Range<'_, K, V> where
T: Ord + ?Sized,
K: Borrow<T> + Ord,
R: RangeBounds<T>,
Constructs a double-ended iterator over a sub-range of elements in the map.
The simplest way is to use the range syntax min..max
, thus range(min..max)
will
yield elements from min (inclusive) to max (exclusive).
The range may also be entered as (Bound<T>, Bound<T>)
, so for example
range((Excluded(4), Included(10)))
will yield a left-exclusive, right-inclusive
range from 4 to 10.
Panics
Panics if range start > end
.
Panics if range start == end
and both bounds are Excluded
.
Examples
Basic usage:
use std::collections::BTreeMap;
use std::ops::Bound::Included;
let mut map = BTreeMap::new();
map.insert(3, "a");
map.insert(5, "b");
map.insert(8, "c");
for (&key, &value) in map.range((Included(&4), Included(&8))) {
println!("{key}: {value}");
}
assert_eq!(Some((&5, &"b")), map.range(4..).next());
1.0.0 · sourcepub fn iter(&self) -> Iter<'_, K, V>
pub fn iter(&self) -> Iter<'_, K, V>
Gets an iterator over the entries of the map, sorted by key.
Examples
Basic usage:
use std::collections::BTreeMap;
let mut map = BTreeMap::new();
map.insert(3, "c");
map.insert(2, "b");
map.insert(1, "a");
for (key, value) in map.iter() {
println!("{key}: {value}");
}
let (first_key, first_value) = map.iter().next().unwrap();
assert_eq!((*first_key, *first_value), (1, "a"));
1.0.0 · sourcepub fn keys(&self) -> Keys<'_, K, V>
pub fn keys(&self) -> Keys<'_, K, V>
Gets an iterator over the keys of the map, in sorted order.
Examples
Basic usage:
use std::collections::BTreeMap;
let mut a = BTreeMap::new();
a.insert(2, "b");
a.insert(1, "a");
let keys: Vec<_> = a.keys().cloned().collect();
assert_eq!(keys, [1, 2]);
1.0.0 · sourcepub fn values(&self) -> Values<'_, K, V>
pub fn values(&self) -> Values<'_, K, V>
Gets an iterator over the values of the map, in order by key.
Examples
Basic usage:
use std::collections::BTreeMap;
let mut a = BTreeMap::new();
a.insert(1, "hello");
a.insert(2, "goodbye");
let values: Vec<&str> = a.values().cloned().collect();
assert_eq!(values, ["hello", "goodbye"]);
Trait Implementations
sourceimpl<'a, K: Debug, V: Debug> Debug for MutableBTreeMapLockMut<'a, K, V> where
K: 'a,
V: 'a,
impl<'a, K: Debug, V: Debug> Debug for MutableBTreeMapLockMut<'a, K, V> where
K: 'a,
V: 'a,
sourceimpl<'a, K, V> Deref for MutableBTreeMapLockMut<'a, K, V>
impl<'a, K, V> Deref for MutableBTreeMapLockMut<'a, K, V>
sourceimpl<'a, K, V> Hash for MutableBTreeMapLockMut<'a, K, V> where
K: Hash,
V: Hash,
impl<'a, K, V> Hash for MutableBTreeMapLockMut<'a, K, V> where
K: Hash,
V: Hash,
sourceimpl<'a, 'b, K, V> Index<&'b K> for MutableBTreeMapLockMut<'a, K, V> where
K: Ord,
impl<'a, 'b, K, V> Index<&'b K> for MutableBTreeMapLockMut<'a, K, V> where
K: Ord,
sourceimpl<'a, K, V> Ord for MutableBTreeMapLockMut<'a, K, V> where
K: Ord,
V: Ord,
impl<'a, K, V> Ord for MutableBTreeMapLockMut<'a, K, V> where
K: Ord,
V: Ord,
sourceimpl<'a, K, V> PartialEq<BTreeMap<K, V>> for MutableBTreeMapLockMut<'a, K, V> where
K: PartialEq<K>,
V: PartialEq<V>,
impl<'a, K, V> PartialEq<BTreeMap<K, V>> for MutableBTreeMapLockMut<'a, K, V> where
K: PartialEq<K>,
V: PartialEq<V>,
sourceimpl<'a, K, V> PartialEq<MutableBTreeMapLockMut<'a, K, V>> for MutableBTreeMapLockMut<'a, K, V> where
K: PartialEq<K>,
V: PartialEq<V>,
impl<'a, K, V> PartialEq<MutableBTreeMapLockMut<'a, K, V>> for MutableBTreeMapLockMut<'a, K, V> where
K: PartialEq<K>,
V: PartialEq<V>,
sourcefn eq(&self, other: &MutableBTreeMapLockMut<'a, K, V>) -> bool
fn eq(&self, other: &MutableBTreeMapLockMut<'a, K, V>) -> bool
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
sourcefn ne(&self, other: &MutableBTreeMapLockMut<'a, K, V>) -> bool
fn ne(&self, other: &MutableBTreeMapLockMut<'a, K, V>) -> bool
This method tests for !=
.
sourceimpl<'a, K, V> PartialOrd<BTreeMap<K, V>> for MutableBTreeMapLockMut<'a, K, V> where
K: PartialOrd<K>,
V: PartialOrd<V>,
impl<'a, K, V> PartialOrd<BTreeMap<K, V>> for MutableBTreeMapLockMut<'a, K, V> where
K: PartialOrd<K>,
V: PartialOrd<V>,
sourcefn partial_cmp(&self, other: &BTreeMap<K, V>) -> Option<Ordering>
fn partial_cmp(&self, other: &BTreeMap<K, V>) -> Option<Ordering>
This method returns an ordering between self
and other
values if one exists. Read more
1.0.0 · sourcefn lt(&self, other: &Rhs) -> bool
fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self
and other
) and is used by the <
operator. Read more
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
sourceimpl<'a, K, V> PartialOrd<MutableBTreeMapLockMut<'a, K, V>> for MutableBTreeMapLockMut<'a, K, V> where
K: PartialOrd<K>,
V: PartialOrd<V>,
impl<'a, K, V> PartialOrd<MutableBTreeMapLockMut<'a, K, V>> for MutableBTreeMapLockMut<'a, K, V> where
K: PartialOrd<K>,
V: PartialOrd<V>,
sourcefn partial_cmp(&self, other: &Self) -> Option<Ordering>
fn partial_cmp(&self, other: &Self) -> Option<Ordering>
This method returns an ordering between self
and other
values if one exists. Read more
1.0.0 · sourcefn lt(&self, other: &Rhs) -> bool
fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self
and other
) and is used by the <
operator. Read more
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
impl<'a, K, V> Eq for MutableBTreeMapLockMut<'a, K, V> where
K: Eq,
V: Eq,
Auto Trait Implementations
impl<'a, K, V> RefUnwindSafe for MutableBTreeMapLockMut<'a, K, V>
impl<'a, K, V> !Send for MutableBTreeMapLockMut<'a, K, V>
impl<'a, K, V> Sync for MutableBTreeMapLockMut<'a, K, V> where
K: Send + Sync,
V: Send + Sync,
impl<'a, K, V> Unpin for MutableBTreeMapLockMut<'a, K, V>
impl<'a, K, V> UnwindSafe for MutableBTreeMapLockMut<'a, K, V>
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more