about summary refs log tree commit diff
path: root/src/libstd/num
diff options
context:
space:
mode:
authorbors <bors@rust-lang.org>2013-04-28 19:36:36 -0700
committerbors <bors@rust-lang.org>2013-04-28 19:36:36 -0700
commit7b7a0fc235cd2e0782302cd6fb83634e190b15b7 (patch)
treec4d6aedddc64db81f6ada877e9ec585cf981d2d9 /src/libstd/num
parent9f03d45c56b37b36912c16bd5b4fb4723fd91cb7 (diff)
parent46f91a0fa95cd13f7433a1d72d087283f483a4b8 (diff)
downloadrust-7b7a0fc235cd2e0782302cd6fb83634e190b15b7.tar.gz
rust-7b7a0fc235cd2e0782302cd6fb83634e190b15b7.zip
auto merge of #6056 : thestinger/rust/iter, r=catamorphism
The existing adaptors like `map` in the `iter` module are very flawed because they only work for `BaseIter` implementations. There are many internal iterator implementations in the standard library like the set methods (`difference`, `symmetric_difference`, `intersection`, `union`) and the `range` functions that only share the `for` loop protocol in common.

The internal iterator adaptors should be implemented to work on any implementation of that protocol, rather than just a method called `each` taking `&self`.

This just moves `iter.rs` to `old_iter.rs` and begins work on documenting and implementing a nicer module.
Diffstat (limited to 'src/libstd/num')
0 files changed, 0 insertions, 0 deletions