Struct SerializeQueue 

pub struct SerializeQueue { /* private fields */ }

Named-FIFO map with per-queue bounded capacity.

Implementations

impl SerializeQueue

pub const DEFAULT_PER_QUEUE_CAP: usize = 4096

Default per-named-queue capacity. 4096 entries balances “deep enough to survive a transient publisher burst” against “small enough to bound the worst-case memory footprint of a single misbehaving key.”

pub fn new() -> Self

Construct a fresh empty map with the default per-queue cap.

pub fn with_per_queue_cap(per_queue_cap: usize) -> Self

Construct with a custom per-queue cap. Useful for edge deployments tightening the bound below the default.

pub fn enqueue(&mut self, name: &str, bytes: Vec<u8>)

Enqueue bytes into the named FIFO. If the FIFO is already at capacity, the OLDEST entry is dropped (FIFO eviction) and the per-key drop counter ticks.

pub fn dequeue(&mut self, name: &str) -> Option<Vec<u8>>

Dequeue from the head of the named FIFO. Returns None if empty.

pub fn len(&self, name: &str) -> usize

Length of the named FIFO (0 if missing).

pub fn drops(&self, name: &str) -> u64

Cumulative drop count for the named FIFO. Observability for queue-overflow conditions.

Trait Implementations

impl Default for SerializeQueue

fn default() -> Self

Returns the “default value” for a type.