diff options
Diffstat (limited to 'src/libstd/priority_queue.rs')
| -rw-r--r-- | src/libstd/priority_queue.rs | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/libstd/priority_queue.rs b/src/libstd/priority_queue.rs index b216834a205..f642bf52f65 100644 --- a/src/libstd/priority_queue.rs +++ b/src/libstd/priority_queue.rs @@ -27,7 +27,7 @@ pub struct PriorityQueue<T> { priv data: ~[T], } -impl<T: Ord> BaseIter<T> for PriorityQueue<T> { +impl<T:Ord> BaseIter<T> for PriorityQueue<T> { /// Visit all values in the underlying vector. /// /// The values are **not** visited in order. @@ -35,7 +35,7 @@ impl<T: Ord> BaseIter<T> for PriorityQueue<T> { pure fn size_hint(&self) -> Option<uint> { self.data.size_hint() } } -impl<T: Ord> Container for PriorityQueue<T> { +impl<T:Ord> Container for PriorityQueue<T> { /// Returns the length of the queue pure fn len(&self) -> uint { self.data.len() } @@ -43,12 +43,12 @@ impl<T: Ord> Container for PriorityQueue<T> { pure fn is_empty(&self) -> bool { self.data.is_empty() } } -impl<T: Ord> Mutable for PriorityQueue<T> { +impl<T:Ord> Mutable for PriorityQueue<T> { /// Drop all items from the queue fn clear(&mut self) { self.data.truncate(0) } } -impl <T: Ord> PriorityQueue<T> { +impl <T:Ord> PriorityQueue<T> { /// Returns the greatest item in the queue - fails if empty pure fn top(&self) -> &self/T { &self.data[0] } |
