Struct FileLogStore 

pub struct FileLogStore { /* private fields */ }

File-based log store implementation

Implementations

impl FileLogStore

pub fn new(data_dir: PathBuf) -> Result<Self, Error>

Creates new file-based log store

Trait Implementations

impl Debug for FileLogStore

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

Formats the value using the given formatter.

impl LogStore for FileLogStore

fn persist_entries<'life0, 'async_trait>( &'life0 self, entries: Vec<Entry>, ) -> Pin<Box<dyn Future<Output = Result<(), Error>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Batch persist entries into disk (optimized for sequential writes)

fn entry<'life0, 'async_trait>( &'life0 self, index: u64, ) -> Pin<Box<dyn Future<Output = Result<Option<Entry>, Error>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Get single log entry by index

fn get_entries(&self, range: RangeInclusive<u64>) -> Result<Vec<Entry>, Error>

Get entries in range [start, end] (inclusive)

fn purge<'life0, 'async_trait>( &'life0 self, cutoff_index: LogId, ) -> Pin<Box<dyn Future<Output = Result<(), Error>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Remove logs up to specified index

fn truncate<'life0, 'async_trait>( &'life0 self, from_index: u64, ) -> Pin<Box<dyn Future<Output = Result<(), Error>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Truncates log from specified index onward

fn flush(&self) -> Result<(), Error>

Optional: Flush pending writes (use with caution)

fn flush_async<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = Result<(), Error>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Optional: Flush pending writes (use with caution)

fn reset<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = Result<(), Error>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

fn last_index(&self) -> u64

Get last log index (optimized for frequent access)