pub struct TryBTreeMap<K, V>where
K: Copy,{ /* private fields */ }Expand description
Like std::collections::BTreeMap but its methods return errors on
allocation failure.
Implementations§
Source§impl<K, V> TryBTreeMap<K, V>where
K: Copy,
impl<K, V> TryBTreeMap<K, V>where
K: Copy,
Sourcepub fn new() -> Self
pub fn new() -> Self
Same as std::collections::BTreeMap::new.
Sourcepub fn len(&self) -> usize
pub fn len(&self) -> usize
Same as std::collections::BTreeMap::len.
Sourcepub fn is_empty(&self) -> bool
pub fn is_empty(&self) -> bool
Same as std::collections::BTreeMap::is_empty.
Sourcepub fn contains_key(&self, key: K) -> boolwhere
K: Ord,
pub fn contains_key(&self, key: K) -> boolwhere
K: Ord,
Sourcepub fn get_mut(&mut self, key: K) -> Option<&mut V>where
K: Ord,
pub fn get_mut(&mut self, key: K) -> Option<&mut V>where
K: Ord,
Same as std::collections::BTreeMap::get_mut.
Sourcepub fn insert(&mut self, key: K, value: V) -> Result<Option<V>, OutOfMemory>where
K: Ord,
pub fn insert(&mut self, key: K, value: V) -> Result<Option<V>, OutOfMemory>where
K: Ord,
Same as std::collections::BTreeMap::insert but returns an error on
allocation failure.
Sourcepub fn remove(&mut self, key: K) -> Option<V>where
K: Ord,
pub fn remove(&mut self, key: K) -> Option<V>where
K: Ord,
Same as std::collections::BTreeMap::remove.
Sourcepub fn clear(&mut self)
pub fn clear(&mut self)
Same as std::collections::BTreeMap::clear.
Does not deallocate the underlying storage.
Sourcepub fn iter(&self) -> BTreeMapIter<'_, K, V> ⓘ
pub fn iter(&self) -> BTreeMapIter<'_, K, V> ⓘ
Same as std::collections::BTreeMap::iter.
Sourcepub fn iter_mut(&mut self) -> BTreeMapIterMut<'_, K, V> ⓘ
pub fn iter_mut(&mut self) -> BTreeMapIterMut<'_, K, V> ⓘ
Same as std::collections::BTreeMap::iter.
Sourcepub fn keys(&self) -> BTreeMapKeys<'_, K, V> ⓘ
pub fn keys(&self) -> BTreeMapKeys<'_, K, V> ⓘ
Same as std::collections::BTreeMap::keys.
Sourcepub fn values(&self) -> BTreeMapValues<'_, K, V> ⓘ
pub fn values(&self) -> BTreeMapValues<'_, K, V> ⓘ
Same as std::collections::BTreeMap::values.
Sourcepub fn values_mut(&mut self) -> BTreeMapValuesMut<'_, K, V> ⓘ
pub fn values_mut(&mut self) -> BTreeMapValuesMut<'_, K, V> ⓘ
Sourcepub fn range<R>(&self, range: R) -> BTreeMapRange<'_, K, V, R> ⓘwhere
K: Ord,
R: RangeBounds<K>,
pub fn range<R>(&self, range: R) -> BTreeMapRange<'_, K, V, R> ⓘwhere
K: Ord,
R: RangeBounds<K>,
Same as std::collections::BTreeMap::range.
Sourcepub fn range_mut<R>(&mut self, range: R) -> BTreeMapRangeMut<'_, K, V, R> ⓘwhere
K: Ord,
R: RangeBounds<K>,
pub fn range_mut<R>(&mut self, range: R) -> BTreeMapRangeMut<'_, K, V, R> ⓘwhere
K: Ord,
R: RangeBounds<K>,
Sourcepub fn entry(&mut self, key: K) -> Entry<'_, K, V>where
K: Ord,
pub fn entry(&mut self, key: K) -> Entry<'_, K, V>where
K: Ord,
Same as std::collections::BTreeMap::entry.
Trait Implementations§
Source§impl<K, V> Default for TryBTreeMap<K, V>where
K: Copy,
impl<K, V> Default for TryBTreeMap<K, V>where
K: Copy,
Source§impl<'a, K, V> IntoIterator for &'a TryBTreeMap<K, V>where
K: Copy,
impl<'a, K, V> IntoIterator for &'a TryBTreeMap<K, V>where
K: Copy,
Source§impl<'a, K, V> IntoIterator for &'a mut TryBTreeMap<K, V>where
K: Copy,
impl<'a, K, V> IntoIterator for &'a mut TryBTreeMap<K, V>where
K: Copy,
Source§impl<K, V> IntoIterator for TryBTreeMap<K, V>
impl<K, V> IntoIterator for TryBTreeMap<K, V>
Auto Trait Implementations§
impl<K, V> Freeze for TryBTreeMap<K, V>
impl<K, V> RefUnwindSafe for TryBTreeMap<K, V>where
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V> Send for TryBTreeMap<K, V>
impl<K, V> Sync for TryBTreeMap<K, V>
impl<K, V> Unpin for TryBTreeMap<K, V>
impl<K, V> UnwindSafe for TryBTreeMap<K, V>where
K: UnwindSafe,
V: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more