---

yaml
---
r: 36773
b: refs/heads/try2
c: 90bebe3
h: refs/heads/master
i:
  36771: 17a37d9
v: v3

Author: brson

[refs]

@@ -5,7 +5,7 @@ refs/heads/snap-stage3: eb8fd119c65c67f3b1b8268cc7341c22d39b7b61
 refs/heads/try: d324a424d8f84b1eb049b12cf34182bda91b0024
 refs/tags/release-0.1: 1f5c5126e96c79d22cb7862f75304136e204f105
 refs/heads/ndm: f3868061cd7988080c30d6d5bf352a5a5fe2460b
-refs/heads/try2: ac695aa21a93dc7b82d817a69c8c1918bb4d9b31
+refs/heads/try2: 90bebe35224c6dc0238e3a35726bcd5fb0088337
 refs/heads/incoming: d9317a174e434d4c99fc1a37fd7dc0d2f5328d37
 refs/heads/dist-snap: 22efa39382d41b084fde1719df7ae8ce5697d8c9
 refs/tags/release-0.2: c870d2dffb391e14efb05aa27898f1f6333a9596

branches/try2/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);