pub struct BTreeMap<A, B> { /* private fields */ }
Implementations§
Source§impl<K: Ord, V> BTreeMap<K, V>
impl<K: Ord, V> BTreeMap<K, V>
pub fn contains_key(&self, key: &K) -> bool
pub fn get(&self, key: &K) -> Option<&V>
pub fn get_mut(&mut self, key: &K) -> Option<&mut V>
pub fn insert(&mut self, key: K, val: V) -> bool
pub fn len(&self) -> usize
pub fn iter(&self) -> impl Iterator<Item = &Pair<K, V>>
pub fn into_iter(self) -> impl Iterator<Item = Pair<K, V>>
pub fn keys(&self) -> impl Iterator<Item = &K>
pub fn values(&self) -> impl Iterator<Item = &V>
pub fn into_keys(self) -> impl Iterator<Item = K>
pub fn into_values(self) -> impl Iterator<Item = V>
pub fn increasing(&self) -> impl Iterator<Item = &Pair<K, V>>
pub fn decreasing(&self) -> impl Iterator<Item = &Pair<K, V>>
Auto Trait Implementations§
impl<A, B> Freeze for BTreeMap<A, B>
impl<A, B> RefUnwindSafe for BTreeMap<A, B>where
A: RefUnwindSafe,
B: RefUnwindSafe,
impl<A, B> Send for BTreeMap<A, B>
impl<A, B> Sync for BTreeMap<A, B>
impl<A, B> Unpin for BTreeMap<A, B>
impl<A, B> UnwindSafe for BTreeMap<A, B>where
A: UnwindSafe,
B: 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