|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use goldman.collection.priority | |
---|---|
goldman.collection.positional | A positional collection is a manually positioned collection in which elements are accessed via their position in a line (with 0 being the position of the first element in the line) or via their location relative to other elements in the line. |
goldman.collection.priority | A priority queue is an untagged algorithmically positioned collection of comparable elements in which there can be equivalent elements. |
goldman.collection.tagged.priority | A tagged priority queue is the tagged version of a priority queue. |
Classes in goldman.collection.priority used by goldman.collection.positional | |
---|---|
PriorityQueue
A priority queue is an untagged algorithmically positioned collection of comparable elements in which there can be equivalent elements. |
Classes in goldman.collection.priority used by goldman.collection.priority | |
---|---|
LeftistHeap
The leftist heap is a fairly simple implementation that supports merge in logarithmic time. |
|
PairingHeap
The pairing heap is a simple self-organizing data structure in which the amortized cost for add , merge , and
remove through a tracker are all logarithmic. |
|
PriorityQueue
A priority queue is an untagged algorithmically positioned collection of comparable elements in which there can be equivalent elements. |
|
PriorityQueueLocator
The PriorityQueueLocator interface
extends the Locator interface to add methods that are
specific to a priority queue. |
Classes in goldman.collection.priority used by goldman.collection.tagged.priority | |
---|---|
PriorityQueueLocator
The PriorityQueueLocator interface
extends the Locator interface to add methods that are
specific to a priority queue. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |