public interface LongPriorityDequeue extends LongPriorityQueue
| Modifier and Type | Method and Description |
|---|---|
LongPriorityDequeue |
copy()
A Function that does a shallow clone of the PriorityQueue itself.
|
long |
dequeueLast()
A Method to remove a element from the last place instead of the first
|
default void |
enqueueAllFirst(long... e)
Method to mass insert a elements into the first Index of the PriorityDequeue.
|
default void |
enqueueAllFirst(long[] e,
int length)
Method to mass insert a elements into the first Index of the PriorityDequeue.
|
default void |
enqueueAllFirst(long[] e,
int offset,
int length)
Method to mass insert a elements into the first Index of the PriorityDequeue.
|
default void |
enqueueAllFirst(LongCollection c)
Method to mass insert elements into first Index of the PriorityDequeue.
|
void |
enqueueFirst(long e)
Method to insert a element into the first Index instead of the last.
|
default long |
last()
Peeking function for the last element
|
default LongPriorityDequeue |
synchronizeQueue()
Creates a Wrapped PriorityDequeue that is Synchronized
|
default LongPriorityDequeue |
synchronizeQueue(java.lang.Object mutex)
Creates a Wrapped PriorityDequeue that is Synchronized
|
clear, comparator, dequeue, enqueue, enqueueAll, enqueueAll, enqueueAll, enqueueAll, first, isEmpty, onChanged, peek, removeFirst, removeLast, size, toLongArray, toLongArrayarrayflatMap, asAsync, count, distinct, filter, findFirst, flatMap, forEach, forEach, forEach, iterator, limit, map, matchesAll, matchesAny, matchesNone, peek, pour, pourAsList, pourAsSet, reduce, reduce, sorted, spliteratorvoid enqueueFirst(long e)
e - the element that should be inserted into the first placedefault void enqueueAllFirst(long... e)
e - the elements that should be inserteddefault void enqueueAllFirst(long[] e,
int length)
e - the elements that should be insertedlength - the amount of elements that should be inserteddefault void enqueueAllFirst(long[] e,
int offset,
int length)
e - the elements that should be insertedoffset - the offset where in the array should be startedlength - the amount of elements that should be inserteddefault void enqueueAllFirst(LongCollection c)
c - the elements that should be inserted from the Collectionlong dequeueLast()
java.util.NoSuchElementException - if no element is in the dequedefault long last()
default LongPriorityDequeue synchronizeQueue()
synchronizeQueue in interface LongPriorityQueueLongPriorityQueues.synchronize(speiger.src.collections.longs.queues.LongPriorityQueue)default LongPriorityDequeue synchronizeQueue(java.lang.Object mutex)
synchronizeQueue in interface LongPriorityQueuemutex - is the controller of the synchronization blockLongPriorityQueues.synchronize(speiger.src.collections.longs.queues.LongPriorityQueue)LongPriorityDequeue copy()
LongPriorityQueuecopy in interface LongPriorityQueue