| Interface | Description |
|---|---|
| BytePriorityDequeue |
A Type Speciifc PriorityDeque or Dequeue interface to allow implementations like FIFO queues.
|
| BytePriorityQueue |
A Simple PriorityQueue (or Queue) interface that provides with the nessesary functions to interact with it, without cluttering with the Collection interface.
|
| Class | Description |
|---|---|
| AbstractBytePriorityQueue |
Helper class that implements all the essential methods for the PriorityQueues
|
| ByteArrayFIFOQueue |
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.
|
| ByteArrayPriorityQueue |
A Array Priority Queue, this is a very unoptimized implementation of the PriorityQueue for very specific usecases.
|
| ByteHeapPriorityQueue |
A Simple Heap base Priority Queue implementation
It is a ArrayBased Alternative to TreeSets that has less object allocations
|