| commit | d562ab5643201d7f08c86a38f077bd23510e623f | [log] [tgz] |
|---|---|---|
| author | Android Build Coastguard Worker <[email protected]> | Tue Aug 20 17:57:06 2024 +0000 |
| committer | Android Build Coastguard Worker <[email protected]> | Tue Aug 20 17:57:06 2024 +0000 |
| tree | 599f96c7562fd3abc2b3344f62972e59fdfb7a63 | |
| parent | 0a12420ab2cb5faaeb5372759e10f94919d6a72f [diff] | |
| parent | d0eb1075ea5eef639b500fd1d866f9b196583c40 [diff] |
Snap for 12252487 from d0eb1075ea5eef639b500fd1d866f9b196583c40 to simpleperf-release Change-Id: Ifd55cc6d0fda365eb705a877b11bcfa1cf5e7fc7
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.