Struct cranelift_bforest::Map [−][src]
Expand description
B-tree mapping from K
to V
.
This is not a general-purpose replacement for BTreeMap
. See the module
documentation for more information about design tradeoffs.
Maps can be cloned, but that operation should only be used as part of cloning the whole forest they belong to. Cloning a map does not allocate new memory for the clone. It creates an alias of the same memory.
Implementations
Get the value stored for key
.
pub fn get_or_less<C: Comparator<K>>(
&self,
key: K,
forest: &MapForest<K, V>,
comp: &C
) -> Option<(K, V)>
pub fn get_or_less<C: Comparator<K>>(
&self,
key: K,
forest: &MapForest<K, V>,
comp: &C
) -> Option<(K, V)>
Look up the value stored for key
.
If it exists, return the stored key-value pair.
Otherwise, return the last key-value pair with a key that is less than or equal to key
.
If no stored keys are less than or equal to key
, return None
.
pub fn insert<C: Comparator<K>>(
&mut self,
key: K,
value: V,
forest: &mut MapForest<K, V>,
comp: &C
) -> Option<V>
pub fn insert<C: Comparator<K>>(
&mut self,
key: K,
value: V,
forest: &mut MapForest<K, V>,
comp: &C
) -> Option<V>
Insert key, value
into the map and return the old value stored for key
, if any.
pub fn remove<C: Comparator<K>>(
&mut self,
key: K,
forest: &mut MapForest<K, V>,
comp: &C
) -> Option<V>
pub fn remove<C: Comparator<K>>(
&mut self,
key: K,
forest: &mut MapForest<K, V>,
comp: &C
) -> Option<V>
Remove key
from the map and return the removed value for key
, if any.
Retains only the elements specified by the predicate.
Remove all key-value pairs where the predicate returns false.
The predicate is allowed to update the values stored in the map.
pub fn cursor<'a, C: Comparator<K>>(
&'a mut self,
forest: &'a mut MapForest<K, V>,
comp: &'a C
) -> MapCursor<'a, K, V, C>
pub fn cursor<'a, C: Comparator<K>>(
&'a mut self,
forest: &'a mut MapForest<K, V>,
comp: &'a C
) -> MapCursor<'a, K, V, C>
Create a cursor for navigating this map. The cursor is initially positioned off the end of the map.
Trait Implementations
Auto Trait Implementations
impl<K, V> RefUnwindSafe for Map<K, V> where
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V> UnwindSafe for Map<K, V> where
K: UnwindSafe,
V: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more