Struct SlowQueryStore 

pub struct SlowQueryStore { /* private fields */ }

Bounded ring buffer holding the most-recent cap slow-query events.

Thread-safe via a Mutex<VecDeque>. The lock is held only for above-threshold, sampled events so contention is minimal.

Implementations

impl SlowQueryStore

pub fn new(cap: usize) -> Arc<SlowQueryStore>

pub fn push(&self, event: SlowQueryEvent)

Append an event; evicts the oldest record when the ring is at capacity.

pub fn read(&self, filter: &SlowQueryFilter) -> Vec<SlowQueryEvent>

Return recent events, most-recent first, applying filter.

This is the pure read-model layer; it never touches the filesystem and holds the lock only for the duration of the linear scan.

pub fn len(&self) -> usize

Number of events currently in the ring.

pub fn is_empty(&self) -> bool