priority-queue
priority-queue copied to clipboard
garro95
A priority queue for Rust with efficient change function.
It would be helpful to add a pop API that extracts the lowest priority from the queue and not only the greatest one (as documented [here](https://docs.rs/priority-queue/latest/priority_queue/priority_queue/struct.PriorityQueue.html#method.pop))
Implement two methods : clear_under() and clear_over() that accept a priority as an argument. This will essentially truncate the size of the data structure, marking all items over/under this priority...
Similar to #35 , the reasoning is the same. Return an iter with elements above or under a priority. Consider the following, which is illegal by rust's standards: ```rs while...
How will the items be sorted and popped, if their priority is equal? Is it insertion order? Is it arbitrary order? Is the order deterministic/repeatable? Does it depend on hasher?...
`IndexMap` `Equivalent` trait allows to have a special implementation of `Eq` to use inside the hashmap but different from the `==`. `IndexMap` provide a default implementation of `Equivalent` for types...
Hey, I'm really appreciating the DoublePriorityQueue: it lets me easily remove entries from one end to avoid overfilling a constant size, kind of like a work-queue LRU cache. Since the...
Unlike most other Free Software licences, the MPL explicitly says it applies only to files with a specific notice: > 1.4. "Covered Software" > means Source Code Form to which...
This method should take an `FnMut(T) -> bool` predicate, and then iterate over items in the priority queue in sorted order, popping and returning those items for which the predicate...
The idea is similar to #47 but instead of being able to skip items, it would remove all items until a predicate matches (excluding that element). For example in Rust...
