commit | 1409ad7bfacba3eaee9288912caca662604a8ce6 | [log] [tgz] |
---|---|---|
author | Linux Build Service Account <lnxbuild@localhost> | Tue Apr 05 09:55:34 2022 -0700 |
committer | Linux Build Service Account <lnxbuild@localhost> | Tue Apr 05 09:55:34 2022 -0700 |
tree | d7d800f84b0d4ccd703059529235b632ba6bc92c | |
parent | 1b2103ea1cf0fa5a64dc492bdbc3024294bcd32c [diff] | |
parent | d350ae8f4117dbaed9af7c3b0b497e62a90c3306 [diff] |
Merge d350ae8f4117dbaed9af7c3b0b497e62a90c3306 on remote branch Change-Id: I24551847baff7b398c0152ae5cd6ea8e7214199c
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.