org.processmining.multilayeralignment.algorithms

Class SortedHashBackedPriorityQueue

java.lang.Object

org.processmining.multilayeralignment.algorithms.HashBackedPriorityQueue

org.processmining.multilayeralignment.algorithms.SortedHashBackedPriorityQueue

All Implemented Interfaces:

Queue

public class SortedHashBackedPriorityQueue
extends HashBackedPriorityQueue

Field Summary

Fields inherited from class org.processmining.multilayeralignment.algorithms.HashBackedPriorityQueue

algorithm, locationMap, maxCost, NEV, queue, size

Constructor Summary

Constructors

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.

Method Summary

Modifier and Type	Method and Description
boolean	isBetter(int marking1, int marking2) First order sorting is based on F score.

Methods inherited from class org.processmining.multilayeralignment.algorithms.HashBackedPriorityQueue

add, checkInv, checkInv, contains, getAlgorithm, getEstimatedMemorySize, getMaxCost, grow, hashCode, isEmpty, maxCapacity, maxSize, offer, peek, peek, poll, setMaxCost, siftDown, siftUp, size, toString

Methods inherited from class java.lang.Object

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

Constructor Detail

SortedHashBackedPriorityQueue

public 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.

Parameters:

algorithm - the algorithm the queue is used in

initialCapacity - the initial capacity for this priority queue

maxCost - the maximum cost for anything to be added to this queue

Throws:

java.lang.IllegalArgumentException - if initialCapacity is less than 1

SortedHashBackedPriorityQueue

public SortedHashBackedPriorityQueue(ReplayAlgorithm algorithm,
                                     int initialCapacity,
                                     boolean preferExact)

Method Detail

isBetter

public boolean isBetter(int marking1,
                        int marking2)

First order sorting is based on F score. Second order sorting on G score, where higher G score is better.

Overrides:

isBetter in class HashBackedPriorityQueue