Struct BoundedHistory 

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

Count- and payload-bounded heap history of consumer-owned structured rows.

Oldest rows are evicted first. Iteration borrows immutable rows in append order and can be reversed for newest-first views. No Clone bound is needed. There is no clock, timestamp ordering, sequence identity, truncation, codec, checkpoint or global recorder. Consumers retain sanitization, field bounds, privacy, synchronization and lifecycle; this is not a durable byte format. Interior-mutability payloads must not grow their charged content while retained.

Implementations

impl<T> BoundedHistory<T>

pub const fn new(limits: HistoryLimits) -> Self

Construct an empty history without allocating.

pub fn append( &mut self, value: T, payload_bytes: usize, ) -> Result<HistoryAppend, HistoryRejection<T>>

Append one pre-admitted payload, evicting oldest rows until both bounds fit.

Work is bounded by the configured retained row count. Payload charges are stored at admission and are not recomputed during eviction.

Errors

Returns the original input when disabled or individually oversized. Refusal changes neither retained rows nor payload accounting.

pub fn entries( &self, ) -> impl DoubleEndedIterator<Item = &T> + ExactSizeIterator + '_

Borrow rows oldest first; reverse the iterator for newest-first projection.

pub const fn retained_payload_bytes(&self) -> usize

Current sum of caller-accounted retained payload bytes.

pub const fn limits(&self) -> HistoryLimits

Immutable consumer-selected bounds.

pub fn clear(&mut self)

Drop all retained rows and charges, preserving limits. This establishes no instance/reset identity.

Trait Implementations

impl<T: Clone> Clone for BoundedHistory<T>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for BoundedHistory<T>

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

Formats the value using the given formatter.