T - the type of elements maintained by this Collectionpublic static class ObjectPriorityQueues.SynchronizedPriorityDequeue<T> extends ObjectPriorityQueues.SynchronizedPriorityQueue<T> implements ObjectPriorityDequeue<T>
| Modifier and Type | Method and Description |
|---|---|
ObjectPriorityDequeue<T> |
copy()
A Function that does a shallow clone of the PriorityQueue itself.
|
T |
dequeueLast()
A Method to remove a element from the last place instead of the first
|
void |
enqueueAllFirst(java.util.Collection<? extends T> c)
Method to mass insert elements into first Index of the PriorityDequeue.
|
void |
enqueueAllFirst(ObjectCollection<T> c)
Method to mass insert elements into first Index of the PriorityDequeue.
|
void |
enqueueAllFirst(T[] e,
int offset,
int length)
Method to mass insert a elements into the first Index of the PriorityDequeue.
|
void |
enqueueFirst(T e)
Method to insert a element into the first Index instead of the last.
|
clear, comparator, count, dequeue, enqueue, enqueueAll, enqueueAll, enqueueAll, findFirst, forEach, forEach, iterator, matchesAll, matchesAny, matchesNone, onChanged, peek, removeFirst, removeLast, size, toArrayequals, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitenqueueAllFirst, enqueueAllFirst, last, synchronizeQueue, synchronizeQueueclear, comparator, dequeue, enqueue, enqueueAll, enqueueAll, enqueueAll, enqueueAll, enqueueAll, first, isEmpty, iterator, onChanged, peek, removeFirst, removeLast, size, toArray, toArray, toArrayarrayflatMap, asAsync, count, distinct, filter, findFirst, flatMap, forEach, limit, map, matchesAll, matchesAny, matchesNone, peek, pour, pourAsList, pourAsSet, reduce, reduce, sorted, spliteratorpublic void enqueueFirst(T e)
ObjectPriorityDequeueenqueueFirst in interface ObjectPriorityDequeue<T>e - the element that should be inserted into the first placepublic void enqueueAllFirst(T[] e, int offset, int length)
ObjectPriorityDequeueenqueueAllFirst in interface ObjectPriorityDequeue<T>e - the elements that should be insertedoffset - the offset where in the array should be startedlength - the amount of elements that should be insertedpublic void enqueueAllFirst(ObjectCollection<T> c)
ObjectPriorityDequeueenqueueAllFirst in interface ObjectPriorityDequeue<T>c - the elements that should be inserted from the Collectionpublic void enqueueAllFirst(java.util.Collection<? extends T> c)
ObjectPriorityDequeueenqueueAllFirst in interface ObjectPriorityDequeue<T>c - the elements that should be inserted from the Collectionpublic T dequeueLast()
ObjectPriorityDequeuedequeueLast in interface ObjectPriorityDequeue<T>public ObjectPriorityDequeue<T> copy()
ObjectPriorityQueuecopy in interface ObjectPriorityDequeue<T>copy in interface ObjectPriorityQueue<T>copy in class ObjectPriorityQueues.SynchronizedPriorityQueue<T>