Struct MessagesRing 

pub struct MessagesRing { /* private fields */ }

Bounded chronological ring of every echo the editor has emitted. Push on every set_message; snapshot on demand for :messages open and live refresh. Capacity is fixed at construction; once full, the oldest entry drops to make room for the newest.

Implementations

impl MessagesRing

pub fn with_capacity(capacity: usize) -> Self

Construct an empty ring with the given capacity. 0 is normalised via max(1) so push never silently drops every record.

pub fn push(&mut self, record: MessageRecord)

Append a record. Evicts the oldest entry when at capacity. O(1) amortized; the ring is bounded so a flood of messages stays at a fixed memory ceiling.

pub fn records(&self) -> &VecDeque<MessageRecord>

Borrow the records in chronological order (oldest first). Renderers walk this for the transcript view.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn capacity(&self) -> usize

Trait Implementations

impl Clone for MessagesRing

fn clone(&self) -> MessagesRing

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MessagesRing

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

Formats the value using the given formatter.

impl Default for MessagesRing

fn default() -> Self

Returns the “default value” for a type.