| commit | f13249284dc938ceb35100a70f75316e03c5b2ad | [log] [tgz] |
|---|---|---|
| author | Android Build Coastguard Worker <[email protected]> | Wed Sep 11 23:28:21 2024 +0000 |
| committer | Android Build Coastguard Worker <[email protected]> | Wed Sep 11 23:28:21 2024 +0000 |
| tree | 43f28f10d8ed3b8be61b44f2d57f00a162feaeec | |
| parent | 3fb2cfabcc1dfc897c7541201501584c1d696896 [diff] | |
| parent | a6c6d18e2bf87ab642356e12dcae5014ffc0b70a [diff] |
Snap for 12355814 from a6c6d18e2bf87ab642356e12dcae5014ffc0b70a to build-tools-release Change-Id: I20e8877a873e53d9d070cd6dc74244c0057880d3
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.