| Class and Description |
|---|
| AbstractBasicLinkedListEntry
Abstract base class for entries in a linked list.
|
| AbstractLinkedList
Abstract base class for linked lists.
|
| AbstractSmartCollection
This class eases the implementation of the
SmartCollection interface. |
| ArrayStorage
A thin wrapper around a simple
Object[] array. |
| BinaryHeap
A
PriorityQueue implementation using a binary heap. |
| 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.
|
| 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.
|
Copyright © 2020. All rights reserved.