Struct BoundedQueue 

pub struct BoundedQueue {
    pub backpressure_active: bool,
    /* private fields */
}

A single bounded queue of IndexJobs, ordered by priority then insertion order (RFC-036 §8).

Fields

backpressure_active: bool

Whether backpressure is currently active for this queue.

Implementations

impl BoundedQueue

pub fn new(kind: QueueKind, capacity: usize) -> Self

pub fn kind(&self) -> QueueKind

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn is_full(&self) -> bool

true when the queue has reached its capacity ceiling. Callers must not push when this returns true.

pub fn remaining(&self) -> usize

Remaining capacity.

pub fn capacity(&self) -> usize

pub fn total_pushed(&self) -> u64

pub fn push(&mut self, job: IndexJob)

Push a job into the queue, maintaining priority order.

Ordering invariant

pop_back serves the item at the highest index. To dispatch the highest-priority job first, and within equal priority the oldest job first (FIFO), items must be stored with:

• higher-priority items at higher indices (closer to back), and
• among equal-priority items, older items at higher indices.

Insertion rule

The new job is inserted at the first index (from the back) where the existing item has strictly lower priority than the new job. This places it after (higher index than) all equal-or-higher priority items already in the queue, satisfying both conditions.

Panics if the queue is full — callers must check is_full first.

pub fn pop(&mut self) -> Option<IndexJob>

Pop the highest-priority job (front of the queue).

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

Peek at the highest-priority job without removing it.

pub fn cancel_for_source(&mut self, source_id: &SourceId) -> usize

Cancel all jobs belonging to source_id (RFC-036 §12.3). Returns the number of jobs removed.

pub fn clear(&mut self) -> usize

Drain all jobs (e.g. on full scheduler reset).