| commit | d9bdf533b8340517760da97b52a522420b6f2d88 | [log] [tgz] |
|---|---|---|
| author | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Sat Mar 05 04:05:33 2022 +0000 |
| committer | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Sat Mar 05 04:05:33 2022 +0000 |
| tree | 0ca62eb5d0beeab0cb7ee3c0db8111e81788c2cd | |
| parent | 2d1debf24edf46750dcd0ea8be9dd0c77469dd43 [diff] | |
| parent | 3e702301659e7c42649e5c896a1bd9397e0e9b10 [diff] |
Snap for 8254899 from 3e702301659e7c42649e5c896a1bd9397e0e9b10 to tm-d1-release Change-Id: I59335f2a670a57bfe262a4083b8b9ae8e52177ae
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.