Interface | Description |
---|---|
CapacityManagement |
Control interface for collections supporting a capacity management, i.e., reserving
space in advance in order to avoid repeated reallocations.
|
ElementReference |
Marker interface for element reference.
|
LinkedListEntry<E,T extends LinkedListEntry<E,T>> |
Basic interface for entries in a linked list.
|
SmartCollection<E> |
An extended collection interface.
|
SmartDeque<E> |
A double-ended queue (deque), allowing access, removal and insertion
of elements both at the beginning and the end.
|
SmartDynamicPriorityQueue<E> |
A priority queue interface.
|
SmartGeneralPriorityQueue<E,K extends Comparable<K>> |
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<E> |
Priority queue interface.
|
SmartSequence<E> |
Sequence interface.
|
Class | Description |
---|---|
AbstractLinkedList<E,T extends LinkedListEntry<E,T>> |
Abstract base class for linked lists.
|
AbstractSmartCollection<E> |
This class eases the implementation of the
SmartCollection
interface. |
BackedGeneralPriorityQueue<E,K extends Comparable<K>> |
A
SmartGeneralPriorityQueue implementation that is backed by a
SmartDynamicPriorityQueue . |
BasicLinkedListEntry<E,T extends BasicLinkedListEntry<E,T>> |
Abstract base class for entries in a linked list.
|
BinaryHeap<E> |
A
PriorityQueue implementation using a binary heap. |
DefaultLinkedList<E> |
A simple linked list implementation that allows storing
arbitrary elements.
|
DefaultLinkedListEntry<E> |
The default linked list entry.
|
IntrusiveLinkedList<T extends LinkedListEntry<T,T>> |
An intrusive version of a linked list.
|
UnorderedCollection<E> |
This class implements a collection for storing objects in no
particular order.
|
Exception | Description |
---|---|
InvalidReferenceException |
Exception that is thrown if an invalid
ElementReference is used. |
Copyright © 2015. All rights reserved.