Modul speiger.src.collections
Schnittstelle BooleanPriorityDequeue
- Alle Superschnittstellen:
BooleanIterable,BooleanPriorityQueue,Iterable<Boolean>
- Alle bekannten Implementierungsklassen:
BooleanArrayFIFOQueue,BooleanLinkedList,BooleanPriorityQueues.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.booleanA Method to remove a element from the last place instead of the firstdefault voidenqueueAllFirst(boolean... e) Method to mass insert a elements into the first Index of the PriorityDequeue.default voidenqueueAllFirst(boolean[] e, int length) Method to mass insert a elements into the first Index of the PriorityDequeue.default voidenqueueAllFirst(boolean[] 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(boolean e) Method to insert a element into the first Index instead of the last.default booleanlast()Peeking function for the last elementdefault BooleanPriorityDequeueCreates a Wrapped PriorityDequeue that is Synchronizeddefault BooleanPriorityDequeuesynchronizeQueue(Object mutex) Creates a Wrapped PriorityDequeue that is SynchronizedVon Schnittstelle geerbte Methoden speiger.src.collections.booleans.collections.BooleanIterable
arrayflatMap, asAsync, count, distinct, filter, findFirst, flatMap, forEach, forEach, forEach, forEachIndexed, iterator, limit, map, matchesAll, matchesAny, matchesNone, peek, pour, pourAsList, reduce, reduce, repeat, sorted, spliteratorVon Schnittstelle geerbte Methoden speiger.src.collections.booleans.queues.BooleanPriorityQueue
clear, comparator, contains, dequeue, enqueue, enqueueAll, enqueueAll, enqueueAll, enqueueAll, first, isEmpty, onChanged, peek, removeFirst, removeLast, size, toBooleanArray, toBooleanArray
-
Methodendetails
-
enqueueFirst
void enqueueFirst(boolean 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(boolean... 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(boolean[] 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(boolean[] 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
boolean 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 boolean 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 SchnittstelleBooleanPriorityQueue- Gibt zurück:
- a new PriorityDequeue that is synchronized
- Siehe auch:
-
synchronizeQueue
Creates a Wrapped PriorityDequeue that is Synchronized- Angegeben von:
synchronizeQueuein SchnittstelleBooleanPriorityQueue- Parameter:
mutex- is the controller of the synchronization block- Gibt zurück:
- a new PriorityDequeue Wrapper that is synchronized
- Siehe auch:
-
copy
BooleanPriorityDequeue copy()Beschreibung aus Schnittstelle kopiert:BooleanPriorityQueueA 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 SchnittstelleBooleanPriorityQueue- Gibt zurück:
- a Shallow Copy of the PriorityQueue
-