Register snapshots

src/libcore/int-template.rs

@@ -12,10 +12,6 @@
 #[forbid(deprecated_mode)];
 #[forbid(deprecated_pattern)];
 
-#[cfg(stage0)]
-use T = inst::T;
-#[cfg(stage1)]
-#[cfg(stage2)]
 use T = self::inst::T;
 
 use cmp::{Eq, Ord};

src/libcore/int-template/int.rs

@@ -10,10 +10,6 @@
 
 //! Operations and constants for `int`
 
-#[cfg(stage0)]
-pub use inst::pow;
-#[cfg(stage1)]
-#[cfg(stage2)]
 pub use self::inst::pow;
 
 mod inst {

src/libcore/iter-trait.rs

@@ -17,10 +17,6 @@
 
 use cmp::{Eq, Ord};
 
-#[cfg(stage0)]
-use inst::{IMPL_T, EACH, SIZE_HINT};
-#[cfg(stage1)]
-#[cfg(stage2)]
 use self::inst::{IMPL_T, EACH, SIZE_HINT};
 
 impl<A> IMPL_T<A>: iter::BaseIter<A> {

src/libcore/kinds.rs

@@ -44,15 +44,6 @@ pub trait Copy {
     // Empty.
 }
 
-#[cfg(stage0)]
-#[lang="send"]
-pub trait Owned {
-    // Empty.
-}
-
-#[cfg(stage1)]
-#[cfg(stage2)]
-#[cfg(stage3)]
 #[lang="owned"]
 pub trait Owned {
     // Empty.
@@ -63,15 +54,6 @@ pub trait Const {
     // Empty.
 }
 
-#[cfg(stage0)]
-#[lang="owned"]
-pub trait Durable {
-    // Empty.
-}
-
-#[cfg(stage1)]
-#[cfg(stage2)]
-#[cfg(stage3)]
 #[lang="durable"]
 pub trait Durable {
     // Empty.

src/libcore/uint-template.rs

@@ -12,10 +12,6 @@
 #[forbid(deprecated_mode)];
 #[forbid(deprecated_pattern)];
 
-#[cfg(stage0)]
-use T = inst::T;
-#[cfg(stage1)]
-#[cfg(stage2)]
 use T = self::inst::T;
 
 use cmp::{Eq, Ord};

src/libcore/uint-template/u8.rs

@@ -10,10 +10,6 @@
 
 //! Operations and constants for `u8`
 
-#[cfg(stage0)]
-pub use inst::is_ascii;
-#[cfg(stage1)]
-#[cfg(stage2)]
 pub use self::inst::is_ascii;
 
 mod inst {

src/libcore/uint-template/uint.rs

@@ -10,13 +10,6 @@
 
 //! Operations and constants for `uint`
 
-#[cfg(stage0)]
-pub use inst::{
-    div_ceil, div_round, div_floor, iterate,
-    next_power_of_two
-};
-#[cfg(stage1)]
-#[cfg(stage2)]
 pub use self::inst::{
     div_ceil, div_round, div_floor, iterate,
     next_power_of_two

src/libstd/priority_queue.rs

@@ -80,20 +80,10 @@ fn replace(&mut self, item: T) -> 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();

src/snapshots.txt

+S 2012-12-14 dbc52ce
+  macos-i386 994697c57810b8f139d71df47024512970db860c
+  macos-x86_64 f8faa6a80b0b98b27ceee6fec71ded7ca058104d
+  winnt-i386 92ac1ac09a262a59f40160c9dcf535e1c8ea8e75
+  freebsd-x86_64 d39ff0cbd7fdf04de55baea9d4003705f5ff6441
+  linux-i386 a7cfdd83d18e9064644147204f96fada70f3b47e
+  linux-x86_64 601d0e105b46a8c6487e8ac2cd159750039a6049
+
 S 2012-12-08 6630d75
   macos-i386 cdb0f0ebe99b8fea7688d9ae32860a63d1e05399
   macos-x86_64 c509dc252be6e1c5cf862c659235dc94bde397aa