Struct BinaryHeap

pub struct BinaryHeap<T: PartialOrd> { /* private fields */ }

Implementations

impl<T: PartialOrd> BinaryHeap<T>

pub fn swap(&mut self, i: usize, j: usize)

Trait Implementations

impl<T: PartialOrd> PriorityQueue<T> for BinaryHeap<T>

fn insert(&mut self, el: T)

Adds an element to the priority queue, O(log(n))

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

Test if an element is in heap, O(n)

fn remove(&mut self, el: &T)

Removes a particular element in the heap, O(n)

fn poll(&mut self) -> Option<T>

Removes the root of the heap, O(log(n))

fn with_capacity(sz: usize) -> Self