Skip to content

Commit 2d76c94

Browse files
author
Jorge Aparicio
committed
s/while let/for/g now that rust-lang#21245 has been fixed
1 parent c013a01 commit 2d76c94

File tree

12 files changed

+19
-54
lines changed

12 files changed

+19
-54
lines changed

src/libcollections/bit.rs

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -104,9 +104,7 @@ type MatchWords<'a> = Chain<Enumerate<Blocks<'a>>, Skip<Take<Enumerate<Repeat<u3
104104

105105
fn reverse_bits(byte: u8) -> u8 {
106106
let mut result = 0;
107-
// FIXME(#21245) use a for loop
108-
let mut iter = 0..u8::BITS;
109-
while let Some(i) = iter.next() {
107+
for i in 0..u8::BITS {
110108
result |= ((byte >> i) & 1) << (u8::BITS - 1 - i);
111109
}
112110
result

src/libcollections/ring_buf.rs

Lines changed: 2 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1793,9 +1793,7 @@ mod tests {
17931793
fn bench_push_back_100(b: &mut test::Bencher) {
17941794
let mut deq = RingBuf::with_capacity(101);
17951795
b.iter(|| {
1796-
// FIXME(#21245) use a for loop
1797-
let mut iter = 0i..100;
1798-
while let Some(i) = iter.next() {
1796+
for i in 0i..100 {
17991797
deq.push_back(i);
18001798
}
18011799
deq.head = 0;
@@ -1807,9 +1805,7 @@ mod tests {
18071805
fn bench_push_front_100(b: &mut test::Bencher) {
18081806
let mut deq = RingBuf::with_capacity(101);
18091807
b.iter(|| {
1810-
// FIXME(#21245) use a for loop
1811-
let mut iter = 0i..100;
1812-
while let Some(i) = iter.next() {
1808+
for i in 0i..100 {
18131809
deq.push_front(i);
18141810
}
18151811
deq.head = 0;

src/libcollections/vec.rs

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1567,9 +1567,7 @@ impl<T> Drop for Vec<T> {
15671567
// zeroed (when moving out, because of #[unsafe_no_drop_flag]).
15681568
if self.cap != 0 {
15691569
unsafe {
1570-
// FIXME(#21245) use a for loop
1571-
let mut iter = self.iter();
1572-
while let Some(x) = iter.next() {
1570+
for x in self.iter() {
15731571
ptr::read(x);
15741572
}
15751573
dealloc(*self.ptr, self.cap)

src/librustc/middle/dataflow.rs

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -352,9 +352,7 @@ impl<'a, 'tcx, O:DataFlowOperator> DataFlowContext<'a, 'tcx, O> {
352352
for (word_index, &word) in words.iter().enumerate() {
353353
if word != 0 {
354354
let base_index = word_index * uint::BITS;
355-
// FIXME(#21245) use a for loop
356-
let mut iter = 0u..uint::BITS;
357-
while let Some(offset) = iter.next() {
355+
for offset in 0u..uint::BITS {
358356
let bit = 1 << offset;
359357
if (word & bit) != 0 {
360358
// NB: we round up the total number of bits

src/libserialize/collection_impls.rs

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -148,9 +148,7 @@ impl<
148148
fn decode<D: Decoder>(d: &mut D) -> Result<EnumSet<T>, D::Error> {
149149
let bits = try!(d.read_uint());
150150
let mut set = EnumSet::new();
151-
// FIXME(#21245) use a for loop
152-
let mut iter = 0..uint::BITS;
153-
while let Some(bit) = iter.next() {
151+
for bit in 0..uint::BITS {
154152
if bits & (1 << bit) != 0 {
155153
set.insert(CLike::from_uint(1 << bit));
156154
}

src/libstd/ascii.rs

Lines changed: 1 addition & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -232,10 +232,7 @@ pub fn escape_default<F>(c: u8, mut f: F) where
232232
_ => {
233233
f(b'\\');
234234
f(b'x');
235-
// FIXME(#21245) use a for loop
236-
let arr = [4u, 0u];
237-
let mut iter = arr.iter();
238-
while let ::option::Option::Some(&offset) = ::iter::Iterator::next(&mut iter) {
235+
for &offset in [4u, 0u].iter() {
239236
match ((c as i32) >> offset) & 0xf {
240237
i @ 0 ... 9 => f(b'0' + (i as u8)),
241238
i => f(b'a' + (i as u8 - 10)),

src/libstd/rand/os.rs

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -404,9 +404,7 @@ mod test {
404404
}
405405

406406
// start all the tasks
407-
// FIXME(#21245) use a for loop
408-
let mut iter = txs.iter();
409-
while let Some(tx) = iter.next() {
407+
for tx in txs.iter() {
410408
tx.send(()).unwrap();
411409
}
412410
}

src/libstd/sync/mpsc/mod.rs

Lines changed: 2 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1476,9 +1476,7 @@ mod test {
14761476

14771477
let _t = Thread::spawn(move|| {
14781478
let mut count = 0;
1479-
// FIXME(#21245) use a for loop
1480-
let mut iter = rx.iter();
1481-
while let Some(x) = iter.next() {
1479+
for x in rx.iter() {
14821480
if count >= 3 {
14831481
break;
14841482
} else {
@@ -1942,9 +1940,7 @@ mod sync_tests {
19421940

19431941
let _t = Thread::spawn(move|| {
19441942
let mut count = 0;
1945-
// FIXME(#21245) use a for loop
1946-
let mut iter = rx.iter();
1947-
while let Some(x) = iter.next() {
1943+
for x in rx.iter() {
19481944
if count >= 3 {
19491945
break;
19501946
} else {

src/libstd/sync/mpsc/mpsc_queue.rs

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -185,9 +185,7 @@ mod tests {
185185
let tx = tx.clone();
186186
let q = q.clone();
187187
Thread::spawn(move|| {
188-
// FIXME(#21245) use a for loop
189-
let mut iter = 0..nmsgs;
190-
while let Some(i) = iter.next() {
188+
for i in 0..nmsgs {
191189
q.push(i);
192190
}
193191
tx.send(()).unwrap();

src/libsyntax/fold.rs

Lines changed: 4 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -37,14 +37,10 @@ pub trait MoveMap<T> {
3737

3838
impl<T> MoveMap<T> for Vec<T> {
3939
fn move_map<F>(mut self, mut f: F) -> Vec<T> where F: FnMut(T) -> T {
40-
// FIXME(#21245) use a for loop
41-
{
42-
let mut iter = self.iter_mut();
43-
while let Some(p) = iter.next() {
44-
unsafe {
45-
// FIXME(#5016) this shouldn't need to zero to be safe.
46-
ptr::write(p, f(ptr::read_and_zero(p)));
47-
}
40+
for p in self.iter_mut() {
41+
unsafe {
42+
// FIXME(#5016) this shouldn't need to zero to be safe.
43+
ptr::write(p, f(ptr::read_and_zero(p)));
4844
}
4945
}
5046
self

src/test/bench/shootout-mandelbrot.rs

Lines changed: 2 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -133,9 +133,7 @@ fn mandelbrot<W: old_io::Writer>(w: uint, mut out: W) -> old_io::IoResult<()> {
133133
(i + 1) * chunk_size
134134
};
135135

136-
// FIXME(#21245) use a for loop
137-
let mut iter = vec_init_i[start..end].iter();
138-
while let Some(&init_i) = iter.next() {
136+
for &init_i in vec_init_i[start..end].iter() {
139137
write_line(init_i, init_r_slice, &mut res);
140138
}
141139

@@ -144,9 +142,7 @@ fn mandelbrot<W: old_io::Writer>(w: uint, mut out: W) -> old_io::IoResult<()> {
144142
}).collect::<Vec<_>>();
145143

146144
try!(writeln!(&mut out as &mut Writer, "P4\n{} {}", w, h));
147-
// FIXME(#21245) use a for loop
148-
let mut iter = data.into_iter();
149-
while let Some(res) = iter.next() {
145+
for res in data.into_iter() {
150146
try!(out.write(res.join().ok().unwrap().as_slice()));
151147
}
152148
out.flush()

src/test/bench/shootout-meteor.rs

Lines changed: 2 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -180,9 +180,7 @@ fn make_masks() -> Vec<Vec<Vec<u64> > > {
180180
// all unused piece can be placed on the board.
181181
fn is_board_unfeasible(board: u64, masks: &Vec<Vec<Vec<u64>>>) -> bool {
182182
let mut coverable = board;
183-
// FIXME(#21245) use a for loop
184-
let mut iter = masks.iter().enumerate();
185-
while let Some((i, masks_at)) = iter.next() {
183+
for (i, masks_at) in masks.iter().enumerate() {
186184
if board & 1 << i != 0 { continue; }
187185
for (cur_id, pos_masks) in masks_at.iter().enumerate() {
188186
if board & 1 << (50 + cur_id) != 0 { continue; }
@@ -224,9 +222,7 @@ fn to_vec(raw_sol: &List<u64>) -> Vec<u8> {
224222
let mut sol = repeat('.' as u8).take(50).collect::<Vec<_>>();
225223
for &m in raw_sol.iter() {
226224
let id = '0' as u8 + get_id(m);
227-
// FIXME(#21245) use a for loop
228-
let mut iter = 0u..50;
229-
while let Some(i) = iter.next() {
225+
for i in 0u..50 {
230226
if m & 1 << i != 0 {
231227
sol[i] = id;
232228
}

0 commit comments

Comments
 (0)