Struct DHeap

pub struct DHeap<T: Eq + Hash + Clone + Display + PartialEq> { /* private fields */ }

Implementations

impl<T: Eq + Hash + Clone + Display + PartialEq> DHeap<T>

pub fn new( initial_capacity: Option<usize>, branching_factor: Option<usize>, ) -> Self

Creates a new heap

pub fn with_pairs( data: &[Pair<T>], initial_capacity: Option<usize>, branching_factor: Option<usize>, ) -> Result<Self>

Accepts a slice of pairs and creates a heap

pub fn contains(&self, element: &T) -> bool

Returns if the element exists in the heap

pub fn remove(&mut self, element: T) -> Option<Pair<T>>

Removes the element from the heap

pub fn insert_value(&mut self, element: T, priority: usize) -> Result<(), Error>

Inserts the value

pub fn insert_pair(&mut self, element: Pair<T>) -> Result<(), Error>

Inserts a pair

pub fn peek(&self) -> Option<&Pair<T>>

Returns the highest priority value without taking it out of the queue If empty, returns None

pub fn top(&mut self) -> Option<Pair<T>>

Returns the highest priority value. This operation take the value out of the queue If empty, returns None

pub fn update_priority(&mut self, old_value: T, new_priority: usize)

Finds and update priority of the value

Trait Implementations

impl<T: Debug + Eq + Hash + Clone + Display + PartialEq> Debug for DHeap<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.