| An indirect double priority queue.
An indirect double priority queue uses two distinct comparators (called primary
and secondary) to keep its elements ordered. It makes it possible to access the
first element w.r.t. the secondary comparatory using
IndirectDoublePriorityQueue.secondaryFirst() (and, optionally,
the last element using
IndirectDoublePriorityQueue.secondaryLast() ). The remaining methods
work like those of an
based on the
primary comparator.
|