public interface Queue
Modifier and Type | Method and Description |
---|---|
boolean |
add(int marking)
add a new marking to the queue.
|
boolean |
checkInv()
Debugging method that checks the queue invariant on the queue
|
boolean |
contains(int markingId)
Checks if the the stored marking with ID markingId is contained in this
queue.
|
ReplayAlgorithm |
getAlgorithm()
Return the algorithm for which this Queue is used.
|
long |
getEstimatedMemorySize()
returns the maximum memory use in bytes the queue ever had.
|
boolean |
isEmpty()
returns true if the queue is empty
|
int |
maxCapacity()
returns the maximum memory capacity the queue ever had.
|
int |
maxSize()
returns maximum number of elements the queue ever contained.
|
int |
peek()
Show the number of the marking at the head of the priority queue
|
int |
poll()
remove and return the head of the queue
|
int |
size()
Returns the current number of elements in the queue
|
ReplayAlgorithm getAlgorithm()
int peek()
int poll()
boolean add(int marking)
marking
- boolean isEmpty()
long getEstimatedMemorySize()
int maxCapacity()
int maxSize()
int size()
boolean contains(int markingId)
markingId
- boolean checkInv()