T - the type of elements maintained by this Collectionpublic class ObjectArrayFIFOQueue<T> extends java.lang.Object implements ObjectPriorityDequeue<T>, ITrimmable
| Modifier and Type | Field and Description |
|---|---|
static int |
MIN_CAPACITY
The Minimum Capacity that is allowed
|
| Constructor and Description |
|---|
ObjectArrayFIFOQueue()
Default Construtor
|
ObjectArrayFIFOQueue(int capacity)
Constructor with a Min Capacity
|
ObjectArrayFIFOQueue(T[] values)
Constructor using a initial array
|
ObjectArrayFIFOQueue(T[] values,
int size)
Constructor using a initial array
|
ObjectArrayFIFOQueue(T[] values,
int offset,
int size)
Constructor using a initial array
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
clears all elements within the PriorityQueue,
this does not resize the backing arrays
|
void |
clearAndTrim(int size)
Trims the collection down to the requested size and clears all elements while doing so
|
java.util.Comparator<? super T> |
comparator() |
T |
dequeue()
Method to extract a element from the PriorityQueue
|
T |
dequeueLast()
A Method to remove a element from the last place instead of the first
|
void |
enqueue(T e)
Method to insert a element into the PriorityQueue
|
void |
enqueueFirst(T e)
Method to insert a element into the first Index instead of the last.
|
ObjectIterator<T> |
iterator() |
void |
onChanged()
Allows to notify the Queue to be revalidate its data
|
T |
peek(int index)
Peeking function to see whats inside the queue.
|
boolean |
remove(T e)
Removes the first found element in the queue
|
boolean |
removeLast(T e)
Removes the last found element in the queue
|
int |
size() |
T[] |
toArray(T[] input)
A method to drop the contents of the Queue without clearing the queue
|
boolean |
trim(int size)
Trims the original collection down to the size of the current elements or the requested size depending which is bigger
|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitlastfirst, isEmpty, toArrayclearAndTrim, trimpublic static final int MIN_CAPACITY
public ObjectArrayFIFOQueue(T[] values)
values - the Array that should be usedpublic ObjectArrayFIFOQueue(T[] values, int size)
values - the Array that should be usedsize - the amount of elements that are in the initial arrayjava.lang.IllegalStateException - if values is smaller then sizepublic ObjectArrayFIFOQueue(T[] values, int offset, int size)
values - the Array that should be usedoffset - where to begin in the initial arraysize - the amount of elements that are in the initial arrayjava.lang.IllegalStateException - if values is smaller then sizepublic ObjectArrayFIFOQueue(int capacity)
capacity - the initial capacity of the backing arrayjava.lang.IllegalStateException - if the initial size is smaller 0public ObjectArrayFIFOQueue()
public ObjectIterator<T> iterator()
iterator in interface java.lang.Iterable<T>public int size()
size in interface ObjectPriorityQueue<T>public void clear()
ObjectPriorityQueueclear in interface ObjectPriorityQueue<T>public void enqueue(T e)
ObjectPriorityQueueenqueue in interface ObjectPriorityQueue<T>e - the element that should be insertedpublic void enqueueFirst(T e)
ObjectPriorityDequeueenqueueFirst in interface ObjectPriorityDequeue<T>e - the element that should be inserted into the first placepublic T dequeue()
ObjectPriorityQueuedequeue in interface ObjectPriorityQueue<T>public T dequeueLast()
ObjectPriorityDequeuedequeueLast in interface ObjectPriorityDequeue<T>public T peek(int index)
ObjectPriorityQueuepeek in interface ObjectPriorityQueue<T>index - of the element that is requested to be viewed.public boolean remove(T e)
ObjectPriorityQueueremove in interface ObjectPriorityQueue<T>e - the element that should be removedpublic boolean removeLast(T e)
ObjectPriorityQueueremoveLast in interface ObjectPriorityQueue<T>e - the element that should be removedpublic void onChanged()
ObjectPriorityQueueonChanged in interface ObjectPriorityQueue<T>public java.util.Comparator<? super T> comparator()
comparator in interface ObjectPriorityQueue<T>public boolean trim(int size)
ITrimmabletrim in interface ITrimmablesize - the requested trim size.public void clearAndTrim(int size)
clearAndTrim in interface ITrimmablesize - the amount of elements that should be allowedpublic T[] toArray(T[] input)
ObjectPriorityQueuetoArray in interface ObjectPriorityQueue<T>input - where the elements should be inserted to. If it does not fit then it creates a new appropiatly created array