Struct PriorityDispatcher 

pub struct PriorityDispatcher<T> { /* private fields */ }

Priority dispatcher backed by a max-heap keyed on SlaClass::dispatch_priority.

Enqueue from any tier; dequeue always returns the highest-priority item. Within the same priority, items are returned in FIFO order based on the monotonic insertion sequence.

use oxirs_core::sla::{SlaClass, PriorityDispatcher};

let mut dispatcher: PriorityDispatcher<&str> = PriorityDispatcher::new();
dispatcher.enqueue("bronze_tenant".into(), SlaClass::Bronze, "low-pri query");
dispatcher.enqueue("platinum_tenant".into(), SlaClass::Platinum, "high-pri query");

// Platinum is dequeued first
let first = dispatcher.dequeue().expect("dispatcher has at least one entry");
assert_eq!(first.payload, "high-pri query");

Implementations

impl<T> PriorityDispatcher<T>

pub fn new() -> PriorityDispatcher<T>

Create an empty dispatcher.

pub fn enqueue(&mut self, tenant_id: String, sla: SlaClass, payload: T)

Enqueue a query for tenant_id at the priority of sla.

pub fn dequeue(&mut self) -> Option<PrioritizedQuery<T>>

Dequeue the highest-priority query, or None if the queue is empty.

pub fn peek(&self) -> Option<&PrioritizedQuery<T>>

Peek at the highest-priority query without removing it.

pub fn len(&self) -> usize

Return the number of queued items.

pub fn is_empty(&self) -> bool

Return true when the queue has no items.

pub fn drain_ordered(&mut self) -> Vec<PrioritizedQuery<T>>

Drain all items in priority order (highest first).

Trait Implementations

impl<T> Default for PriorityDispatcher<T>

fn default() -> PriorityDispatcher<T>

Returns the “default value” for a type.