| AbstractBasicLinkedListEntry |
Abstract base class for entries in a linked list.
|
| AbstractLinkedList |
Abstract base class for linked lists.
|
| AbstractSmartCollection |
|
| ArrayStorage |
A thin wrapper around a simple Object[] array.
|
| BackedGeneralPriorityQueue.Entry |
Note: this class has a natural ordering that is inconsistent with equals.
|
| BinaryHeap |
|
| CapacityManagement |
Control interface for collections supporting a capacity management, i.e., reserving space in advance in order to
avoid repeated reallocations.
|
| DefaultLinkedListEntry |
The default linked list entry.
|
| ElementReference |
Marker interface for element reference.
|
| IntSeq |
An IntSeq is an abstract read-only view on a finite, random-access data-structure for primitive integer
values. |
| LinkedListEntry |
Basic interface for entries in a linked list.
|
| ResizingArrayStorage |
Class that provides a resizable array storage of a certain type.
|
| SmartCollection |
An extended collection interface.
|
| SmartDynamicPriorityQueue |
A priority queue interface.
|
| SmartGeneralPriorityQueue |
A generalized priority queue which allows storing arbitrary elements that don't have to be comparable, neither by
their natural ordering nor by a provided Comparator. |
| SmartPriorityQueue |
Priority queue interface.
|
| SmartSequence |
Sequence interface.
|
| UnorderedCollection |
This class implements a collection for storing objects in no particular order.
|