speiger.src.collections.doubles.queues

Interface DoublePriorityDequeue

All Superinterfaces:

DoubleIterable, DoublePriorityQueue, java.lang.Iterable<java.lang.Double>

All Known Implementing Classes:

DoubleArrayFIFOQueue, DoubleLinkedList, DoublePriorityQueues.SynchronizedPriorityDequeue

public interface DoublePriorityDequeue
extends DoublePriorityQueue

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

Method Summary

Modifier and Type	Method and Description
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
default void	enqueueAllFirst(double... e) Method to mass insert a elements into the first Index of the PriorityDequeue.
default void	enqueueAllFirst(double[] e, int length) Method to mass insert a elements into the first Index of the PriorityDequeue.
default void	enqueueAllFirst(double[] e, int offset, int length) Method to mass insert a elements into the first Index of the PriorityDequeue.
default 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.
default double	last() Peeking function for the last element
default DoublePriorityDequeue	synchronizeQueue() Creates a Wrapped PriorityDequeue that is Synchronized
default DoublePriorityDequeue	synchronizeQueue(java.lang.Object mutex) Creates a Wrapped PriorityDequeue that is Synchronized

Methods inherited from interface speiger.src.collections.doubles.queues.DoublePriorityQueue

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

Methods inherited from interface 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

Method Detail

enqueueFirst

void enqueueFirst(double e)

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

Parameters:

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

enqueueAllFirst

default void enqueueAllFirst(double... e)

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

Parameters:

e - the elements that should be inserted

enqueueAllFirst

default void enqueueAllFirst(double[] e,
                             int length)

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

Parameters:

e - the elements that should be inserted

length - the amount of elements that should be inserted

enqueueAllFirst

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

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

Parameters:

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

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

Parameters:

c - the elements that should be inserted from the Collection

dequeueLast

double dequeueLast()

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

Returns:

the last element inserted

Throws:

java.util.NoSuchElementException - if no element is in the deque

last

default double last()

Peeking function for the last element

Returns:

the Last Element within the dequeue without deleting it

synchronizeQueue

default DoublePriorityDequeue synchronizeQueue()

Creates a Wrapped PriorityDequeue that is Synchronized

Specified by:

synchronizeQueue in interface DoublePriorityQueue

Returns:

a new PriorityDequeue that is synchronized

See Also:

DoublePriorityQueues.synchronize(speiger.src.collections.doubles.queues.DoublePriorityQueue)

synchronizeQueue

default DoublePriorityDequeue synchronizeQueue(java.lang.Object mutex)

Creates a Wrapped PriorityDequeue that is Synchronized

Specified by:

synchronizeQueue in interface DoublePriorityQueue

Parameters:

mutex - is the controller of the synchronization block

Returns:

a new PriorityDequeue Wrapper that is synchronized

See Also:

DoublePriorityQueues.synchronize(speiger.src.collections.doubles.queues.DoublePriorityQueue)

copy

DoublePriorityDequeue copy()

Description copied from interface: 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

Specified by:

copy in interface DoublePriorityQueue

Returns:

a Shallow Copy of the PriorityQueue