commit | 436b88261e035f982767639db0cffee538ea8b61 | [log] [tgz] |
---|---|---|
author | Daniel Norman <danielnorman@google.com> | Thu Mar 17 15:56:07 2022 -0700 |
committer | Daniel Norman <danielnorman@google.com> | Thu Mar 17 15:57:51 2022 -0700 |
tree | d7d800f84b0d4ccd703059529235b632ba6bc92c | |
parent | bda5e05eda99b1e82fd93943050a654d89731d5a [diff] | |
parent | f647b302789ebf2ae473659f43c25c790d09067e [diff] |
Merge TP1A.220310.002 Change-Id: Ie9893971add5a2880ef06eb6680ecb357324786a
Extra iterator adaptors, functions and macros.
Please read the API documentation here.
How to use with Cargo:
[dependencies] itertools = "0.10.2"
How to use in your crate:
use itertools::Itertools;
For new features, please first consider filing a PR to rust-lang/rust, adding your new feature to the Iterator
trait of the standard library, if you believe it is reasonable. If it isn't accepted there, proposing it for inclusion in itertools
is a good idea. The reason for doing is this is so that we avoid future breakage as with .flatten()
. However, if your feature involves heap allocation, such as storing elements in a Vec<T>
, then it can't be accepted into libcore
, and you should propose it for itertools
directly instead.
Dual-licensed to be compatible with the Rust project.
Licensed under the Apache License, Version 2.0 https://www.apache.org/licenses/LICENSE-2.0 or the MIT license https://opensource.org/licenses/MIT, at your option. This file may not be copied, modified, or distributed except according to those terms.