Uses of Interface
net.automatalib.common.smartcollection.SmartCollection

Packages that use SmartCollection

Package	Description
net.automatalib.common.smartcollection	This package contains efficient implementations for various collection data structures (especially linked lists and priority queues), which have very insufficient implementation in the Java Collections Framework that makes it hard or even impossible to exploit their efficiencies.

Uses of SmartCollection in net.automatalib.common.smartcollection

Subinterfaces of SmartCollection in net.automatalib.common.smartcollection

Modifier and Type	Interface	Description
interface	SmartDeque<E>	A double-ended queue (deque), allowing access, removal and insertion of elements both at the beginning and the end.
interface	SmartDynamicPriorityQueue<E>	A priority queue interface.
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.
interface	SmartPriorityQueue<E>	Priority queue interface.
interface	SmartSequence<E>	Sequence interface.

Classes in net.automatalib.common.smartcollection that implement SmartCollection

Modifier and Type	Class	Description
class	AbstractLinkedList<E,T extends LinkedListEntry<E,T>>	Abstract base class for linked lists.
class	AbstractSmartCollection<E>	This class eases the implementation of the SmartCollection interface.
class	BackedGeneralPriorityQueue<E,K extends Comparable<K>>	A SmartGeneralPriorityQueue implementation that is backed by a SmartDynamicPriorityQueue.
class	BinaryHeap<E>	A PriorityQueue implementation using a binary heap.
class	DefaultLinkedList<E>	A simple linked list implementation that allows storing arbitrary elements.
class	IntrusiveLinkedList<T extends LinkedListEntry<T,T>>	An intrusive version of a linked list.
class	UnorderedCollection<E>	This class implements a collection for storing objects in no particular order.