Modul speiger.src.collections

Package speiger.src.collections.longs.utils

Klasse LongPriorityQueues.SynchronizedPriorityDequeue

java.lang.Object

speiger.src.collections.longs.utils.LongPriorityQueues.SynchronizedPriorityQueue

speiger.src.collections.longs.utils.LongPriorityQueues.SynchronizedPriorityDequeue

Alle implementierten Schnittstellen:

Iterable<Long>, LongIterable, LongPriorityDequeue, LongPriorityQueue

Umschließende Klasse:

LongPriorityQueues

public static class LongPriorityQueues.SynchronizedPriorityDequeue
extends LongPriorityQueues.SynchronizedPriorityQueue
implements LongPriorityDequeue

Wrapper class for synchronization

Methodenübersicht

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

Von Klasse geerbte Methoden speiger.src.collections.longs.utils.LongPriorityQueues.SynchronizedPriorityQueue

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

Von Klasse geerbte Methoden java.lang.Object

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

Von Schnittstelle geerbte Methoden speiger.src.collections.longs.collections.LongIterable

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.longs.queues.LongPriorityDequeue

enqueueAllFirst, enqueueAllFirst, last, synchronizeQueue, synchronizeQueue

Von Schnittstelle geerbte Methoden speiger.src.collections.longs.queues.LongPriorityQueue

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

Methodendetails

enqueueFirst

public void enqueueFirst(long e)

Beschreibung aus Schnittstelle kopiert: LongPriorityDequeue

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

Angegeben von:

enqueueFirst in Schnittstelle LongPriorityDequeue

Parameter:

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

enqueueAllFirst

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

Beschreibung aus Schnittstelle kopiert: LongPriorityDequeue

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

Angegeben von:

enqueueAllFirst in Schnittstelle LongPriorityDequeue

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

Beschreibung aus Schnittstelle kopiert: LongPriorityDequeue

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

Angegeben von:

enqueueAllFirst in Schnittstelle LongPriorityDequeue

Parameter:

c - the elements that should be inserted from the Collection

dequeueLast

public long dequeueLast()

Beschreibung aus Schnittstelle kopiert: LongPriorityDequeue

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

Angegeben von:

dequeueLast in Schnittstelle LongPriorityDequeue

Gibt zurück:

the last element inserted

copy

public LongPriorityDequeue copy()

Beschreibung aus Schnittstelle kopiert: LongPriorityQueue

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 LongPriorityDequeue

Angegeben von:

copy in Schnittstelle LongPriorityQueue

Setzt außer Kraft:

copy in Klasse LongPriorityQueues.SynchronizedPriorityQueue

Gibt zurück:

a Shallow Copy of the PriorityQueue