| commit | 4ba3f52e9a4edd88dcaa578e9cf7f029a48e157b | [log] [tgz] |
|---|---|---|
| author | Treehugger Robot <[email protected]> | Wed Jun 15 20:10:24 2022 +0000 |
| committer | Automerger Merge Worker <[email protected]> | Wed Jun 15 20:10:24 2022 +0000 |
| tree | d7d800f84b0d4ccd703059529235b632ba6bc92c | |
| parent | 275b267e11607f6277e4e01aca30edc9aa6a0069 [diff] | |
| parent | 60cd39ee5616a730424b0c6d7d9a2fe1445a91ee [diff] |
Merge "Update TEST_MAPPING" am: 60cd39ee56 Original change: https://android-review.googlesource.com/c/platform/external/rust/crates/itertools/+/2125942 Change-Id: I11ddb7758bb9d3222c09279fc1afad098951b26d Signed-off-by: Automerger Merge Worker <[email protected]>
Extra iterator adaptors, functions and macros.
Please read the API documentation here.
How to use with Cargo:
[dependencies] itertools = "0.10.2"
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.