org.processmining.plugins.balancedconformance.controlflow.override.queues.noduplicate

Class DataFastLookupPriorityQueue

java.lang.Object

org.processmining.plugins.balancedconformance.controlflow.override.queues.noduplicate.DataFastLookupPriorityQueue

All Implemented Interfaces:

nl.tue.astar.util.FastLookupPriorityQueue

Direct Known Subclasses:

BFDataPriorityQueue, ClosestSyncMovesDataPriorityQueue, DFDataPriorityQueue, FurthestSyncMovesDataPriorityQueue, RandomDataPriorityQueue

public abstract class DataFastLookupPriorityQueue
extends java.lang.Object
implements nl.tue.astar.util.FastLookupPriorityQueue

Implementation of a FastLookupPriorityQueue that allows to store Objects instead of long values in the queue. Most code taken from AbstractFastLookupPriorityQueue.

Author:

F. Mannhardt

Field Summary

Fields

Modifier and Type	Field and Description
protected it.unimi.dsi.fastutil.objects.Object2IntOpenCustomHashMap<DRecord>	locationMap
protected int	maxCost The maximum total cost for any record in this queue.
protected static int	NEV
protected DRecord[]	queue Priority queue represented as a balanced binary heap: the two children of queue[n] are queue[2*n+1] and queue[2*(n+1)].
protected int	size The number of elements in the priority queue.

Constructor Summary

Constructors

Constructor and Description
DataFastLookupPriorityQueue(int initialCapacity, it.unimi.dsi.fastutil.Hash.Strategy<DRecord> strategy, org.processmining.plugins.astar.petrinet.impl.AbstractPDelegate<? extends nl.tue.astar.Tail> delegate)
DataFastLookupPriorityQueue(int initialCapacity, it.unimi.dsi.fastutil.Hash.Strategy<DRecord> strategy, org.processmining.plugins.astar.petrinet.impl.AbstractPDelegate<? extends nl.tue.astar.Tail> delegate, int maxCost)

Method Summary

Modifier and Type	Method and Description
boolean	add(nl.tue.astar.Record newE) Inserts the specified element into this priority queue.
boolean	checkInv()
protected boolean	checkInv(int loc)
DRecord	contains(nl.tue.astar.Record newRec) Checks if the queue contains a record pointing to the same state as the given record.
boolean	equals(java.lang.Object o)
int	getMaxCost()
protected void	grow(int minCapacity) Increases the capacity of the array.
int	hashCode()
protected abstract boolean	isBetter(DRecord r1, DRecord r2)
boolean	isEmpty()
nl.tue.astar.Record	peek()
nl.tue.astar.Record	poll()
void	setMaxCost(int maxCost)
int	size()
java.lang.String	toString()

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Field Detail

locationMap

protected final it.unimi.dsi.fastutil.objects.Object2IntOpenCustomHashMap<DRecord> locationMap

NEV

protected static final int NEV

See Also:

Constant Field Values

queue

protected DRecord[] queue

Priority queue represented as a balanced binary heap: the two children of queue[n] are queue[2*n+1] and queue[2*(n+1)]. The priority queue is ordered by the record's natural ordering: For each node n in the heap and each descendant d of n, n <= d. The element with the best value is in queue[0], assuming the queue is nonempty.

size

protected int size

The number of elements in the priority queue.

maxCost

protected int maxCost

The maximum total cost for any record in this queue. If the cost of a record which is added is higher that this value, it is not added

Constructor Detail

DataFastLookupPriorityQueue

public DataFastLookupPriorityQueue(int initialCapacity,
                                   it.unimi.dsi.fastutil.Hash.Strategy<DRecord> strategy,
                                   org.processmining.plugins.astar.petrinet.impl.AbstractPDelegate<? extends nl.tue.astar.Tail> delegate)

DataFastLookupPriorityQueue

public DataFastLookupPriorityQueue(int initialCapacity,
                                   it.unimi.dsi.fastutil.Hash.Strategy<DRecord> strategy,
                                   org.processmining.plugins.astar.petrinet.impl.AbstractPDelegate<? extends nl.tue.astar.Tail> delegate,
                                   int maxCost)

Method Detail

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface nl.tue.astar.util.FastLookupPriorityQueue

hashCode

public int hashCode()

Overrides:

hashCode in class java.lang.Object

equals

public boolean equals(java.lang.Object o)

Overrides:

equals in class java.lang.Object

setMaxCost

public void setMaxCost(int maxCost)

Specified by:

setMaxCost in interface nl.tue.astar.util.FastLookupPriorityQueue

getMaxCost

public int getMaxCost()

Specified by:

getMaxCost in interface nl.tue.astar.util.FastLookupPriorityQueue

contains

public DRecord contains(nl.tue.astar.Record newRec)

Description copied from interface: nl.tue.astar.util.FastLookupPriorityQueue

Checks if the queue contains a record pointing to the same state as the given record. If so, it returns that record, if not, it returns null;

Specified by:

contains in interface nl.tue.astar.util.FastLookupPriorityQueue

Returns:

checkInv

public boolean checkInv()

grow

protected void grow(int minCapacity)

Increases the capacity of the array.

Parameters:

minCapacity - the desired minimum capacity

peek

public nl.tue.astar.Record peek()

Specified by:

peek in interface nl.tue.astar.util.FastLookupPriorityQueue

size

public int size()

Specified by:

size in interface nl.tue.astar.util.FastLookupPriorityQueue

poll

public nl.tue.astar.Record poll()

Specified by:

poll in interface nl.tue.astar.util.FastLookupPriorityQueue

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object

add

public boolean add(nl.tue.astar.Record newE)

Inserts the specified element into this priority queue.

Specified by:

add in interface nl.tue.astar.util.FastLookupPriorityQueue

Returns:

true (as specified by Collection.add(E))

Throws:

java.lang.ClassCastException - if the specified element cannot be compared with elements currently in this priority queue according to the priority queue's ordering

java.lang.NullPointerException - if the specified element is null

isBetter

protected abstract boolean isBetter(DRecord r1,
                                    DRecord r2)

checkInv

protected boolean checkInv(int loc)