Modul speiger.src.collections
Schnittstelle ShortPriorityDequeue
- Alle Superschnittstellen:
Iterable<Short>,ShortIterable,ShortPriorityQueue
- Alle bekannten Implementierungsklassen:
ShortArrayFIFOQueue,ShortLinkedList,ShortPriorityQueues.SynchronizedPriorityDequeue
A Type Speciifc PriorityDeque or Dequeue interface to allow implementations like FIFO queues.
-
Methodenübersicht
Modifizierer und TypMethodeBeschreibungcopy()A Function that does a shallow clone of the PriorityQueue itself.shortA Method to remove a element from the last place instead of the firstdefault voidenqueueAllFirst(short... e) Method to mass insert a elements into the first Index of the PriorityDequeue.default voidenqueueAllFirst(short[] e, int length) Method to mass insert a elements into the first Index of the PriorityDequeue.default voidenqueueAllFirst(short[] e, int offset, int length) Method to mass insert a elements into the first Index of the PriorityDequeue.default voidMethod to mass insert elements into first Index of the PriorityDequeue.voidenqueueFirst(short e) Method to insert a element into the first Index instead of the last.default shortlast()Peeking function for the last elementdefault ShortPriorityDequeueCreates a Wrapped PriorityDequeue that is Synchronizeddefault ShortPriorityDequeuesynchronizeQueue(Object mutex) Creates a Wrapped PriorityDequeue that is SynchronizedVon Schnittstelle geerbte Methoden speiger.src.collections.shorts.collections.ShortIterable
arrayflatMap, asAsync, count, distinct, filter, findFirst, flatMap, forEach, forEach, forEach, forEachIndexed, iterator, limit, map, matchesAll, matchesAny, matchesNone, peek, pour, pourAsList, pourAsSet, reduce, reduce, repeat, sorted, spliteratorVon Schnittstelle geerbte Methoden speiger.src.collections.shorts.queues.ShortPriorityQueue
clear, comparator, contains, dequeue, enqueue, enqueueAll, enqueueAll, enqueueAll, enqueueAll, first, isEmpty, onChanged, peek, removeFirst, removeLast, size, toShortArray, toShortArray
-
Methodendetails
-
enqueueFirst
void enqueueFirst(short e) Method to insert a element into the first Index instead of the last.- Parameter:
e- the element that should be inserted into the first place
-
enqueueAllFirst
default void enqueueAllFirst(short... e) Method to mass insert a elements into the first Index of the PriorityDequeue.- Parameter:
e- the elements that should be inserted
-
enqueueAllFirst
default void enqueueAllFirst(short[] e, int length) Method to mass insert a elements into the first Index of the PriorityDequeue.- Parameter:
e- the elements that should be insertedlength- the amount of elements that should be inserted
-
enqueueAllFirst
default void enqueueAllFirst(short[] e, int offset, int length) Method to mass insert a elements into the first Index of the PriorityDequeue.- Parameter:
e- the elements that should be insertedoffset- the offset where in the array should be startedlength- the amount of elements that should be inserted
-
enqueueAllFirst
Method to mass insert elements into first Index of the PriorityDequeue.- Parameter:
c- the elements that should be inserted from the Collection
-
dequeueLast
short dequeueLast()A Method to remove a element from the last place instead of the first- Gibt zurück:
- the last element inserted
- Löst aus:
NoSuchElementException- if no element is in the deque
-
last
default short last()Peeking function for the last element- Gibt zurück:
- the Last Element within the dequeue without deleting it
-
synchronizeQueue
Creates a Wrapped PriorityDequeue that is Synchronized- Angegeben von:
synchronizeQueuein SchnittstelleShortPriorityQueue- Gibt zurück:
- a new PriorityDequeue that is synchronized
- Siehe auch:
-
synchronizeQueue
Creates a Wrapped PriorityDequeue that is Synchronized- Angegeben von:
synchronizeQueuein SchnittstelleShortPriorityQueue- Parameter:
mutex- is the controller of the synchronization block- Gibt zurück:
- a new PriorityDequeue Wrapper that is synchronized
- Siehe auch:
-
copy
ShortPriorityDequeue copy()Beschreibung aus Schnittstelle kopiert:ShortPriorityQueueA Function that does a shallow clone of the PriorityQueue itself. This function is more optimized then a copy constructor since the PriorityQueue does not have to be unsorted/resorted. It can be compared to Cloneable but with less exception risk- Angegeben von:
copyin SchnittstelleShortPriorityQueue- Gibt zurück:
- a Shallow Copy of the PriorityQueue
-