diff options
| author | bors <bors@rust-lang.org> | 2013-04-28 19:36:36 -0700 |
|---|---|---|
| committer | bors <bors@rust-lang.org> | 2013-04-28 19:36:36 -0700 |
| commit | 7b7a0fc235cd2e0782302cd6fb83634e190b15b7 (patch) | |
| tree | c4d6aedddc64db81f6ada877e9ec585cf981d2d9 /src/libstd/priority_queue.rs | |
| parent | 9f03d45c56b37b36912c16bd5b4fb4723fd91cb7 (diff) | |
| parent | 46f91a0fa95cd13f7433a1d72d087283f483a4b8 (diff) | |
| download | rust-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/priority_queue.rs')
| -rw-r--r-- | src/libstd/priority_queue.rs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/libstd/priority_queue.rs b/src/libstd/priority_queue.rs index 08a58125d7e..60f25c2a270 100644 --- a/src/libstd/priority_queue.rs +++ b/src/libstd/priority_queue.rs @@ -10,7 +10,7 @@ //! A priority queue implemented with a binary heap -use core::iter::BaseIter; +use core::old_iter::BaseIter; use core::ptr::addr_of; #[abi = "rust-intrinsic"] |