Unzip an iterator to iterators
Procedural macro to generate `unzip` for iterators over n-sized tuples
Unzip iterators into tuples of arbitrary length, surpassing the limitations of `Iterator::unzip` and `itertools::multiunzip`.
Provides a composable, declarative way to consume an iterator
Multi-reduction library. Provides a composable, declarative way to consume an iterator
Same as Iterator::unzip, but for 3 items. Based on Rust 1.6 implementation.
BK-tree datastructure
A trait for collecting values into a container which has an invariant to uphold and whose construction may fail
This package currently provides one function that takes in an array containing tuples of two types; the function then returns two arrays, the first containing all the first elements of the tuples, and the second array containing the second elements of the tuples. This functionality is available in iterators through unzip, but unzip can only return collections which implement Extend; which primitive arrays do not. Therefore, unzip works fine for Vec or other dynamic types, but not for simple, beautiful arrays, with lengths known at compiletime. My implementation is hopefully quite efficient, as it just moves data around, without using too much costly abstractions like std::array::from_fn. This crate has 4 tests that I think cover basically everything; still it could be unsound..
Async process manager/supervisor for *nix systems
gif to ascii art converter written in rust
Optimized batching and dataloading for external services.