Modul speiger.src.collections

Package speiger.src.collections.doubles.utils

Klasse DoublePriorityQueues.SynchronizedPriorityDequeue

java.lang.Object

speiger.src.collections.doubles.utils.DoublePriorityQueues.SynchronizedPriorityQueue

speiger.src.collections.doubles.utils.DoublePriorityQueues.SynchronizedPriorityDequeue

Alle implementierten Schnittstellen:

Iterable<Double>, DoubleIterable, DoublePriorityDequeue, DoublePriorityQueue

Umschließende Klasse:

DoublePriorityQueues

public static class DoublePriorityQueues.SynchronizedPriorityDequeue
extends DoublePriorityQueues.SynchronizedPriorityQueue
implements DoublePriorityDequeue

Wrapper class for synchronization

Methodenübersicht

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

Von Klasse geerbte Methoden speiger.src.collections.doubles.utils.DoublePriorityQueues.SynchronizedPriorityQueue

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

Von Klasse geerbte Methoden java.lang.Object

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

Von Schnittstelle geerbte Methoden speiger.src.collections.doubles.collections.DoubleIterable

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.doubles.queues.DoublePriorityDequeue

enqueueAllFirst, enqueueAllFirst, last, synchronizeQueue, synchronizeQueue

Von Schnittstelle geerbte Methoden speiger.src.collections.doubles.queues.DoublePriorityQueue

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

Methodendetails

enqueueFirst

public void enqueueFirst(double e)

Beschreibung aus Schnittstelle kopiert: DoublePriorityDequeue

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

Angegeben von:

enqueueFirst in Schnittstelle DoublePriorityDequeue

Parameter:

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

enqueueAllFirst

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

Beschreibung aus Schnittstelle kopiert: DoublePriorityDequeue

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

Angegeben von:

enqueueAllFirst in Schnittstelle DoublePriorityDequeue

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(DoubleCollection c)

Beschreibung aus Schnittstelle kopiert: DoublePriorityDequeue

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

Angegeben von:

enqueueAllFirst in Schnittstelle DoublePriorityDequeue

Parameter:

c - the elements that should be inserted from the Collection

dequeueLast

public double dequeueLast()

Beschreibung aus Schnittstelle kopiert: DoublePriorityDequeue

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

Angegeben von:

dequeueLast in Schnittstelle DoublePriorityDequeue

Gibt zurück:

the last element inserted

copy

public DoublePriorityDequeue copy()

Beschreibung aus Schnittstelle kopiert: DoublePriorityQueue

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 DoublePriorityDequeue

Angegeben von:

copy in Schnittstelle DoublePriorityQueue

Setzt außer Kraft:

copy in Klasse DoublePriorityQueues.SynchronizedPriorityQueue

Gibt zurück:

a Shallow Copy of the PriorityQueue