---

yaml
---
r: 35571
b: refs/heads/master
c: 285496b
h: refs/heads/master
i:
  35569: 790d1fc
  35567: 5260849
v: v3

Author: thestinger

[refs]

@@ -1,5 +1,5 @@
 ---
-refs/heads/master: 757a2afb6b80cb4dbdcb8069f1af511ec42e8670
+refs/heads/master: 285496bd550817094c31167e7e49378a35560842
 refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
 refs/heads/snap-stage3: eb8fd119c65c67f3b1b8268cc7341c22d39b7b61
 refs/heads/try: d324a424d8f84b1eb049b12cf34182bda91b0024

trunk/src/libstd/priority_queue.rs

@@ -91,6 +91,16 @@ impl <T: Copy Ord> PriorityQueue<T> {
         q.to_vec()
     }
 
+    static pub pure fn from_vec(xs: ~[T]) -> PriorityQueue<T> {
+        let mut q = PriorityQueue{data: xs,};
+        let mut n = q.len() / 2;
+        while n > 0 {
+            n -= 1;
+            unsafe { q.siftup(n) }; // purity-checking workaround
+        }
+        q
+    }
+
     priv fn siftdown(&mut self, startpos: uint, pos: uint) {
         let mut pos = pos;
         let newitem = self.data[pos];
@@ -133,20 +143,11 @@ impl <T: Copy Ord> PriorityQueue<T> {
     }
 }
 
-pub pure fn from_vec<T: Copy Ord>(xs: ~[T]) -> PriorityQueue<T> {
-    let mut q = PriorityQueue{data: xs,};
-    let mut n = q.len() / 2;
-    while n > 0 {
-        n -= 1;
-        unsafe { q.siftup(n) }; // purity-checking workaround
-    }
-    q
-}
-
 #[cfg(test)]
 mod tests {
     use sort::merge_sort;
     use core::cmp::le;
+    use PriorityQueue::from_vec;
 
     #[test]
     fn test_top_and_pop() {