Struct RtPrioQueue 

struct RtPrioQueue {
    list: LinkedList<RtTaskAdapter>,
    len: usize,
}

Single-priority FIFO backed by an intrusive doubly-linked list.

Fields

list: LinkedList<RtTaskAdapter>

len: usize

Implementations

impl RtPrioQueue

fn new() -> Self

fn push_back(&mut self, task: Arc<Task>)

fn pop_front(&mut self) -> Option<Arc<Task>>

fn is_empty(&self) -> bool

fn remove_by_id(&mut self, task_id: TaskId) -> bool

Remove the first task with task_id. Returns true when found.

O(n) scan, but no allocation. In practice each priority queue is short (a handful of RT threads), so the scan terminates quickly.