|
Class Summary |
| AbstractArray |
|
| AbstractBag |
This abstract class provides a skeleton implementation for bags. |
| AbstractQueue |
|
| ArrayQueue |
ArrayQueue: based on Array AND implementing Array! |
| Arrays |
|
| Container |
A Container is the baseclass for all classes that deal with storing
objects. |
| CounterContainer |
Abstract class following the Decorator design pattern. |
| DecoratorContainer |
Abstract class following the Decorator design pattern. |
| DynamicHeap |
The DynamicHeap uses the ArrayResizer to increase or reduce the size
of the array dynamically. |
| Heap |
The heap datastructure. |
| ListBag |
The class ListBag implements the interface Bag storing elements in a List. |
| ListQueue |
The ArrayQueue extends AbstractQueue using a List
for the internal representation of the data. |
| Lists |
|
| MapContainer |
The MapContainer is a Container that stores elements in a
Map. |
| MapEntry |
This class is a straightforward implementation of Map.Entry from java.util. |
| MappedList |
|
| ReversedList |
|
| StackQueue |
|