| commit | 887990804496a429b3adc1834bb4b30d30a131ec | [log] [tgz] |
|---|---|---|
| author | James Farrell <[email protected]> | Tue Aug 27 22:36:38 2024 +0000 |
| committer | James Farrell <[email protected]> | Tue Aug 27 22:36:38 2024 +0000 |
| tree | 43f28f10d8ed3b8be61b44f2d57f00a162feaeec | |
| parent | d0eb1075ea5eef639b500fd1d866f9b196583c40 [diff] |
Migrate 25 crates to monorepo. bytemuck_derive hashlink httparse http-body httpdate idna instant intrusive-collections itertools jni-sys lazy_static libc libloading linked-hash-map linkme litrs lock_api log lru-cache lz4_flex macaddr managed maybe-async memchr memoffset Bug: 339424309 Test: treehugger Change-Id: I981cfe767e8f3040fac476087618b7c0d5e556e0
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.