rust - https://github.com/rust-lang/rust

Age	Commit message (Collapse)	Author	Lines
2013-08-12	auto merge of #8400 : blake2-ppc/rust/seq-ord, r=cmr	bors	-0/+157
	Use Eq + Ord for lexicographical ordering of sequences. For each of <, <=, >= or > as R, use:: [x, ..xs] R [y, ..ys] = if x != y { x R y } else { xs R ys } Previous code using `a < b` and then `!(b < a)` for short-circuiting fails on cases such as [1.0, 2.0] < [0.0/0.0, 3.0], where the first element was effectively considered equal. Containers like &[T] did also implement only one comparison operator `<`, and derived the comparison results from this. This isn't correct either for Ord. Implement functions in `std::iterator::order::{lt,le,gt,ge,equal,cmp}` that all iterable containers can use for lexical order. We also visit tuple ordering, having the same problem and same solution (but differing implementation).
2013-08-11	Add a "peekable" iterator adaptor, with a peek() method that returns the ↵	Simon Sapin	-0/+72
	next element.
2013-08-11	std::iterator: Rename .peek() to .inspect()	blake2-ppc	-19/+20

2013-08-10	std: Transform.find_ -> .find	Erick Tryzelaar	-4/+4

2013-08-10	std: Iterator.len_ -> .len	Erick Tryzelaar	-7/+6

2013-08-10	std: Iterator.last_ -> .last	Erick Tryzelaar	-4/+3

2013-08-10	std: Iterator.chain_ -> .chain	Erick Tryzelaar	-8/+8

2013-08-10	std: Iterator.flat_map_ -> .flat_map	Erick Tryzelaar	-5/+4

2013-08-10	std: Iterator.take_ -> .take	Erick Tryzelaar	-29/+27

2013-08-10	std: Rename Iterator.transform -> .map	Erick Tryzelaar	-31/+30
	cc #5898
2013-08-10	std: merge Iterator and IteratorUtil	Erick Tryzelaar	-268/+192

2013-08-10	std: merge iterator::DoubleEndedIterator and DoubleEndedIteratorUtil	Erick Tryzelaar	-26/+13

2013-08-08	std::iterator::order test cases	blake2-ppc	-0/+47

2013-08-08	Add std::iterator::order with lexical ordering functions for sequences	blake2-ppc	-0/+110
	Use Eq + Ord for lexicographical ordering of sequences. For each of <, <=, >= or > as R, use:: [x, ..xs] R [y, ..ys] = if x != y { x R y } else { xs R ys } Previous code using `a < b` and then `!(b < a)` for short-circuiting fails on cases such as [1.0, 2.0] < [0.0/0.0, 3.0], where the first element was effectively considered equal.
2013-08-07	Implement DoubleEndedIterator on Range	Kevin Ballard	-3/+32
	Range is now invertable as long as its element type conforms to Integer. Remove int::range_rev() et al in favor of range().invert().
2013-08-07	auto merge of #8294 : erickt/rust/map-move, r=bblum	bors	-4/+4
	According to #7887, we've decided to use the syntax of `fn map<U>(f: &fn(&T) -> U) -> U`, which passes a reference to the closure, and to `fn map_move<U>(f: &fn(T) -> U) -> U` which moves the value into the closure. This PR adds these `.map_move()` functions to `Option` and `Result`. In addition, it has these other minor features: * Replaces a couple uses of `option.get()`, `result.get()`, and `result.get_err()` with `option.unwrap()`, `result.unwrap()`, and `result.unwrap_err()`. (See #8268 and #8288 for a more thorough adaptation of this functionality. * Removes `option.take_map()` and `option.take_map_default()`. These two functions can be easily written as `.take().map_move(...)`. * Adds a better error message to `result.unwrap()` and `result.unwrap_err()`.
2013-08-07	auto merge of #8326 : thestinger/rust/iterator, r=alexcrichton	bors	-19/+16
	The `extra::iter` module wasn't actually included in `extra.rs` when it was moved from `std`... I assume no one is going to miss it.
2013-08-07	core: option.map_consume -> option.map_move	Erick Tryzelaar	-4/+4

2013-08-07	auto merge of #8323 : kballard/rust/saturating, r=thestinger	bors	-25/+10
	Implement saturating math in `std::num::Saturating` and use it for `Iterator` impls
2013-08-06	iterator: rename `Counter::new` to `count`	Daniel Micay	-17/+15
	to match the convention used by `range`, since `iterator::count` is already namespaced enough and won't be ambiguous
