bjoernager/rust
bjoernager/rust
1
Fork 0
Code Activity

add a BaseIter implementation for PriorityQueue

Browse source
This commit is contained in:
Daniel Micay 2013-02-07 17:08:04 -05:00
parent 6647a3402b
commit d903231f1e
1 changed files with 9 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

9
src/libstd/priority_queue.rs
View file

@ -12,6 +12,7 @@
use core::container::{Container, Mutable};
use core::cmp::Ord;
use core::iter::BaseIter;
use core::prelude::*;
use core::ptr::addr_of;
use core::vec;
@ -26,6 +27,14 @@ pub struct PriorityQueue<T> {
priv data: ~[T],
}
impl <T: Ord> PriorityQueue<T>: BaseIter<T> {
/// Visit all values in the underlying vector.
///
/// The values are **not** visited in order.
pure fn each(&self, f: fn(&T) -> bool) { self.data.each(f) }
pure fn size_hint(&self) -> Option<uint> { self.data.size_hint() }
}
impl <T: Ord> PriorityQueue<T>: Container {
/// Returns the length of the queue
pure fn len(&self) -> uint { self.data.len() }