Struct OrderedAppender 

pub struct OrderedAppender { /* private fields */ }

Single-threaded deterministic appender over a RedexFile.

Cheap to construct; holds a cloned RedexFile handle internally.

Implementations

impl OrderedAppender

pub fn new(file: RedexFile) -> OrderedAppender

Wrap a RedexFile. The appender doesn’t hold any exclusive resource; callers who care about determinism should ensure they use only one OrderedAppender per file.

pub fn file(&self) -> &RedexFile

The underlying file. Useful for tail / read_range operations from the same handle.

pub fn append(&self, payload: &[u8]) -> Result<u64, RedexError>

Append one payload (heap segment). Returns the assigned seq. Holds the file’s state lock across seq allocation.

pub fn append_inline(&self, payload: &[u8; 8]) -> Result<u64, RedexError>

Append a fixed 8-byte inline payload. Same ordering contract as Self::append.

pub fn append_batch( &self, payloads: &[Bytes], ) -> Result<Option<u64>, RedexError>

Append a batch. The whole batch lands under one lock hold — seqs are strictly contiguous within the batch AND strictly ordered relative to other ordered writers.

Returns Some(first_seq) on non-empty input, None on empty.

Trait Implementations

impl Clone for OrderedAppender

fn clone(&self) -> OrderedAppender

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for OrderedAppender

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

Formats the value using the given formatter.