Modul speiger.src.collections

Package speiger.src.collections.ints.utils

Klasse IntPriorityQueues.SynchronizedPriorityDequeue

java.lang.Object

speiger.src.collections.ints.utils.IntPriorityQueues.SynchronizedPriorityQueue

speiger.src.collections.ints.utils.IntPriorityQueues.SynchronizedPriorityDequeue

Alle implementierten Schnittstellen:

Iterable<Integer>, IntIterable, IntPriorityDequeue, IntPriorityQueue

Umschließende Klasse:

IntPriorityQueues

public static class IntPriorityQueues.SynchronizedPriorityDequeue
extends IntPriorityQueues.SynchronizedPriorityQueue
implements IntPriorityDequeue

Wrapper class for synchronization

Methodenübersicht

Modifizierer und Typ	Methode	Beschreibung
IntPriorityDequeue	copy()	A Function that does a shallow clone of the PriorityQueue itself.
int	dequeueLast()	A Method to remove a element from the last place instead of the first
void	enqueueAllFirst(int[] e, int offset, int length)	Method to mass insert a elements into the first Index of the PriorityDequeue.
void	enqueueAllFirst(IntCollection c)	Method to mass insert elements into first Index of the PriorityDequeue.
void	enqueueFirst(int e)	Method to insert a element into the first Index instead of the last.

Von Klasse geerbte Methoden speiger.src.collections.ints.utils.IntPriorityQueues.SynchronizedPriorityQueue

clear, comparator, contains, count, dequeue, enqueue, enqueueAll, enqueueAll, findFirst, forEach, forEach, iterator, matchesAll, matchesAny, matchesNone, onChanged, peek, removeFirst, removeLast, size, toIntArray

Von Klasse geerbte Methoden java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Von Schnittstelle geerbte Methoden speiger.src.collections.ints.collections.IntIterable

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, spliterator

Von Schnittstelle geerbte Methoden speiger.src.collections.ints.queues.IntPriorityDequeue

enqueueAllFirst, enqueueAllFirst, last, synchronizeQueue, synchronizeQueue

Von Schnittstelle geerbte Methoden speiger.src.collections.ints.queues.IntPriorityQueue

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

Methodendetails

enqueueFirst

public void enqueueFirst(int e)

Beschreibung aus Schnittstelle kopiert: IntPriorityDequeue

Method to insert a element into the first Index instead of the last.

Angegeben von:

enqueueFirst in Schnittstelle IntPriorityDequeue

Parameter:

e - the element that should be inserted into the first place

enqueueAllFirst

public void enqueueAllFirst(int[] e,
 int offset,
 int length)

Beschreibung aus Schnittstelle kopiert: IntPriorityDequeue

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

Angegeben von:

enqueueAllFirst in Schnittstelle IntPriorityDequeue

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

public void enqueueAllFirst(IntCollection c)

Beschreibung aus Schnittstelle kopiert: IntPriorityDequeue

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

Angegeben von:

enqueueAllFirst in Schnittstelle IntPriorityDequeue

Parameter:

c - the elements that should be inserted from the Collection

dequeueLast

public int dequeueLast()

Beschreibung aus Schnittstelle kopiert: IntPriorityDequeue

A Method to remove a element from the last place instead of the first

Angegeben von:

dequeueLast in Schnittstelle IntPriorityDequeue

Gibt zurück:

the last element inserted

copy

public IntPriorityDequeue copy()

Beschreibung aus Schnittstelle kopiert: IntPriorityQueue

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 IntPriorityDequeue

Angegeben von:

copy in Schnittstelle IntPriorityQueue

Setzt außer Kraft:

copy in Klasse IntPriorityQueues.SynchronizedPriorityQueue

Gibt zurück:

a Shallow Copy of the PriorityQueue