Uses of Interface
net.automatalib.common.smartcollection.SmartPriorityQueue
-
Packages that use SmartPriorityQueue 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 SmartPriorityQueue in net.automatalib.common.smartcollection
Subinterfaces of SmartPriorityQueue in net.automatalib.common.smartcollection Modifier and Type Interface Description 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 providedComparator
.Classes in net.automatalib.common.smartcollection that implement SmartPriorityQueue Modifier and Type Class Description class
BackedGeneralPriorityQueue<E,K extends Comparable<K>>
ASmartGeneralPriorityQueue
implementation that is backed by aSmartDynamicPriorityQueue
.class
BinaryHeap<E>
APriorityQueue
implementation using a binary heap.
-