| commit | d4c3e1b1ebde0ee12bac1e5437d295a1659b548a | [log] [tgz] |
|---|---|---|
| author | Android Build Coastguard Worker <[email protected]> | Thu Aug 08 01:12:47 2024 +0000 |
| committer | Android Build Coastguard Worker <[email protected]> | Thu Aug 08 01:12:47 2024 +0000 |
| tree | 599f96c7562fd3abc2b3344f62972e59fdfb7a63 | |
| parent | b4b582887743ac7c6865b7fe92e2f9f4460580be [diff] | |
| parent | 2bd018b28adbce129288370bc27d7fc683ba5199 [diff] |
Snap for 12199973 from 2bd018b28adbce129288370bc27d7fc683ba5199 to 24Q4-release Change-Id: Ia2c9b41448751f70f7c9bdfbe222c1e7737d339f
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.