Conversation
|
Yeah, having this API makes sense to me, so this would be a good addition. I haven't reviewed the PR super thoroughly yet, but I don't see at a glance why Also there seems to be a lot of infrastructure added via Also I think I'd prefer |
Yeah this is rather a prototype, I can clean it up, and also add it for the linked hash set, if you want to.
As far as i have seen, the biggest problem was that i don't have access to the Nodes in the non mutable version, it only gives me the key-value pair. I guess i can simply implement that functionality directly inside the
alright |
9190c6e to
123d519
Compare
An iterator that was starts at a specific key entry, which allows to iterate starting from this entry, instead of starting at the beginning
This implements an iterator that was starts at a specific key entry, which allows to iterate starting from this entry, instead of starting at the beginning.
My motivation for this is to be able to easily notify all entries in a queue that an entry was dropped. I use this crate to be able to quickly drop entries at any position. So basically like a queue with instant remove.
Additionally I want to be able to ping entries "after" the dropped entry. All entries "before" the dropped entry are not of interest.
I am not sure if you are generally open for such a change, I currently only implemented this iterator for the linked hash map