Orson Peters
Orson Peters
So I have a working implementation of the above idea here: . It makes this compile: ```rust fn main() { let line = "32 -12 24"; let nums = line.split_whitespace().map(|n|...
@phimuemue Any update on this?
@phimuemue Just for posterity's sake, `version-check` would be a `build-dependency`, not `dev-dependency`.
@phimuemue Just checking in what the status is, I feel very strongly about the usefulness of `collect_array`. I miss it very often in `itertools`.
If this has a good chance of being accepted I'm willing to make a pull request for this feature.
Am I understanding it correctly that there's a bug in the current implementation? https://github.com/rust-itertools/itertools/blob/master/src/k_smallest.rs#L10 This assumes the iterator is a `FusedIterator`, does it not? I think we need to call...
Looking at it, I don't see a way we could implement this using `std::collections::BinaryHeap`, if we don't wish to duplicate the comparison function `k` times (and probably destroy inlining). I'm...
I have two suggestions, and one remark. 1. Replace `usize` with `u32` in `VacantEntry`, 64-bits is way overkill. In the most generous case where people are for some reason only...
I scrap my previous remark of it being unavoidable - you can have a counter incrementing on each insert, and changing the data layout to store that counter with each...
I've implemented the ideas I talked about above in the new crate [`slotmap`](https://docs.rs/slotmap/).