Struct SharedDynamicScheduler 

pub struct SharedDynamicScheduler(/* private fields */);

Thread-safe, reference-counted wrapper around DynamicPriorityScheduler.

Cheaply cloneable – clones share the same underlying queue.

Implementations

impl SharedDynamicScheduler

pub fn new() -> Self

Create a new, empty shared scheduler.

pub fn push(&self, task_id: TaskId, priority: Priority) -> PriorityHandle

Push a task. Returns a PriorityHandle that allows later reprioritization.

pub fn pop(&self) -> Option<TaskId>

Pop the next task.

pub fn peek(&self) -> Option<(TaskId, Priority)>

Peek at the next task without removing it.

pub fn reprioritize(&self, task_id: TaskId, new_priority: Priority) -> bool

Reprioritize a task by id. Returns false if the task is no longer queued.

pub fn peek_priority(&self, task_id: TaskId) -> Option<Priority>

Query the current priority of a queued task.

pub fn remove(&self, task_id: TaskId) -> bool

Remove a task from the queue (e.g., on cancellation).

pub fn len(&self) -> usize

Number of queued tasks.

pub fn is_empty(&self) -> bool

true if the queue is empty.

pub fn snapshot(&self) -> Vec<(TaskId, Priority)>

Snapshot of all queued tasks in priority order.

Trait Implementations

impl Clone for SharedDynamicScheduler

fn clone(&self) -> SharedDynamicScheduler

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Default for SharedDynamicScheduler

fn default() -> Self

Returns the “default value” for a type.