[−][src]Struct futures_signals::signal_map::MutableBTreeMapLockRef
Methods from Deref<Target = BTreeMap<K, V>>
pub fn get<Q>(&self, key: &Q) -> Option<&V> where
K: Borrow<Q>,
Q: Ord + ?Sized,
1.0.0[src]
K: Borrow<Q>,
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);
pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)> where
K: Borrow<Q>,
Q: Ord + ?Sized,
1.40.0[src]
K: Borrow<Q>,
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);
pub fn first_key_value(&self) -> Option<(&K, &V)>
[src]
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")));
pub fn last_key_value(&self) -> Option<(&K, &V)>
[src]
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")));
pub fn contains_key<Q>(&self, key: &Q) -> bool where
K: Borrow<Q>,
Q: Ord + ?Sized,
1.0.0[src]
K: Borrow<Q>,
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);
pub fn range<T, R>(&self, range: R) -> Range<'_, K, V> where
K: Borrow<T>,
R: RangeBounds<T>,
T: Ord + ?Sized,
1.17.0[src]
K: Borrow<T>,
R: RangeBounds<T>,
T: Ord + ?Sized,
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());
pub fn iter(&self) -> Iter<'_, K, V>
1.0.0[src]
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"));
pub fn keys(&self) -> Keys<'_, K, V>
1.0.0[src]
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]);
pub fn values(&self) -> Values<'_, K, V>
1.0.0[src]
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"]);
pub const fn len(&self) -> usize
1.0.0[src]
Returns the number of elements in the map.
Examples
Basic usage:
use std::collections::BTreeMap; let mut a = BTreeMap::new(); assert_eq!(a.len(), 0); a.insert(1, "a"); assert_eq!(a.len(), 1);
pub const fn is_empty(&self) -> bool
1.0.0[src]
Returns true
if the map contains no elements.
Examples
Basic usage:
use std::collections::BTreeMap; let mut a = BTreeMap::new(); assert!(a.is_empty()); a.insert(1, "a"); assert!(!a.is_empty());
Trait Implementations
impl<'a, K: Debug, V: Debug> Debug for MutableBTreeMapLockRef<'a, K, V> where
K: 'a,
V: 'a,
[src]
K: 'a,
V: 'a,
impl<'a, K, V> Deref for MutableBTreeMapLockRef<'a, K, V>
[src]
type Target = BTreeMap<K, V>
The resulting type after dereferencing.
pub fn deref(&self) -> &Self::Target
[src]
impl<'a, K, V> Eq for MutableBTreeMapLockRef<'a, K, V> where
K: Eq,
V: Eq,
[src]
K: Eq,
V: Eq,
impl<'a, K, V> Hash for MutableBTreeMapLockRef<'a, K, V> where
K: Hash,
V: Hash,
[src]
K: Hash,
V: Hash,
pub fn hash<H>(&self, state: &mut H) where
H: Hasher,
[src]
H: Hasher,
pub fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl<'a, 'b, K, V> Index<&'b K> for MutableBTreeMapLockRef<'a, K, V> where
K: Ord,
[src]
K: Ord,
type Output = V
The returned type after indexing.
pub fn index(&self, key: &'b K) -> &Self::Output
[src]
impl<'a, K, V> Ord for MutableBTreeMapLockRef<'a, K, V> where
K: Ord,
V: Ord,
[src]
K: Ord,
V: Ord,
pub fn cmp(&self, other: &Self) -> Ordering
[src]
#[must_use]pub fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]pub fn min(self, other: Self) -> Self
1.21.0[src]
#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self
1.50.0[src]
impl<'a, K, V> PartialEq<BTreeMap<K, V>> for MutableBTreeMapLockRef<'a, K, V> where
K: PartialEq<K>,
V: PartialEq<V>,
[src]
K: PartialEq<K>,
V: PartialEq<V>,
pub fn eq(&self, other: &BTreeMap<K, V>) -> bool
[src]
pub fn ne(&self, other: &BTreeMap<K, V>) -> bool
[src]
impl<'a, K, V> PartialEq<MutableBTreeMapLockRef<'a, K, V>> for MutableBTreeMapLockRef<'a, K, V> where
K: PartialEq<K>,
V: PartialEq<V>,
[src]
K: PartialEq<K>,
V: PartialEq<V>,
pub fn eq(&self, other: &MutableBTreeMapLockRef<'a, K, V>) -> bool
[src]
pub fn ne(&self, other: &MutableBTreeMapLockRef<'a, K, V>) -> bool
[src]
impl<'a, K, V> PartialOrd<BTreeMap<K, V>> for MutableBTreeMapLockRef<'a, K, V> where
K: PartialOrd<K>,
V: PartialOrd<V>,
[src]
K: PartialOrd<K>,
V: PartialOrd<V>,
pub fn partial_cmp(&self, other: &BTreeMap<K, V>) -> Option<Ordering>
[src]
#[must_use]pub fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]pub fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]pub fn gt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]pub fn ge(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a, K, V> PartialOrd<MutableBTreeMapLockRef<'a, K, V>> for MutableBTreeMapLockRef<'a, K, V> where
K: PartialOrd<K>,
V: PartialOrd<V>,
[src]
K: PartialOrd<K>,
V: PartialOrd<V>,
Auto Trait Implementations
impl<'a, K, V> RefUnwindSafe for MutableBTreeMapLockRef<'a, K, V>
impl<'a, K, V> !Send for MutableBTreeMapLockRef<'a, K, V>
impl<'a, K, V> Sync for MutableBTreeMapLockRef<'a, K, V> where
K: Send + Sync,
V: Send + Sync,
K: Send + Sync,
V: Send + Sync,
impl<'a, K, V> Unpin for MutableBTreeMapLockRef<'a, K, V>
impl<'a, K, V> UnwindSafe for MutableBTreeMapLockRef<'a, K, V>
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,