Package speiger.src.collections.chars.queues

Interface Summary

Interface	Description
CharPriorityDequeue	A Type Speciifc PriorityDeque or Dequeue interface to allow implementations like FIFO queues.
CharPriorityQueue	A Simple PriorityQueue (or Queue) interface that provides with the nessesary functions to interact with it, without cluttering with the Collection interface.

Class Summary

Class	Description
AbstractCharPriorityQueue	Helper class that implements all the essential methods for the PriorityQueues
CharArrayFIFOQueue	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.
CharArrayPriorityQueue	A Array Priority Queue, this is a very unoptimized implementation of the PriorityQueue for very specific usecases.
CharHeapPriorityQueue	A Simple Heap base Priority Queue implementation It is a ArrayBased Alternative to TreeSets that has less object allocations