| commit | d7c65f3dc39d5876237e3d3e9aa326a0bfbc5826 | [log] [tgz] |
|---|---|---|
| author | David LeGare <[email protected]> | Fri Mar 04 21:38:04 2022 +0000 |
| committer | Automerger Merge Worker <[email protected]> | Fri Mar 04 21:38:04 2022 +0000 |
| tree | d7d800f84b0d4ccd703059529235b632ba6bc92c | |
| parent | 49f788bc75f2165c276fb98e9aacb38e3d3d4de0 [diff] | |
| parent | 0c1f919fd338a10642e2a13a31635febc81f023f [diff] |
Update TEST_MAPPING am: 0c1f919fd3 Original change: https://android-review.googlesource.com/c/platform/external/rust/crates/itertools/+/2006352 Change-Id: Ie2f418b6b9c17ac02688809af80f421f78cdd337
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.