class Quartz::BinaryHeap(T)

• Quartz::BinaryHeap(T)
• Quartz::PriorityQueue(T)
• Reference
• Object

Overview

Event set implemented as an array-based heap.

Each inserted elements is given a certain priority, based on the result of the comparison. This is a min-heap, which means retrieving an element will always return the one with the highest priority.

To avoid O(n) complexity when deleting an arbitrary element, a map is used to store indices for each element in the event set.

Defined in:

Constructors

• .new(initial_capacity : Int, &comparator : Duration, Duration, Bool -> Int32)
• .new(&comparator : Duration, Duration, Bool -> Int32)

  Creates a new empty BinaryHeap.

Instance Method Summary

• #==(other) : Bool

  Returns false (other can only be a Value here).

• #==(other : BinaryHeap) : Bool
• #clear
• #delete(priority : Duration, event : T) : T?
• #empty? : Bool
• #heapify!
• #inspect(io)
• #next_priority : Duration
• #next_priority(&)
• #peek : T
• #peek(&)
• #peek? : T?
• #pop : T
• #push(priority : Duration, value : T) : self
• #size : Int32

  Returns the number of elements in the heap.

• #to_a : Array(Tuple(Duration, T))
• #to_slice : Slice(Tuple(Duration, T))

Constructor Detail

Instance Method Detail