| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2014-01-08 | Renamed Option::map_default and mutate_default to map_or and mutate_or_set | Marvin Löbel | -2/+2 | |
| 2013-12-27 | Renamed ClonableIterator to CloneableIterator | Alexandros Tasos | -4/+4 | |
| 2013-12-23 | std: Fix all code examples | Alex Crichton | -19/+27 | |
| 2013-12-20 | Implement size_hint() for ByRef iterator | Palmer Cox | -1/+2 | |
| 2013-12-15 | std: fix spelling in docs. | Huon Wilson | -2/+2 | |
| 2013-12-11 | Make 'self lifetime illegal. | Erik Price | -50/+50 | |
| Also remove all instances of 'self within the codebase. This fixes #10889. | ||||
| 2013-12-08 | Remove dead codes | Kiet Tran | -1/+1 | |
| 2013-11-26 | test: Remove non-procedure uses of `do` from compiletest, libstd tests, | Patrick Walton | -2/+2 | |
| compile-fail tests, run-fail tests, and run-pass tests. | ||||
| 2013-11-26 | librustc: Remove remaining uses of `&fn()` in favor of `||`. | Patrick Walton | -19/+19 | |
| 2013-11-19 | libstd: Change all uses of `&fn(A)->B` over to `|A|->B` in libstd | Patrick Walton | -10/+10 | |
| 2013-11-17 | Fixed docs for advance() in Iterator trait | Andrei Formiga | -6/+3 | |
| 2013-11-17 | Fixed uses of get() to unwrap() in doc examples in std::iter | Andrei Formiga | -28/+28 | |
| 2013-11-11 | Implement `size_hint` for Range | Corey Richardson | -8/+80 | |
| Closes #8606 | ||||
| 2013-10-23 | Removed unnecessary comments and white spaces as suggested | reedlepee | -27/+1 | |
| 2013-10-23 | Removed Unnecessary comments and white spaces #4386 | reedlepee | -2/+0 | |
| 2013-10-23 | Making fields in std and extra : private #4386 | reedlepee | -3/+31 | |
| 2013-10-22 | Drop the '2' suffix from logging macros | Alex Crichton | -6/+6 | |
| Who doesn't like a massive renaming? | ||||
| 2013-10-16 | auto merge of #9634 : blake2-ppc/rust/by-ref-iter, r=thestinger | bors | -0/+44 | |
| std::iter: Introduce .by_ref() adaptor Creates a wrapper around a mutable reference to the iterator. This is useful to allow applying iterator adaptors while still retaining ownership of the original iterator value. Example:: let mut xs = range(0, 10); // sum the first five values let partial_sum = xs.by_ref().take(5).fold(0, |a, b| a + b); assert!(partial_sum == 10); // xs.next() is now `5` assert!(xs.next() == Some(5)); --- This adaptor requires the user to have good understanding of iterators or what a particular adaptor does. There could be some pitfalls here with the iterator protocol, it's mostly the same issues as other places regarding what happens after the iterator returns None for the first time. There could also be other ways to achieve the same thing, for example Implementing iterator on `&mut T` itself: `impl <T: Iterator<..>> Iterator for &mut T` but that would only lead to confusion I think. | ||||
| 2013-10-09 | option: rewrite the API to use composition | Daniel Micay | -8/+8 | |
| 2013-10-02 | auto merge of #9665 : alexcrichton/rust/snapshot, r=brson | bors | -4/+4 | |
| Uses the new snapshots to kill the old `loop` and introduce the new `continue`. | ||||
| 2013-10-01 | Migrate users of 'loop' to 'continue' | Alex Crichton | -4/+4 | |
| Closes #9467 | ||||
| 2013-10-01 | remove the `float` type | Daniel Micay | -3/+3 | |
| It is simply defined as `f64` across every platform right now. A use case hasn't been presented for a `float` type defined as the highest precision floating point type implemented in hardware on the platform. Performance-wise, using the smallest precision correct for the use case greatly saves on cache space and allows for fitting more numbers into SSE/AVX registers. If there was a use case, this could be implemented as simply a type alias or a struct thanks to `#[cfg(...)]`. Closes #6592 The mailing list thread, for reference: https://mail.mozilla.org/pipermail/rust-dev/2013-July/004632.html | ||||
| 2013-09-30 | std: Remove usage of fmt! | Alex Crichton | -6/+6 | |
| 2013-09-30 | std::iter: Introduce .by_ref() adaptor | blake2-ppc | -0/+44 | |
| Creates a wrapper around a mutable reference to the iterator. This is useful to allow applying iterator adaptors while still retaining ownership of the original iterator value. Example:: let mut xs = range(0, 10); // sum the first five values let partial_sum = xs.by_ref().take(5).fold(0, |a, b| a + b); assert!(partial_sum == 10); // xs.next() is now `5` assert!(xs.next() == Some(5)); | ||||
| 2013-09-26 | Update the compiler to not use printf/printfln | Alex Crichton | -1/+1 | |
| 2013-09-25 | rustdoc: Change all code-blocks with a script | Alex Crichton | -64/+64 | |
| find src -name '*.rs' | xargs sed -i '' 's/~~~.*{\.rust}/```rust/g' find src -name '*.rs' | xargs sed -i '' 's/ ~~~$/ ```/g' find src -name '*.rs' | xargs sed -i '' 's/^~~~$/ ```/g' | ||||
| 2013-09-17 | Document a few undocumented modules in libstd | Alex Crichton | -4/+51 | |
| Hopefull this will make our libstd docs appear a little more "full". | ||||
| 2013-09-15 | iter: add the edge case tests for `range` too | Daniel Micay | -0/+10 | |
| 2013-09-15 | iter: fix `RangeInclusive`'s `DoubleEndedIterator` | Daniel Micay | -3/+5 | |
| 2013-09-15 | iter: fix `range_inclusive` when `start > stop` | Daniel Micay | -4/+10 | |
| 2013-09-15 | fix range_step{,_inclusive} with negative step | Daniel Micay | -16/+10 | |
| 2013-09-14 | iter: add `RangeStep` and `RangeStepInclusive` | Daniel Micay | -1/+90 | |
| 2013-09-14 | iter: move Counter impl to the proper place | Daniel Micay | -14/+14 | |
| 2013-09-14 | iter: replace comment with a docstring | Daniel Micay | -5/+3 | |
| 2013-09-14 | iter: fix range docstrings | Daniel Micay | -2/+2 | |
| 2013-09-12 | std: Restore Option::chain{,_mut}_ref as and_then{,_mut}_ref | Erick Tryzelaar | -12/+2 | |
| 2013-09-12 | std: Rename {Option,Result}::chain{,_err}* to {and_then,or_else} | Erick Tryzelaar | -5/+14 | |
| 2013-09-09 | rename `std::iterator` to `std::iter` | Daniel Micay | -0/+2659 | |
| The trait will keep the `Iterator` naming, but a more concise module name makes using the free functions less verbose. The module will define iterables in addition to iterators, as it deals with iteration in general. | ||||
| 2013-08-29 | Remove the iter module. | Jason Fager | -26/+0 | |
| Moves the Times trait to num while the question of whether it should exist at all gets hashed out as a completely separate question. | ||||
| 2013-08-01 | std: Change `Times` trait to use `do` instead of `for` | blake2-ppc | -2/+2 | |
| Change the former repetition:: for 5.times { } to:: do 5.times { } .times() cannot be broken with `break` or `return` anymore; for those cases, use a numerical range loop instead. | ||||
| 2013-07-01 | Move most iter functionality to extra, fixes #7343 | Jordi Boggiano | -302/+5 | |
| 2013-06-23 | vec: remove BaseIter implementation | Daniel Micay | -18/+18 | |
| I removed the `static-method-test.rs` test because it was heavily based on `BaseIter` and there are plenty of other more complex uses of static methods anyway. | ||||
| 2013-06-18 | replace #[inline(always)] with #[inline]. r=burningtree. | Graydon Hoare | -5/+5 | |
| 2013-06-14 | add IteratorUtil to the prelude | Daniel Micay | -2/+0 | |
| 2013-06-09 | remove unused import warnings | Huon Wilson | -1/+0 | |
| 2013-06-06 | Fixups | Marvin Löbel | -11/+1 | |
| 2013-06-06 | Removed IteratorUtil::to_vec and iter::to_vec | Marvin Löbel | -33/+11 | |
| 2013-06-06 | Added iter::FromIter | Marvin Löbel | -3/+31 | |
| 2013-05-30 | Require documentation by default for libstd | Alex Crichton | -0/+1 | |
| Adds documentation for various things that I understand. Adds #[allow(missing_doc)] for lots of things that I don't understand. | ||||
| 2013-05-29 | librustc: Stop reexporting the standard modules from prelude. | Patrick Walton | -0/+3 | |
