Struct Chain 

pub struct Chain { /* private fields */ }

An ordered collection of journal files from the same origin

Files are kept sorted by status and time:

• Disposed files (corrupted) come first
• Archived files follow in chronological order (by head_realtime)
• Active file (if any) comes last

This ordering is maintained automatically by insert_file() and is critical for correct time-range queries.

Implementations

impl Chain

pub fn insert_file(&mut self, file: File)

Insert a file maintaining sorted order (disposed → archived → active)

pub fn remove_file(&mut self, file: &File)

Remove a file from the chain

pub fn pop_front(&mut self) -> Option<File>

pub fn back(&self) -> Option<&File>

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

pub fn drain(&mut self, cutoff_time: u64) -> impl Iterator<Item = File>

Remove files older than cutoff time (microseconds since epoch)

Active files are never drained.

pub fn find_files_in_range<C>( &self, start: Seconds, end: Seconds, files: &mut C, )

where C: Extend<File>,

Find files that overlap with the time range [start, end)

Extends the provided collection with matching files.

Trait Implementations

impl Clone for Chain

fn clone(&self) -> Chain

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Chain

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

Formats the value using the given formatter.

impl Default for Chain

fn default() -> Chain

Returns the “default value” for a type.