public interface BytePriorityDequeue extends BytePriorityQueue
| Modifier and Type | Method and Description |
|---|---|
BytePriorityDequeue |
copy()
A Function that does a shallow clone of the PriorityQueue itself.
|
byte |
dequeueLast()
A Method to remove a element from the last place instead of the first
|
default void |
enqueueAllFirst(byte... e)
Method to mass insert a elements into the first Index of the PriorityDequeue.
|
default void |
enqueueAllFirst(byte[] e,
int length)
Method to mass insert a elements into the first Index of the PriorityDequeue.
|
default void |
enqueueAllFirst(byte[] e,
int offset,
int length)
Method to mass insert a elements into the first Index of the PriorityDequeue.
|
default void |
enqueueAllFirst(ByteCollection c)
Method to mass insert elements into first Index of the PriorityDequeue.
|
void |
enqueueFirst(byte e)
Method to insert a element into the first Index instead of the last.
|
default byte |
last()
Peeking function for the last element
|
default BytePriorityDequeue |
synchronizeQueue()
Creates a Wrapped PriorityDequeue that is Synchronized
|
default BytePriorityDequeue |
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, toByteArray, toByteArrayarrayflatMap, asAsync, count, distinct, filter, findFirst, flatMap, forEach, forEach, forEach, iterator, limit, map, matchesAll, matchesAny, matchesNone, peek, pour, pourAsList, pourAsSet, reduce, reduce, sorted, spliteratorvoid enqueueFirst(byte e)
e - the element that should be inserted into the first placedefault void enqueueAllFirst(byte... e)
e - the elements that should be inserteddefault void enqueueAllFirst(byte[] e,
int length)
e - the elements that should be insertedlength - the amount of elements that should be inserteddefault void enqueueAllFirst(byte[] 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(ByteCollection c)
c - the elements that should be inserted from the Collectionbyte dequeueLast()
java.util.NoSuchElementException - if no element is in the dequedefault byte last()
default BytePriorityDequeue synchronizeQueue()
synchronizeQueue in interface BytePriorityQueueBytePriorityQueues.synchronize(speiger.src.collections.bytes.queues.BytePriorityQueue)default BytePriorityDequeue synchronizeQueue(java.lang.Object mutex)
synchronizeQueue in interface BytePriorityQueuemutex - is the controller of the synchronization blockBytePriorityQueues.synchronize(speiger.src.collections.bytes.queues.BytePriorityQueue)BytePriorityDequeue copy()
BytePriorityQueuecopy in interface BytePriorityQueue