2013-08-06	iterator: simplify the `take` implementation	Daniel Micay	-2/+1

2013-08-05	Update Iterator impls to use Saturating	Kevin Ballard	-25/+10
	Replace hand-rolled saturation math with calls to Saturating. Fix one impl that didn't use saturating math.
2013-08-06	std: Improve the documentation for iterator::Invert	blake2-ppc	-0/+11

2013-08-06	std: Add iterator::Repeat to repeat an element endlessly	blake2-ppc	-0/+33

2013-08-06	std: Implement RandomAccessIterator for Invert	blake2-ppc	-0/+21

2013-08-03	remove obsolete `foreach` keyword	Daniel Micay	-28/+28
	this has been replaced by `for`
2013-08-02	replace `range` with an external iterator	Daniel Micay	-4/+32

2013-08-01	std: Change `Times` trait to use `do` instead of `for`	blake2-ppc	-3/+3
	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-08-01	migrate many `for` loops to `foreach`	Daniel Micay	-27/+27

2013-07-30	std: Tests for RandomAccessIterators	blake2-ppc	-0/+87

2013-07-30	std: Implement RandomAccessIterator for iterator adaptors	blake2-ppc	-18/+142
	Implement RAI where possible for iterator adaptors such as Map, Enumerate, Skip, Take, Zip, Cycle (all of the requiring that the adapted iterator also implements RAI).
2013-07-30	iterator: implement size_hint() for FlatMap	blake2-ppc	-0/+10

2013-07-30	iterator: implement DoubleEndedIterator for FlatMap	blake2-ppc	-5/+44

2013-07-29	std: Rename Iterator adaptor types to drop the -Iterator suffix	blake2-ppc	-89/+89
	Drop the "Iterator" suffix for the the structs in std::iterator. Filter, Zip, Chain etc. are shorter type names for when iterator pipelines need their types written out in full in return value types, so it's easier to read and write. the iterator module already forms enough namespace.
2013-07-27	iterator: add an Extendable trait	Daniel Micay	-0/+6

2013-07-27	Remove dummy type parameters from iterator adaptors	blake2-ppc	-47/+39
	With the recent fixes to method resolution, we can now remove the dummy type parameters used as crutches in the iterator module. For example, the zip adaptor type is just ZipIterator<T, U> now.
2013-07-27	make RandomAccessIterator inherit from Iterator	Daniel Micay	-2/+4

2013-07-25	auto merge of #8030 : thestinger/rust/iterator, r=huonw	bors	-2/+0

2013-07-25	auto merge of #8015 : msullivan/rust/default-methods, r=nikomatsakis	bors	-1/+18
	Lots of changes to vtable resolution, handling of super/self method calls in default methods. Fix a lot of trait inheritance bugs. r? @nikomatsakis
2013-07-24	rm default method lint	Daniel Micay	-2/+0
	default methods are enabled by default, so there's not much point in keeping around a lint to report them as being experimental
2013-07-24	Change 'print(fmt!(...))' to printf!/printfln! in src/lib*	Birunthan Mohanathas	-1/+1

2013-07-24	add a RandomAccessIterator trait	Daniel Micay	-0/+53

2013-07-23	Fix some impls such that all supertraits are actually implemented.	Michael Sullivan	-1/+1

2013-07-23	Add a to_owned_vec method to IteratorUtil.	Michael Sullivan	-0/+17

2013-07-20	iterator: Add test for .cycle()	blake2-ppc	-0/+14

2013-07-20	iterator: Let closure-less iterators derive Clone	blake2-ppc	-0/+8

2013-07-20	iterator: Add .cycle() to repeat an iterator	blake2-ppc	-0/+49

2013-07-19	iterator: impl DoubleEndedIterator for adaptors	Daniel Micay	-0/+121

2013-07-11	Take default methods out from behind the flag.	Michael Sullivan	-1/+1

2013-07-11	iterator: add DoubleEndedIterator concept	Daniel Micay	-0/+52
	This implements the trait for vector iterators, replacing the reverse iterator types. The methods will stay, for implementing the future reverse Iterable traits and convenience. This can also be trivially implemented for circular buffers and other variants of arrays like strings and `SmallIntMap`/`SmallIntSet`. The `DoubleEndedIterator` trait will allow for implementing algorithms like in-place reverse on generic mutable iterators. The naming (`Range` vs. `Iterator`, `Bidirectional` vs. `DoubleEnded`) can be bikeshedded in the future.