commit | fefdf7a2ed693ce1fd80590c4165e85fd4869111 | [log] [tgz] |
---|---|---|
author | Matthew Maurer <[email protected]> | Tue May 31 16:46:05 2022 +0000 |
committer | Automerger Merge Worker <[email protected]> | Tue May 31 16:46:05 2022 +0000 |
tree | 2c8ef6f18e504a73099ebefc95785ef3b5faa604 | |
parent | e02c202c4051e7f57491ef1f85dc1ed8ba820b79 [diff] | |
parent | 275b267e11607f6277e4e01aca30edc9aa6a0069 [diff] |
Update TEST_MAPPING am: 106df73fd0 am: 275b267e11 Original change: https://android-review.googlesource.com/c/platform/external/rust/crates/itertools/+/2108493 Change-Id: I3507c769ba6743136ba0f602f8d69716829aaa6f 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.