class

Quartz::FibonacciHeap(T)

Inherits Quartz::PriorityQueue / Reference / Object

Event set implemented as a Fibonacci Heap, as described by Fredman and Tarjan.

Structured as a collection of root trees that are min-heap ordered, and internally represented as a circular, doubly-linked list.

Constructors

new
Source

Instance methods

clear

Clears self.

Source
delete(priority : Duration, value : T) : T
Source
empty?

Whether the event set is empty or not.

Source
inspect(io)
Source
next_priority
Source
peek
Source
peek?
Source
pop

Dequeue and return the min element.

Source
push(priority : Duration, value : T)

Insert the given value with the specified priority into self..

Source
size

Returns the number of elements in the heap.

Source