Struct TaskQueue 

pub struct TaskQueue { /* private fields */ }

A priority-based task queue for distributed task scheduling.

Tasks are dequeued in priority order; within the same priority, tasks follow FIFO ordering based on their enqueue sequence.

Implementations

impl TaskQueue

pub fn new() -> Self

Creates a new empty task queue.

pub fn with_capacity(max_capacity: usize) -> Self

Creates a new task queue with a capacity limit.

pub fn enqueue(&mut self, task: DistributedTask) -> bool

Enqueues a task. Returns false if the queue is at capacity.

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

Dequeues the highest-priority task.

Returns None if the queue is empty.

pub fn peek(&self) -> Option<&DistributedTask>

Peeks at the highest-priority task without removing it.

pub fn len(&self) -> usize

Returns the number of tasks in the queue.

pub fn is_empty(&self) -> bool

Returns true if the queue is empty.

pub fn total_enqueued(&self) -> u64

Returns total tasks ever enqueued.

pub fn total_dequeued(&self) -> u64

Returns total tasks ever dequeued.

pub fn drain(&mut self) -> Vec<DistributedTask>

Drains all tasks from the queue in priority order.

pub fn remove_expired(&mut self, now: i64) -> Vec<DistributedTask>

Removes tasks that have passed their deadline.

Trait Implementations

impl Debug for TaskQueue

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

Formats the value using the given formatter.

impl Default for TaskQueue

fn default() -> Self

Returns the “default value” for a type.