Struct QueueStore 

pub struct QueueStore { /* private fields */ }

Core queue data structure supporting FIFO, LIFO, and priority modes.

Implementations

impl QueueStore

pub fn new(max_size: usize) -> Self

Create a new FIFO queue

pub fn new_priority(max_size: usize) -> Self

Create a priority queue

pub fn push_back( &mut self, payload: Value, priority: Option<i32>, ) -> Result<u64, QueueError>

Push a message to the back (RPUSH). Returns the sequence number.

pub fn push_front( &mut self, payload: Value, priority: Option<i32>, ) -> Result<u64, QueueError>

Push a message to the front (LPUSH). Returns the sequence number.

pub fn pop_front(&mut self) -> Option<QueueMessage>

Pop from the front (LPOP) — FIFO dequeue. For priority queues, pops highest priority.

pub fn pop_back(&mut self) -> Option<QueueMessage>

Pop from the back (RPOP) — LIFO dequeue

pub fn peek_front(&self, count: usize) -> Vec<&QueueMessage>

Peek at the front message without removing it

pub fn len(&self) -> usize

Number of messages in the queue

pub fn is_empty(&self) -> bool

Whether the queue is empty

pub fn is_full(&self) -> bool

Whether the queue is full

pub fn purge(&mut self) -> usize

Remove all messages

pub fn get(&self, seq: u64) -> Option<&QueueMessage>

Get a message by sequence number (for ack/nack)

pub fn remove(&mut self, seq: u64) -> Option<QueueMessage>

Remove a specific message by sequence (for ack)

pub fn increment_attempts(&mut self, seq: u64) -> Option<u32>

Increment attempt count for a message

pub fn is_priority(&self) -> bool

Whether this is a priority queue

pub fn memory_bytes(&self) -> usize

Approximate memory usage