| commit | dcecdd19374200dc918902e78323a58b5ee0e824 | [log] [tgz] |
|---|---|---|
| author | Android Build Coastguard Worker <[email protected]> | Fri Jul 07 01:19:25 2023 +0000 |
| committer | Android Build Coastguard Worker <[email protected]> | Fri Jul 07 01:19:25 2023 +0000 |
| tree | 8f35d3645086169c660d74ad03160565694afc51 | |
| parent | 937ca32a7ee113aadc37af12b0bdb8c4fd8235d7 [diff] | |
| parent | cacbffa61ab459e4c3f2caf4bfd4208641a0b0fb [diff] |
Snap for 10447354 from cacbffa61ab459e4c3f2caf4bfd4208641a0b0fb to mainline-networking-release Change-Id: I4467ee482c1dad082a544e6c1a0b40a71443a62e
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.