---

yaml
---
r: 35580
b: refs/heads/master
c: 90bebe3
h: refs/heads/master
v: v3

Author: brson

[refs]

@@ -1,5 +1,5 @@
 ---
-refs/heads/master: ac695aa21a93dc7b82d817a69c8c1918bb4d9b31
+refs/heads/master: 90bebe35224c6dc0238e3a35726bcd5fb0088337
 refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
 refs/heads/snap-stage3: eb8fd119c65c67f3b1b8268cc7341c22d39b7b61
 refs/heads/try: d324a424d8f84b1eb049b12cf34182bda91b0024

trunk/src/libstd/priority_queue.rs

@@ -79,9 +79,19 @@ impl <T: Ord> PriorityQueue<T> {
     }
 
     /// Consume the PriorityQueue and return the underlying vector
+    #[cfg(stage0)]
+    pure fn to_vec(self) -> ~[T] { fail }
+    #[cfg(stage1)]
+    #[cfg(stage2)]
+    #[cfg(stage3)]
     pure fn to_vec(self) -> ~[T] { let PriorityQueue{data: v} = self; v }
 
     /// Consume the PriorityQueue and return a vector in sorted (ascending) order
+    #[cfg(stage0)]
+    pure fn to_sorted_vec(self) -> ~[T] { fail }
+    #[cfg(stage1)]
+    #[cfg(stage2)]
+    #[cfg(stage3)]
     pure fn to_sorted_vec(self) -> ~[T] {
         let mut q = self;
         let mut end = q.len();
@@ -244,6 +254,7 @@ mod tests {
 
     #[test]
     #[should_fail]
+    #[ignore(cfg(windows))]
     fn test_empty_pop() { let mut heap = from_vec::<int>(~[]); heap.pop(); }
 
     #[test]
@@ -254,6 +265,7 @@ mod tests {
 
     #[test]
     #[should_fail]
+    #[ignore(cfg(windows))]
     fn test_empty_top() { let empty = from_vec::<int>(~[]); empty.top(); }
 
     #[test]
@@ -264,6 +276,7 @@ mod tests {
 
     #[test]
     #[should_fail]
+    #[ignore(cfg(windows))]
     fn test_empty_replace() {
         let mut heap = from_vec::<int>(~[]);
         heap.replace(5);