---

yaml
---
r: 34171
b: refs/heads/snap-stage3
c: f1e8773
h: refs/heads/master
i:
  34169: 76dff49
  34167: edaa912
v: v3

Author: thestinger

[refs]

@@ -1,7 +1,7 @@
 ---
 refs/heads/master: cd6f24f9d14ac90d167386a56e7a6ac1f0318195
 refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
-refs/heads/snap-stage3: 02e804bba8e2e82e6e2112ceb297ffb237b42ea6
+refs/heads/snap-stage3: f1e87733bd4b669f2dcfe758a7ae2b1ddea60715
 refs/heads/try: d324a424d8f84b1eb049b12cf34182bda91b0024
 refs/tags/release-0.1: 1f5c5126e96c79d22cb7862f75304136e204f105
 refs/heads/ndm: f3868061cd7988080c30d6d5bf352a5a5fe2460b

branches/snap-stage3/src/libstd/priority_queue.rs

@@ -105,8 +105,11 @@ impl <T: Ord> PriorityQueue<T> {
         q.to_vec()
     }
 
+    /// Create an empty PriorityQueue
+    static pure fn new() -> PriorityQueue<T> { PriorityQueue{data: ~[],} }
+
     /// Create a PriorityQueue from a vector (heapify)
-    static pub pure fn from_vec(xs: ~[T]) -> PriorityQueue<T> {
+    static pure fn from_vec(xs: ~[T]) -> PriorityQueue<T> {
         let mut q = PriorityQueue{data: xs,};
         let mut n = q.len() / 2;
         while n > 0 {
@@ -168,7 +171,7 @@ impl <T: Ord> PriorityQueue<T> {
 mod tests {
     use sort::merge_sort;
     use core::cmp::le;
-    use priority_queue::PriorityQueue::from_vec;
+    use priority_queue::PriorityQueue::{from_vec, new};
 
     #[test]
     fn test_top_and_pop() {
@@ -279,30 +282,27 @@ mod tests {
     #[test]
     #[should_fail]
     #[ignore(cfg(windows))]
-    fn test_empty_pop() { let mut heap = from_vec::<int>(~[]); heap.pop(); }
+    fn test_empty_pop() { let mut heap = new::<int>(); heap.pop(); }
 
     #[test]
     fn test_empty_maybe_pop() {
-        let mut heap = from_vec::<int>(~[]);
+        let mut heap = new::<int>();
         assert heap.maybe_pop().is_none();
     }
 
     #[test]
     #[should_fail]
     #[ignore(cfg(windows))]
-    fn test_empty_top() { let empty = from_vec::<int>(~[]); empty.top(); }
+    fn test_empty_top() { let empty = new::<int>(); empty.top(); }
 
     #[test]
     fn test_empty_maybe_top() {
-        let empty = from_vec::<int>(~[]);
+        let empty = new::<int>();
         assert empty.maybe_top().is_none();
     }
 
     #[test]
     #[should_fail]
     #[ignore(cfg(windows))]
-    fn test_empty_replace() {
-        let mut heap = from_vec::<int>(~[]);
-        heap.replace(5);
-    }
+    fn test_empty_replace() { let mut heap = new(); heap.replace(5); }
 }