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

Class DuplicateStatesFastLookupPriorityQueue

java.lang.Object

org.processmining.plugins.balancedconformance.controlflow.override.queues.duplicates.DuplicateStatesFastLookupPriorityQueue

All Implemented Interfaces:

nl.tue.astar.util.FastLookupPriorityQueue

Direct Known Subclasses:

BFDataDuplicatePriorityQueue, BFDuplicatePriorityQueue, DFDataDuplicatePriorityQueue, RandomFirstDuplicatePriorityQueue

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

Implementation of a FastLookupPriorityQueue that allows adding multiple Record objects that point to the same state (i.e. Head). It does not support the methods contains(Record) though. Most code taken from AbstractFastLookupPriorityQueue, but it seemed better to not subclass it, as we don't need some fields.

Author:

F. Mannhardt

Field Summary

Fields

Modifier and Type	Field and Description
protected nl.tue.astar.Record[]	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
DuplicateStatesFastLookupPriorityQueue(int initialCapacity)

Method Summary

Modifier and Type	Method and Description
boolean	add(nl.tue.astar.Record newE)
nl.tue.astar.Record	contains(nl.tue.astar.Record newRec) Checks if the queue contains a record pointing to the same state as the given record.
int	getMaxCost()
protected abstract boolean	isBetter(nl.tue.astar.Record r1, nl.tue.astar.Record 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, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

queue

protected nl.tue.astar.Record[] 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.

Constructor Detail

DuplicateStatesFastLookupPriorityQueue

public DuplicateStatesFastLookupPriorityQueue(int initialCapacity)

Method Detail

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

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object

isBetter

protected abstract boolean isBetter(nl.tue.astar.Record r1,
                                    nl.tue.astar.Record r2)

add

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

Specified by:

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

isEmpty

public boolean isEmpty()

Specified by:

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

contains

public nl.tue.astar.Record 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:

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