---

yaml
---
r: 69599
b: refs/heads/auto
c: 2047026
h: refs/heads/master
i:
  69597: b48d07a
  69595: 46d693d
  69591: 01af67a
  69583: d06db76
  69567: 65f9565
v: v3

Author: mstewartgallus

[refs]

@@ -14,6 +14,6 @@ refs/heads/try3: 9387340aab40a73e8424c48fd42f0c521a4875c0
 refs/tags/release-0.3.1: 495bae036dfe5ec6ceafd3312b4dca48741e845b
 refs/tags/release-0.4: e828ea2080499553b97dfe33b3f4d472b4562ad7
 refs/tags/release-0.5: 7e3bcfbf21278251ee936ad53e92e9b719702d73
-refs/heads/auto: bbcce8d95c582d3f918fe4e978d6a715efd991e9
+refs/heads/auto: 2047026fefa38773ecdb046998a65ca1e1dc9cef
 refs/heads/servo: af82457af293e2a842ba6b7759b70288da276167
 refs/tags/release-0.6: b4ebcfa1812664df5e142f0134a5faea3918544c

branches/auto/doc/rust.md

@@ -2386,8 +2386,9 @@ foreach e in v.iter() {
 An example of a for loop over a series of integers:
 
 ~~~~
+# use std::uint;
 # fn bar(b:uint) { }
-foreach i in range(0u, 256) {
+for uint::range(0, 256) |i| {
     bar(i);
 }
 ~~~~

branches/auto/doc/tutorial-tasks.md

@@ -120,8 +120,9 @@ should interleave the output in vaguely random order.
 ~~~
 # use std::io::print;
 # use std::task::spawn;
+# use std::int;
 
-foreach child_task_number in range(0, 20) {
+for int::range(0, 20) |child_task_number| {
     do spawn {
        print(fmt!("I am child number %d\n", child_task_number));
     }
@@ -236,11 +237,12 @@ Instead we can use a `SharedChan`, a type that allows a single
 ~~~
 # use std::task::spawn;
 # use std::comm::{stream, SharedChan};
+# use std::uint;
 
 let (port, chan) = stream();
 let chan = SharedChan::new(chan);
 
-foreach init_val in range(0u, 3) {
+for uint::range(0, 3) |init_val| {
     // Create a new channel handle to distribute to the child task
     let child_chan = chan.clone();
     do spawn {
@@ -312,9 +314,10 @@ Here is another example showing how futures allow you to background computations
 be distributed on the available cores.
 ~~~
 # use std::vec;
+# use std::uint;
 fn partial_sum(start: uint) -> f64 {
     let mut local_sum = 0f64;
-    foreach num in range(start*100000, (start+1)*100000) {
+    for uint::range(start*100000, (start+1)*100000) |num| {
         local_sum += (num as f64 + 1.0).pow(&-2.0);
     }
     local_sum
@@ -346,6 +349,7 @@ Here is a small example showing how to use Arcs. We wish to run concurrently sev
 a single large vector of floats. Each task needs the full vector to perform its duty.
 ~~~
 # use std::vec;
+# use std::uint;
 # use std::rand;
 use extra::arc::Arc;
 
@@ -359,7 +363,7 @@ fn main() {
 
     let numbers_arc = Arc::new(numbers);
 
-    foreach num in range(1u, 10) {
+    for uint::range(1,10) |num| {
         let (port, chan)  = stream();
         chan.send(numbers_arc.clone());
 

branches/auto/src/compiletest/runtest.rs

@@ -23,6 +23,7 @@ use util::logv;
 use std::io;
 use std::os;
 use std::str;
+use std::uint;
 use std::vec;
 
 use extra::test::MetricMap;
@@ -413,7 +414,7 @@ fn check_expected_errors(expected_errors: ~[errors::ExpectedError],
         }
     }
 
-    foreach i in range(0u, found_flags.len()) {
+    for uint::range(0u, found_flags.len()) |i| {
         if !found_flags[i] {
             let ee = &expected_errors[i];
             fatal_ProcRes(fmt!("expected %s on line %u not found: %s",

branches/auto/src/libextra/arc.rs

@@ -566,6 +566,7 @@ mod tests {
     use std::cell::Cell;
     use std::comm;
     use std::task;
+    use std::uint;
 
     #[test]
     fn manually_share_arc() {
@@ -850,7 +851,7 @@ mod tests {
                 *state = 31337;
                 // FIXME: #7372: hits type inference bug with iterators
                 // send to other readers
-                foreach i in range(0u, reader_convos.len()) {
+                for uint::range(0, reader_convos.len()) |i| {
                     match reader_convos[i] {
                         (ref rc, _) => rc.send(()),
                     }
@@ -860,7 +861,7 @@ mod tests {
             do (&read_mode).read |state| {
                 // FIXME: #7372: hits type inference bug with iterators
                 // complete handshake with other readers
-                foreach i in range(0u, reader_convos.len()) {
+                for uint::range(0, reader_convos.len()) |i| {
                     match reader_convos[i] {
                         (_, ref rp) => rp.recv(),
                     }

branches/auto/src/libextra/arena.rs

@@ -277,7 +277,7 @@ impl Arena {
 #[test]
 fn test_arena_destructors() {
     let arena = Arena();
-    foreach i in range(0u, 10) {
+    for uint::range(0, 10) |i| {
         // Arena allocate something with drop glue to make sure it
         // doesn't leak.
         do arena.alloc { @i };
@@ -293,7 +293,7 @@ fn test_arena_destructors() {
 fn test_arena_destructors_fail() {
     let arena = Arena();
     // Put some stuff in the arena.
-    foreach i in range(0u, 10) {
+    for uint::range(0, 10) |i| {
         // Arena allocate something with drop glue to make sure it
         // doesn't leak.
         do arena.alloc { @i };

branches/auto/src/libextra/bitv.rs

@@ -19,6 +19,7 @@ use std::ops;
 use std::uint;
 use std::vec;
 
+
 #[deriving(Clone)]
 struct SmallBitv {
     /// only the lowest nbits of this value are used. the rest is undefined.
@@ -145,7 +146,7 @@ impl BigBitv {
         let len = b.storage.len();
         assert_eq!(self.storage.len(), len);
         let mut changed = false;
-        foreach i in range(0, len) {
+        for uint::range(0, len) |i| {
             let mask = big_mask(nbits, i);
             let w0 = self.storage[i] & mask;
             let w1 = b.storage[i] & mask;
@@ -160,7 +161,7 @@ impl BigBitv {
 
     #[inline]
     pub fn each_storage(&mut self, op: &fn(v: &mut uint) -> bool) -> bool {
-        range(0u, self.storage.len()).advance(|i| op(&mut self.storage[i]))
+        uint::range(0, self.storage.len(), |i| op(&mut self.storage[i]))
     }
 
     #[inline]
@@ -510,7 +511,7 @@ impl Bitv {
     }
 
     pub fn ones(&self, f: &fn(uint) -> bool) -> bool {
-        range(0u, self.nbits).advance(|i| !self.get(i) || f(i))
+        uint::range(0, self.nbits, |i| !self.get(i) || f(i))
     }
 
 }
@@ -541,7 +542,7 @@ pub fn from_bools(bools: &[bool]) -> Bitv {
  */
 pub fn from_fn(len: uint, f: &fn(index: uint) -> bool) -> Bitv {
     let mut bitv = Bitv::new(len, false);
-    foreach i in range(0u, len) {
+    for uint::range(0, len) |i| {
         bitv.set(i, f(i));
     }
     bitv
@@ -558,7 +559,7 @@ fn iterate_bits(base: uint, bits: uint, f: &fn(uint) -> bool) -> bool {
     if bits == 0 {
         return true;
     }
-    foreach i in range(0u, uint::bits) {
+    for uint::range(0, uint::bits) |i| {
         if bits & (1 << i) != 0 {
             if !f(base + i) {
                 return false;
@@ -673,7 +674,7 @@ impl BitvSet {
     fn other_op(&mut self, other: &BitvSet, f: &fn(uint, uint) -> uint) {
         fn nbits(mut w: uint) -> uint {
             let mut bits = 0;
-            foreach _ in range(0u, uint::bits) {
+            for uint::range(0, uint::bits) |_| {
                 if w == 0 {
                     break;
                 }
@@ -1282,12 +1283,12 @@ mod tests {
     #[test]
     fn test_equal_sneaky_big() {
         let mut a = bitv::Bitv::new(100, false);
-        foreach i in range(0u, 100) {
+        for uint::range(0, 100) |i| {
             a.set(i, true);
         }
 
         let mut b = bitv::Bitv::new(100, true);
-        foreach i in range(0u, 100) {
+        for uint::range(0, 100) |i| {
             b.set(i, true);
         }
 

branches/auto/src/libextra/container.rs

@@ -41,8 +41,9 @@ pub trait Deque<T> : Mutable {
 
 #[cfg(test)]
 mod bench {
+
     use std::container::MutableMap;
-    use std::{vec, rand};
+    use std::{vec,rand,uint};
     use std::rand::RngUtil;
     use test::BenchHarness;
 
@@ -53,7 +54,7 @@ mod bench {
         let mut rng = rand::XorShiftRng::new();
 
         map.clear();
-        foreach _ in range(0, n) {
+        for uint::range(0,n) |_i| {
             map.insert(rng.gen::<uint>() % n, 1);
         }
 
@@ -70,7 +71,7 @@ mod bench {
                                                  bh: &mut BenchHarness) {
         // setup
         map.clear();
-        foreach i in range(0u, n) {
+        for uint::range(0, n) |i| {
             map.insert(i*2, 1);
         }
 
@@ -108,7 +109,7 @@ mod bench {
                                                map: &mut M,
                                                bh: &mut BenchHarness) {
         // setup
-        foreach i in range(0u, n) {
+        for uint::range(0, n) |i| {
             map.insert(i, 1);
         }
 
@@ -119,4 +120,4 @@ mod bench {
             i = (i + 1) % n;
         }
      }
-}
+}

branches/auto/src/libextra/crypto/sha2.rs

@@ -8,6 +8,9 @@
 // option. This file may not be copied, modified, or distributed
 // except according to those terms.
 
+
+use std::uint;
+
 use digest::Digest;
 
 // BitCounter is a specialized structure intended simply for counting the
@@ -166,7 +169,7 @@ impl Engine512 {
             ((x << 45) | (x >> 19)) ^ ((x << 3) | (x >> 61)) ^ (x >> 6)
         }
 
-        foreach t in range(16u, 80) {
+        for uint::range(16, 80) |t| {
             self.W[t] = sigma1(self.W[t - 2]) + self.W[t - 7] + sigma0(self.W[t - 15]) +
                 self.W[t - 16];
         }
@@ -181,7 +184,7 @@ impl Engine512 {
         let mut h = self.H7;
 
         let mut t = 0;
-        foreach _ in range(0u, 10) {
+        for uint::range(0, 10) |_| {
             h += sum1(e) + ch(e, f, g) + K64[t] + self.W[t];
             d += h;
             h += sum0(a) + maj(a, b, c);
@@ -251,7 +254,7 @@ impl Engine512 {
 
         // add length
         if (self.W_idx > 14) {
-            foreach _ in range(self.W_idx, 16) {
+            for uint::range(self.W_idx, 16) |_| {
                 self.process_word(0);
             }
         }
@@ -449,7 +452,7 @@ impl Engine256 {
             ((x >> 17) | (x << 15)) ^ ((x >> 19) | (x << 13)) ^ (x >> 10)
         }
 
-        foreach t in range(16u, 64) {
+        for uint::range(16, 64) |t| {
             self.W[t] = sigma1(self.W[t - 2]) + self.W[t - 7] + sigma0(self.W[t - 15]) +
                 self.W[t - 16];
         }
@@ -464,7 +467,7 @@ impl Engine256 {
         let mut h = self.H7;
 
         let mut t = 0;
-        foreach _ in range(0u, 8) {
+        for uint::range(0, 8) |_| {
             h += sum1(e) + ch(e, f, g) + K32[t] + self.W[t];
             d += h;
             h += sum0(a) + maj(a, b, c);
@@ -533,7 +536,7 @@ impl Engine256 {
 
         // add length
         if (self.W_idx > 14) {
-            foreach _ in range(self.W_idx, 16) {
+            for uint::range(self.W_idx, 16) |_| {
                 self.process_word(0);
             }
         }

branches/auto/src/libextra/dlist.rs

@@ -607,6 +607,7 @@ pub fn check_links<T>(list: &DList<T>) {
 mod tests {
     use super::*;
     use std::rand;
+    use std::int;
     use extra::test;
 
     #[test]
@@ -943,7 +944,7 @@ mod tests {
     fn fuzz_test(sz: int) {
         let mut m = DList::new::<int>();
         let mut v = ~[];
-        foreach i in range(0, sz) {
+        for int::range(0i, sz) |i| {
             check_links(&m);
             let r: u8 = rand::random();
             match r % 6 {

branches/auto/src/libextra/fileinput.rs

@@ -596,7 +596,7 @@ mod test {
         input.next_file(); // skip the rest of 1
 
         // read all lines from 1 (but don't read any from 2),
-        foreach i in range(1u, 4) {
+        for uint::range(1, 4) |i| {
             assert_eq!(input.read_line(), fmt!("1 %u", i));
         }
         // 1 is finished, but 2 hasn't been started yet, so this will