Modul speiger.src.collections

Package speiger.src.collections.ints.queues

package speiger.src.collections.ints.queues

Klasse	Beschreibung
AbstractIntPriorityQueue	Helper class that implements all the essential methods for the PriorityQueues
IntArrayFIFOQueue	A Simple First In First Out Priority Queue that is a Good Replacement for a linked list (or ArrayDequeue) Its specific implementation uses a backing array that grows and shrinks as it is needed.
IntArrayPriorityQueue	A Array Priority Queue, this is a very unoptimized implementation of the PriorityQueue for very specific usecases.
IntHeapPriorityQueue	A Simple Heap base Priority Queue implementation It is a ArrayBased Alternative to TreeSets that has less object allocations
IntPriorityDequeue	A Type Speciifc PriorityDeque or Dequeue interface to allow implementations like FIFO queues.
IntPriorityQueue	A Simple PriorityQueue (or Queue) interface that provides with the nessesary functions to interact with it, without cluttering with the Collection interface.