| commit | 19d5a3e05d1275eae39de1824ca746efe6b5c90a | [log] [tgz] |
|---|---|---|
| author | Android Build Coastguard Worker <[email protected]> | Mon May 09 06:00:33 2022 +0000 |
| committer | Android Build Coastguard Worker <[email protected]> | Mon May 09 06:00:33 2022 +0000 |
| tree | d7d800f84b0d4ccd703059529235b632ba6bc92c | |
| parent | 1b9a5c2cb788baad4c1eff8d12939349473f6c83 [diff] | |
| parent | e02c202c4051e7f57491ef1f85dc1ed8ba820b79 [diff] |
Snap for 8558685 from e02c202c4051e7f57491ef1f85dc1ed8ba820b79 to tm-frc-ipsec-release Change-Id: Ia67455fa6f9d2c4971eaea659157eb8f4c0a6d85
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.