| Interface | Description |
|---|---|
| IQueue<E> |
created by
cspfrederick and garethhalladay Fall17 inspired by Chris Wilcox |
| Class | Description |
|---|---|
| AQueue<E> |
AQueue provides default implementations for several no-brainer methods in the IQueue interface.
|
| ArrayQueue<E> |
ArrayQueue is a FIFO (First In First Out) data structure that stores its elements
in an array (or something like it, like an
ArrayList). |
| Eval | |
| LinkedQueue<E> |
LinkedQueue is a FIFO (First In First Out) data structure that stores its elements
in non-contiguous chunks of memory that reference one another, forming a linked list.
|
| Plan | |
| QueueTestProgram |
QueueTestProgram tests IQueue instances for correctness by comparing their behavior
to ArrayBlockingQueue as a reference implementation.
|
| ResizingArrayQueue<E> |
ResizingArrayQueue is a modification to
ArrayQueue that is space efficient
at various sizes. |
| Script | |
| Shrink |