Struct PendingQueue 

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

Mutex-wrapped pending queue. T is the engine-specific pending entry (e.g. PendingVectorInsert).

Implementations

impl<T> PendingQueue<T>

pub const fn new() -> Self

pub fn push(&self, item: T)

Append a new pending entry to the tail of the queue.

pub fn drain(&self) -> Vec<T>

Take every pending entry and reset the queue. Callers retain the returned vec until they receive ACKs.

pub fn requeue(&self, item: T)

Re-queue an entry at the head so it is retried before fresh writes on the next drain cycle. Used on transport reject.

pub fn retain<F>(&self, predicate: F)

where F: FnMut(&T) -> bool,

Drop entries matching predicate (used by ACK paths that key off batch_id or collection name).

pub fn with_first_mut<P, F, R>(&self, predicate: P, f: F) -> Option<R>

where P: FnMut(&T) -> bool, F: FnOnce(&mut T) -> R,

Run f on the first entry that matches predicate, returning its result. Used by engines (columnar, timeseries) that coalesce rows for the same collection into one open batch.

Returns None if no entry matches (or the lock is poisoned).

pub fn len(&self) -> usize

Number of pending entries (best-effort; returns 0 on lock poison).

pub fn is_empty(&self) -> bool

Trait Implementations

impl<T: Debug> Debug for PendingQueue<T>

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

Formats the value using the given formatter.

impl<T> Default for PendingQueue<T>

fn default() -> Self

Returns the “default value” for a type.