| commit | c2a02b18753ccdca4e9b3002277e7870f0fe8584 | [log] [tgz] |
|---|---|---|
| author | Android Build Coastguard Worker <[email protected]> | Thu Feb 02 05:15:02 2023 +0000 |
| committer | Android Build Coastguard Worker <[email protected]> | Thu Feb 02 05:15:02 2023 +0000 |
| tree | 6634ac30dc6636eb209a3c7dcc701beb7766cebe | |
| parent | 68e243461a1813c3f9531c4aa68e3075b6be1e12 [diff] | |
| parent | 5dc6702447f3d7aeff80ae475c02e8be4ce907dd [diff] |
Snap for 9553927 from 5dc6702447f3d7aeff80ae475c02e8be4ce907dd to udc-d1-release Change-Id: I90d83a02471577e570cf988e401574d361581b8f
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.