Package | Description |
---|---|
net.automatalib.commons.smartcollections |
Modifier and Type | Interface and 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.
|
Modifier and Type | Class and 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.
|
Copyright © 2015. All Rights Reserved.