Enum PriorityQueueType

pub enum PriorityQueueType {
    BinaryHeap,
    HandleBased,
}

Specifies the underlying priority queue implementation used by the scheduler.

Choosing the right type affects dependency count and scheduler capabilities, particularly around job cancellation and updates.

Variants

BinaryHeap

Uses std::collections::BinaryHeap.

• Dependencies: Standard library only.
• Cancellation: Job cancellation checks happen lazily when a job instance reaches the front of the queue.
• Updates: Efficient updates of already scheduled job times are not supported.
• Recommendation: Suitable for basic scheduling needs where proactive cancellation or job updates are not required, and minimizing dependencies is preferred.

HandleBased

Uses the priority-queue crate, providing handles to queued items.

• Dependencies: Adds the priority-queue crate.
• Cancellation: Supports efficient O(log n) proactive removal of cancelled job instances directly from the queue via TurnKeeper::cancel_job.
• Updates: Enables potential future features or direct support for efficiently updating the next_run time of an already scheduled job instance.
• Recommendation: Suitable if more responsive cancellation (proactive removal) or the ability to update scheduled job times is desired.

Trait Implementations

impl Clone for PriorityQueueType

fn clone(&self) -> PriorityQueueType

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PriorityQueueType

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for PriorityQueueType

fn eq(&self, other: &PriorityQueueType) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for PriorityQueueType

impl Eq for PriorityQueueType

impl StructuralPartialEq for PriorityQueueType