Struct PeerRequestQueue 

pub struct PeerRequestQueue { /* private fields */ }

Priority-based work queue for peer requests.

Requests are placed into per-priority FIFO sub-queues stored in a BTreeMap. On dequeue, the highest non-empty priority level is drained first (Critical → High → Normal → Low).

Implementations

impl PeerRequestQueue

pub fn new() -> Self

Create a new, empty queue.

pub fn enqueue( &mut self, peer_id: &str, priority: RequestPriority, payload_size: u64, ) -> u64

Enqueue a new request and return its unique identifier.

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

Pop the highest-priority request (FIFO within each level).

Returns None when every sub-queue is empty.

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

Peek at the highest-priority request without removing it.

pub fn len(&self) -> usize

Total number of requests across all priority levels.

pub fn is_empty(&self) -> bool

Returns true when the queue contains no requests.

pub fn drain_priority(&mut self, priority: RequestPriority) -> Vec<PeerRequest>

Remove and return all requests at the given priority level.

pub fn cancel(&mut self, request_id: u64) -> bool

Cancel a specific request by its unique identifier.

Returns true if the request was found and removed.

pub fn tick(&mut self)

Advance the logical clock by one tick.

pub fn count_by_priority(&self, priority: RequestPriority) -> usize

Number of pending requests at the given priority level.

pub fn total_payload_bytes(&self) -> u64

Sum of payload_size across all pending requests.

pub fn stats(&self) -> PriorityQueueStats

Snapshot of current queue statistics.

Trait Implementations

impl Default for PeerRequestQueue

fn default() -> Self

Returns the “default value” for a type.