mutable

Type Members

1. abstract class PriorityQueueAggregator[A, +C] extends MonoidAggregator[A, PriorityQueue[A], C]

   This gives you the max smallest items.

2. class PriorityQueueMonoid[K] extends Monoid[PriorityQueue[K]]

   for sort-with take and better performance over large values The priority queues should be MAX queues, i.

3. class PriorityQueueToListAggregator[A] extends PriorityQueueAggregator[A, List[A]]

   Should probably be your default Top-K implementation