| commit | c6f9dc8ae7a0e02932432cb1e9c556ec345445cd | [log] [tgz] |
|---|---|---|
| author | Android Build Coastguard Worker <[email protected]> | Tue Dec 13 04:17:06 2022 +0000 |
| committer | Android Build Coastguard Worker <[email protected]> | Tue Dec 13 04:17:06 2022 +0000 |
| tree | 8e0a28233ae31fcd4f59965958c208c3cbb61ee4 | |
| parent | a6da63b72585221425b153c4fe82ee21d949bb5a [diff] | |
| parent | 24d8819288d38db197610f3872f14dea3f3d2305 [diff] |
Snap for 9397200 from 24d8819288d38db197610f3872f14dea3f3d2305 to udc-release Change-Id: I83a21eafc7d367a62eaf387fd0643e86f77b63b7
Extra iterator adaptors, functions and macros.
Please read the API documentation here.
How to use with Cargo:
[dependencies] itertools = "0.10.5"
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.