Struct TtlQueue 

pub struct TtlQueue<T> { /* private fields */ }

A bounded FIFO queue where each item carries an expiry timestamp.

Expired items are evicted lazily on push, pop, and drain. When the queue is at capacity, the oldest item is dropped on push.

Examples

use ma_core::TtlQueue;

let mut q = TtlQueue::new(8);
let now = 100;
q.push(now, now + 60, "expires in 60s");
q.push(now, 0, "never expires");

// Both present at t=100
assert_eq!(q.drain(now).len(), 2);

Implementations

impl<T> TtlQueue<T>

pub fn new(capacity: usize) -> Self

Create a new queue with the given maximum capacity.

Panics

Panics if capacity is 0.

pub fn push(&mut self, now: u64, expires_at: u64, item: T)

Push an item with an absolute expiry timestamp (Unix epoch seconds).

Pass expires_at = 0 for items that never expire. If the queue is full after eviction, the oldest item is silently dropped.

pub fn pop(&mut self, now: u64) -> Option<T>

Pop the oldest non-expired item, evicting any expired head entries first.

pub fn peek(&mut self, now: u64) -> Option<&T>

Peek at the oldest non-expired item without removing it.

pub fn drain(&mut self, now: u64) -> Vec<T>

Drain all non-expired items, returning them in FIFO order.

pub fn len(&self) -> usize

Number of items currently in the queue (including not-yet-evicted expired items).

pub fn is_empty(&self) -> bool

Whether the queue is empty.

Trait Implementations

impl<T: Clone> Clone for TtlQueue<T>

fn clone(&self) -> TtlQueue<T>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug> Debug for TtlQueue<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.