for sort-with take and better performance over large values
The priority queues should be MAX queues, i.e. the ones we want least
should be in the .peek position
This is MUCH Faster for Top-K algorithms
Note this is MUTABLE. When you put something in plus, it is changed!
Linear Supertypes
Monoid[PriorityQueue[K]], Semigroup[PriorityQueue[K]], Serializable, AnyRef, Any
for sort-with take and better performance over large values The priority queues should be MAX queues, i.e. the ones we want least should be in the .peek position This is MUCH Faster for Top-K algorithms Note this is MUTABLE. When you put something in plus, it is changed!