|
|
@ -20,6 +20,10 @@ impl<T: PartialOrd> Heap<T> {
|
|
|
|
self.elements.len()
|
|
|
|
self.elements.len()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
pub fn is_empty(&self) -> bool {
|
|
|
|
|
|
|
|
self.elements.is_empty()
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
pub fn push(&mut self, item: T) {
|
|
|
|
pub fn push(&mut self, item: T) {
|
|
|
|
self.elements.push(item);
|
|
|
|
self.elements.push(item);
|
|
|
|
let mut i = self.len() - 1;
|
|
|
|
let mut i = self.len() - 1;
|
|
|
@ -30,7 +34,7 @@ impl<T: PartialOrd> Heap<T> {
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
pub fn pop(&mut self) -> Option<T> {
|
|
|
|
pub fn pop(&mut self) -> Option<T> {
|
|
|
|
if self.len() > 0 {
|
|
|
|
if !self.is_empty() {
|
|
|
|
let result = self.elements.swap_remove(0);
|
|
|
|
let result = self.elements.swap_remove(0);
|
|
|
|
self.heapify(0);
|
|
|
|
self.heapify(0);
|
|
|
|
Some(result)
|
|
|
|
Some(result)
|
|
|
|