algorithms_edu/data_structures/
priority_queue.rs

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