Package nl.tue.astar.util
Class RandomFastLookupPriorityQueue
- java.lang.Object
-
- nl.tue.astar.util.AbstractFastLookupPriorityQueue
-
- nl.tue.astar.util.RandomFastLookupPriorityQueue
-
- All Implemented Interfaces:
FastLookupPriorityQueue
public class RandomFastLookupPriorityQueue extends AbstractFastLookupPriorityQueue
-
-
Field Summary
-
Fields inherited from class nl.tue.astar.util.AbstractFastLookupPriorityQueue
locationMap, maxCost, NEV, queue, size
-
-
Constructor Summary
Constructors Constructor Description RandomFastLookupPriorityQueue(int initialCapacity, double probability)Creates aPriorityQueuewith the specified initial capacity that orders its elements according to the specified comparator.RandomFastLookupPriorityQueue(int initialCapacity, int maxCost, double probability)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description booleanisBetter(Record r1, Record r2)-
Methods inherited from class nl.tue.astar.util.AbstractFastLookupPriorityQueue
add, checkInv, checkInv, contains, getMaxCost, grow, hashCode, isEmpty, offer, peek, peek, poll, setMaxCost, siftDown, siftUp, size, toString, updateToBetter
-
-
-
-
Constructor Detail
-
RandomFastLookupPriorityQueue
public RandomFastLookupPriorityQueue(int initialCapacity, double probability)Creates aPriorityQueuewith the specified initial capacity that orders its elements according to the specified comparator.- Parameters:
initialCapacity- the initial capacity for this priority queuecomparator- the comparator that will be used to order this priority queue. Ifnull, the natural ordering of the elements will be used.- Throws:
java.lang.IllegalArgumentException- ifinitialCapacityis less than 1
-
RandomFastLookupPriorityQueue
public RandomFastLookupPriorityQueue(int initialCapacity, int maxCost, double probability)
-
-
Method Detail
-
isBetter
public boolean isBetter(Record r1, Record r2)
- Specified by:
isBetterin classAbstractFastLookupPriorityQueue
-
-