public class SortedHashBackedPriorityQueue extends HashBackedPriorityQueue
algorithm, locationMap, maxCost, NEV, queue, size
Constructor and Description |
---|
SortedHashBackedPriorityQueue(ReplayAlgorithm algorithm,
int initialCapacity,
boolean preferExact) |
SortedHashBackedPriorityQueue(ReplayAlgorithm algorithm,
int initialCapacity,
int maxCost,
boolean preferExact)
Creates a
HashBackedPriorityQueue with the specified initial capacity
that orders its elements according to the specified comparator. |
Modifier and Type | Method and Description |
---|---|
boolean |
isBetter(int marking1,
int marking2)
First order sorting is based on F score.
|
add, checkInv, checkInv, contains, getAlgorithm, getEstimatedMemorySize, getMaxCost, grow, hashCode, isEmpty, maxCapacity, maxSize, offer, peek, peek, poll, setMaxCost, siftDown, siftUp, size, toString
public SortedHashBackedPriorityQueue(ReplayAlgorithm algorithm, int initialCapacity, int maxCost, boolean preferExact)
HashBackedPriorityQueue
with the specified initial capacity
that orders its elements according to the specified comparator.algorithm
- the algorithm the queue is used ininitialCapacity
- the initial capacity for this priority queuemaxCost
- the maximum cost for anything to be added to this queuejava.lang.IllegalArgumentException
- if initialCapacity
is less than 1public SortedHashBackedPriorityQueue(ReplayAlgorithm algorithm, int initialCapacity, boolean preferExact)
public boolean isBetter(int marking1, int marking2)
isBetter
in class HashBackedPriorityQueue