Struct CompactMessageVec 

pub struct CompactMessageVec { /* private fields */ }

Sorted message storage with O(log n) lookup by ID.

Messages are stored sorted by timestamp. A separate index provides O(log n) lookup by message ID using binary search.

Implementations

impl CompactMessageVec

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

pub fn len(&self) -> usize

Number of messages

pub fn is_empty(&self) -> bool

pub fn messages(&self) -> &[CompactMessage]

Get all messages (sorted by timestamp)

pub fn messages_mut(&mut self) -> &mut Vec<CompactMessage>

Get a mutable reference to all messages

pub fn iter(&self) -> Iter<'_, CompactMessage>

Iterate over messages (supports .rev())

pub fn iter_mut(&mut self) -> IterMut<'_, CompactMessage>

Iterate over messages mutably

pub fn last(&self) -> Option<&CompactMessage>

Get the last message

pub fn last_timestamp(&self) -> Option<u64>

Get last message timestamp (in milliseconds)

pub fn first(&self) -> Option<&CompactMessage>

Get the first message

pub fn find_by_id(&self, id: &[u8; 32]) -> Option<&CompactMessage>

Find a message by ID using binary search - O(log n)

pub fn find_by_id_mut(&mut self, id: &[u8; 32]) -> Option<&mut CompactMessage>

Find a message by ID (mutable) - O(log n)

pub fn find_by_hex_id(&self, id_str: &str) -> Option<&CompactMessage>

Find a message by ID string (hex or pending) - O(log n)

pub fn find_by_hex_id_mut( &mut self, id_str: &str, ) -> Option<&mut CompactMessage>

Find a message by ID string (mutable) - O(log n)

pub fn contains_id(&self, id: &[u8; 32]) -> bool

Check if a message with the given ID exists - O(log n)

pub fn remove_by_hex_id(&mut self, id_str: &str) -> bool

Remove a message by hex ID string. Returns true if removed.

pub fn contains_hex_id(&self, id_str: &str) -> bool

Check if a message with the given ID string exists - O(log n)

pub fn insert(&mut self, msg: CompactMessage) -> bool

Insert a message, maintaining sort order by timestamp.

Returns true if the message was added, false if duplicate ID.

Performance: O(log n) for append (common case), O(n) for out-of-order insert.

pub fn rebuild_index(&mut self)

Rebuild the ID index (call after bulk modifications)

pub fn insert_batch( &mut self, messages: impl IntoIterator<Item = CompactMessage>, ) -> usize

Batch insert messages - optimized for different scenarios.

Returns the number of messages actually added (excludes duplicates).

Performance:

• Append case (newer msgs): O(k log n) where k = new messages
• Prepend case (older msgs): O(k log n + k)
• Mixed: O(n log n) full sort

pub fn memory_usage(&self) -> usize

Total memory used (approximate)

pub fn drain(&mut self, range: Range<usize>) -> Drain<'_, CompactMessage>

Drain messages from a range (rebuilds index after)

pub fn sort_by_key<K, F>(&mut self, f: F)

where F: FnMut(&CompactMessage) -> K, K: Ord,

Sort messages by a key (rebuilds index after)

pub fn clear(&mut self)

Clear all messages

Trait Implementations

impl Clone for CompactMessageVec

fn clone(&self) -> CompactMessageVec

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CompactMessageVec

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

Formats the value using the given formatter.

impl DeepSize for CompactMessageVec

fn deep_size(&self) -> usize

impl Default for CompactMessageVec

fn default() -> CompactMessageVec

Returns the “default value” for a type.