abstract class Quartz::PriorityQueue(T)

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

Overview

A PriorityQueue is the base class to implement a planning strategy for all future events to be evaluated. Events should be dequeued in a strict order of precedence, according to their associated priority.

The priority is represented by the Duration data type, which represent a planned phase, an offset from the beginning of the current epoch relative to the current simulated time.

It is internally used by the pending event set EventSet.

Direct Known Subclasses

• Quartz::BinaryHeap(T)
• Quartz::FibonacciHeap(T)
• Quartz::HeapSet(T)

Defined in:

quartz/event_set.cr

Constructors

• .new(priority_queue : Symbol, &comparator : Duration, Duration, Bool -> Int32) : self
• .new(&)

Instance Method Summary

• #clear
• #delete(priority : Duration, value : T) : T?
• #empty? : Bool
• #next_priority : Duration
• #peek : T
• #peek? : T?
• #pop : T
• #pop_imminents(&)
• #push(priority : Duration, value : T)
• #size : Int

Constructor Detail

Instance Method Detail