Modul speiger.src.collections

Package speiger.src.collections.objects.queues

Schnittstelle ObjectPriorityDequeue<T>

Typparameter:

T - the keyType of elements maintained by this Collection

Alle Superschnittstellen:

Iterable<T>, ObjectIterable<T>, ObjectPriorityQueue<T>

Alle bekannten Implementierungsklassen:

ObjectArrayFIFOQueue, ObjectLinkedList, ObjectPriorityQueues.SynchronizedPriorityDequeue

public interface ObjectPriorityDequeue<T>
extends ObjectPriorityQueue<T>

A Type Speciifc PriorityDeque or Dequeue interface to allow implementations like FIFO queues.

Methodenübersicht

Modifizierer und Typ	Methode	Beschreibung
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
default void	enqueueAllFirst(Collection<? extends T> c)	Method to mass insert elements into first Index of the PriorityDequeue.
default void	enqueueAllFirst(ObjectCollection<T> c)	Method to mass insert elements into first Index of the PriorityDequeue.
default void	enqueueAllFirst(T... e)	Method to mass insert a elements into the first Index of the PriorityDequeue.
default void	enqueueAllFirst(T[] e, int length)	Method to mass insert a elements into the first Index of the PriorityDequeue.
default 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.
default T	last()	Peeking function for the last element
default ObjectPriorityDequeue<T>	synchronizeQueue()	Creates a Wrapped PriorityDequeue that is Synchronized
default ObjectPriorityDequeue<T>	synchronizeQueue(Object mutex)	Creates a Wrapped PriorityDequeue that is Synchronized

Von Schnittstelle geerbte Methoden java.lang.Iterable

forEach

Von Schnittstelle geerbte Methoden speiger.src.collections.objects.collections.ObjectIterable

arrayflatMap, asAsync, count, distinct, filter, findFirst, flatMap, forEach, forEachIndexed, limit, map, mapToBoolean, mapToByte, mapToDouble, mapToFloat, mapToInt, mapToLong, mapToShort, matchesAll, matchesAny, matchesNone, peek, pour, pourAsList, pourAsSet, reduce, reduce, repeat, sorted, spliterator

Von Schnittstelle geerbte Methoden speiger.src.collections.objects.queues.ObjectPriorityQueue

clear, comparator, contains, dequeue, enqueue, enqueueAll, enqueueAll, enqueueAll, enqueueAll, enqueueAll, first, isEmpty, iterator, onChanged, peek, removeFirst, removeLast, size, toArray, toArray, toArray

Methodendetails

enqueueFirst

void enqueueFirst(T 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(T... 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(T[] e,
 int length)

Method to mass insert a elements into the first Index of the PriorityDequeue.

Parameter:

e - the elements that should be inserted

length - the amount of elements that should be inserted

enqueueAllFirst

default void enqueueAllFirst(T[] 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 inserted

offset - the offset where in the array should be started

length - the amount of elements that should be inserted

enqueueAllFirst

default void enqueueAllFirst(ObjectCollection<T> c)

Method to mass insert elements into first Index of the PriorityDequeue.

Parameter:

c - the elements that should be inserted from the Collection

enqueueAllFirst

default void enqueueAllFirst(Collection<? extends T> c)

Method to mass insert elements into first Index of the PriorityDequeue. This method exists to add support for Java Collections to make it more useable

Parameter:

c - the elements that should be inserted from the Collection

dequeueLast

T 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 T last()

Peeking function for the last element

Gibt zurück:

the Last Element within the dequeue without deleting it

synchronizeQueue

default ObjectPriorityDequeue<T> synchronizeQueue()

Creates a Wrapped PriorityDequeue that is Synchronized

Angegeben von:

synchronizeQueue in Schnittstelle ObjectPriorityQueue<T>

Gibt zurück:

a new PriorityDequeue that is synchronized

Siehe auch:

• ObjectPriorityQueues.synchronize(speiger.src.collections.objects.queues.ObjectPriorityQueue<T>)

synchronizeQueue

default ObjectPriorityDequeue<T> synchronizeQueue(Object mutex)

Creates a Wrapped PriorityDequeue that is Synchronized

Angegeben von:

synchronizeQueue in Schnittstelle ObjectPriorityQueue<T>

Parameter:

mutex - is the controller of the synchronization block

Gibt zurück:

a new PriorityDequeue Wrapper that is synchronized

Siehe auch:

• ObjectPriorityQueues.synchronize(speiger.src.collections.objects.queues.ObjectPriorityQueue<T>)

copy

ObjectPriorityDequeue<T> copy()

Beschreibung aus Schnittstelle kopiert: ObjectPriorityQueue

A 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:

copy in Schnittstelle ObjectPriorityQueue<T>

Gibt zurück:

a Shallow Copy of the PriorityQueue