commit | be203ff0d43d8721464e2655bb3ea4a5a6f0bb45 | [log] [tgz] |
---|---|---|
author | Jeff Vander Stoep <[email protected]> | Tue Jan 31 19:29:03 2023 +0000 |
committer | Automerger Merge Worker <[email protected]> | Tue Jan 31 19:29:03 2023 +0000 |
tree | 6634ac30dc6636eb209a3c7dcc701beb7766cebe | |
parent | 5a03ba3cb246bc0cc1d8514e1323a0426304ad1d [diff] | |
parent | 5871dbacf11e0590f9e7b1289995d43b4fe58b0b [diff] |
Update TEST_MAPPING am: 06b31b1da2 am: 5871dbacf1 Original change: https://android-review.googlesource.com/c/platform/external/rust/crates/itertools/+/2411596 Change-Id: I4e91f08df066a1ce4bc6c791579e00d0a9def77d 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.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.