Struct AddressableHeap

pub struct AddressableHeap<NodeID: Copy + Integer, Weight: Bounded + Copy + Integer + Debug, Data> { /* private fields */ }

Implementations

impl<NodeID: Copy + Hash + Integer, Weight: Bounded + Copy + Integer + Debug, Data> AddressableHeap<NodeID, Weight, Data>

pub fn new() -> AddressableHeap<NodeID, Weight, Data>

pub fn clear(&mut self)

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn inserted_len(&self) -> usize

return the number of inserted elements since the last time queue was cleared. Note that this is not the number of elements currently in the heap, nor the number of removed elements.

pub fn insert(&mut self, node: NodeID, weight: Weight, data: Data)

pub fn data(&self, node: NodeID) -> &Data

pub fn data_mut(&mut self, node: NodeID) -> &mut Data

pub fn weight(&self, node: NodeID) -> Weight

pub fn removed(&self, node: NodeID) -> bool

pub fn contains(&self, node: NodeID) -> bool

pub fn inserted(&self, node: NodeID) -> bool

pub fn min(&self) -> NodeID

Returns the node with minimum weight without removing it from the heap. Panics if the heap is empty.

Examples

use toolbox_rs::addressable_binary_heap::AddressableHeap;
let mut heap = AddressableHeap::new();
heap.insert(1, 1, 0);
heap.insert(2, 2, 0);
assert_eq!(heap.min(), 1);

pub fn pop(&mut self) -> Option<NodeID>

Returns the node with minimum weight without removing it, or None if the heap is empty.

Examples

use toolbox_rs::addressable_binary_heap::AddressableHeap;
let mut heap = AddressableHeap::new();

assert_eq!(heap.pop(), None);  // Empty heap

heap.insert(1, 1, 0);
heap.insert(2, 2, 0);
assert_eq!(heap.pop(), Some(1));  // Returns min without removing
assert_eq!(heap.pop(), Some(1));  // Still returns 1 as it wasn't removed

pub fn delete_min(&mut self) -> NodeID

pub fn flush(&mut self)

pub fn decrease_key(&mut self, node: NodeID, weight: Weight)

pub fn decrease_key_and_update_data( &mut self, node: NodeID, weight: Weight, data: Data, )

pub fn up_heap(&mut self, key: usize)

Trait Implementations

impl<NodeID: Copy + Hash + Integer, Weight: Bounded + Copy + Integer + Debug, Data> Default for AddressableHeap<NodeID, Weight, Data>

fn default() -> Self

Returns the “default value” for a type.