Josh Stone 61a7703e55 Customize <FlatMap as Iterator>::fold ...

`FlatMap` can use internal iteration for its `fold`, which shows a
performance advantage in the new benchmarks:

    test iter::bench_flat_map_chain_ref_sum ... bench:   4,354,111 ns/iter (+/- 108,871)
    test iter::bench_flat_map_chain_sum     ... bench:     468,167 ns/iter (+/- 2,274)
    test iter::bench_flat_map_ref_sum       ... bench:     449,616 ns/iter (+/- 6,257)
    test iter::bench_flat_map_sum           ... bench:     348,010 ns/iter (+/- 1,227)

... where the "ref" benches are using `by_ref()` that isn't optimized.
So this change shows a decent advantage on its own, but much more when
combined with a `chain` iterator that also optimizes `fold`.

2017-09-14 13:51:32 -07:00

..

iterator.rs

Minor Iterator::filter_map description rewording.

2017-08-18 21:19:30 -04:00

mod.rs

Customize <FlatMap as Iterator>::fold

2017-09-14 13:51:32 -07:00

range.rs

Add an overflow check in the Iter::next() impl for Range<_>

2017-08-01 19:31:50 +02:00

sources.rs

Remove function invokation parens from documentation links.

2017-03-13 21:43:18 -04:00

traits.rs

use field init shorthand EVERYWHERE

2017-08-15 15:29:17 -07:00