| commit | b4b582887743ac7c6865b7fe92e2f9f4460580be | [log] [tgz] |
|---|---|---|
| author | Android Build Coastguard Worker <[email protected]> | Tue Aug 06 23:13:03 2024 +0000 |
| committer | Android Build Coastguard Worker <[email protected]> | Tue Aug 06 23:13:03 2024 +0000 |
| tree | b08036ada8f44321e21f955b96c19d3056220af2 | |
| parent | 46145897e455e1983940f6f6d7cdc5e25e4e6297 [diff] | |
| parent | 49862f938fbf98784fc96a149fa98af834013341 [diff] |
Snap for 12190349 from 49862f938fbf98784fc96a149fa98af834013341 to 24Q4-release Change-Id: Ifa3b3314701ffedebb51676fc7d5e6dbeb700a11
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.