Struct heap_map::HeapMap

pub struct HeapMap<K: Hash + Eq + Copy + Debug, V: Eq + Ord + Clone> { /* private fields */ }

The HeapMap maintain a max heap along with a hash map to support additional remove and update operations.

Implementations

impl<K: Hash + Eq + Copy + Debug, V: Eq + Ord + Clone> HeapMap<K, V>

pub fn new() -> Self

pub fn insert(&mut self, key: &K, value: V) -> Option<V>

Insert a K-V into the HeapMap. Return the old value if key already exist. Return None otherwise.

pub fn remove(&mut self, key: &K) -> Option<V>

Remove key from the HeapMap.

pub fn update_with<F>(&mut self, key: &K, update_fn: F)

where F: FnMut(&mut V),

In-place update some fields of a node’s value.

pub fn top(&self) -> Option<(&K, &V)>

Return the top K-V reference tuple.

pub fn pop(&mut self) -> Option<(K, V)>

Pop the top node and return it as a K-V tuple.

pub fn get(&self, key: &K) -> Option<&V>

Get the value reference of key.

pub fn clear(&mut self)

Clear all key-values of the HeapMap.

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

pub fn iter(&self) -> impl Iterator<Item = V> + '_

Trait Implementations

impl<K: Hash + Eq + Copy + Debug, V: Eq + Ord + Clone> Default for HeapMap<K, V>

fn default() -> Self

Returns the “default value” for a type.

impl<K, V> MallocSizeOf for HeapMap<K, V>

where K: MallocSizeOf + Hash + Eq + Copy + Debug, V: MallocSizeOf + Eq + Ord + Clone,

fn size_of(&self, ops: &mut MallocSizeOfOps) -> usize

Measure the heap usage of all descendant heap-allocated structures, but not the space taken up by the value itself.