1 2 3 4 5 6 7 8 9
pub mod binary_heap; pub trait PriorityQueue<T: PartialOrd> { fn with_capacity(sz: usize) -> Self; fn insert(&mut self, el: T); fn contains(&self, el: &T) -> bool; fn remove(&mut self, el: &T); fn poll(&mut self) -> Option<T>; }
1 2 3 4 5 6 7 8 9
pub mod binary_heap; pub trait PriorityQueue<T: PartialOrd> { fn with_capacity(sz: usize) -> Self; fn insert(&mut self, el: T); fn contains(&self, el: &T) -> bool; fn remove(&mut self, el: &T); fn poll(&mut self) -> Option<T>; }