| commit | b58fb8096f3799db80761f1448772fa6fd952eee | [log] [tgz] |
|---|---|---|
| author | Android Build Coastguard Worker <[email protected]> | Thu Aug 25 07:53:32 2022 +0000 |
| committer | Android Build Coastguard Worker <[email protected]> | Thu Aug 25 07:53:32 2022 +0000 |
| tree | d7d800f84b0d4ccd703059529235b632ba6bc92c | |
| parent | 4b65a2bbffb735294c5fa51a3d3089ca0c151c58 [diff] | |
| parent | fa1af4a035e6372f2bbbe1e1bec48df176a47a42 [diff] |
Snap for 8992082 from fa1af4a035e6372f2bbbe1e1bec48df176a47a42 to gki13-boot-release Change-Id: I3bb3329f827b77a7623ec9cd33811f1a99506f93
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.