Struct AppendLogStorage 

pub struct AppendLogStorage<B, T, C = JsonCodec>
where
    B: StorageBackend + ?Sized,
    T: Serialize + DeserializeOwned + Clone + Send + Sync + 'static,
    C: Codec<Vec<T>>,
{ /* private fields */ }

Append-log tier — buffers per-key entries; flush() encodes each bucket as an array via codec and merge-writes it into the backend. Mirrors TS appendLogStorage.

Trait Implementations

impl<B, T, C> AppendLogStorageTier<T> for AppendLogStorage<B, T, C>

where B: StorageBackend + ?Sized, T: Serialize + DeserializeOwned + Clone + Send + Sync + 'static, C: Codec<Vec<T>>,

fn append_entries(&self, entries: &[T]) -> Result<(), StorageError>

Append entries to the per-key buckets (each bucket determined by the tier’s key_of closure). Honors compact_every cadence.

fn mode(&self) -> AppendLogMode

D269: persistence mode (Append default — read-merge; Overwrite — replace bucket per flush). Exposed so delta-shipping consumers like ReactiveLog::attach_storage can reject Overwrite tiers at attach time.

fn load_entries( &self, opts: LoadEntriesOpts<'_>, ) -> Result<AppendLoadResult<T>, StorageError>

D269 — windowed cursor pagination (memo:Re loadEntries-pagination parity). With LoadEntriesOpts::default() returns the whole log (back-compat shape) and cursor: None. With page_size = Some(n) returns [start, start+n) of the flattened (lex-ASC-by-key, entry-order-within-key) sequence and a forward-only cursor (None ⇒ no more). Pre-D269 callers using load_entries_legacy(key_filter) get the old signature.

fn load_entries_all( &self, key_filter: Option<&str>, ) -> Result<Vec<T>, StorageError>

Pre-D269 convenience: load all entries (no pagination, no cursor). Equivalent to load_entries(LoadEntriesOpts { key_filter, .. }).

impl<B, T, C> BaseStorageTier for AppendLogStorage<B, T, C>

where B: StorageBackend + ?Sized, T: Serialize + DeserializeOwned + Clone + Send + Sync + 'static, C: Codec<Vec<T>>,

fn name(&self) -> &str

Diagnostic tier name (e.g. "snapshot:my-graph"). Surfaces in error messages and Display impls.

fn debounce_ms(&self) -> Option<u32>

Debounce window in milliseconds. None (default) = sync-through. Graph-layer attach reads this and schedules timed flush() via its own reactive timer (M4.E); the tier itself does NOT drive a timer.

fn compact_every(&self) -> Option<u32>

Force a flush every Nth accepted write regardless of debounce. None = no cap; Some(N) triggers flush() on the Nth save (or append_entries for log tiers).

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

Commit pending writes. Graph calls at wave-close / debounce-fire.

fn rollback(&self) -> Result<(), StorageError>

Discard pending writes. Graph calls on wave-throw.

fn list_by_prefix_bytes<'a>( &'a self, prefix: &str, ) -> Box<dyn Iterator<Item = Result<(String, Vec<u8>), StorageError>> + 'a>

Lazily enumerate raw (key, bytes) pairs under a literal byte-prefix (DS-14-storage Q5 lock).

fn compact(&self) -> Result<(), StorageError>

Force a mode:"full" baseline immediately (Q8 lock). Bypasses compact_every cadence; useful at deploy boundaries, end-of-process drains, or test fixtures. Default impl is a flush() so tiers that don’t write baselines can still implement the method trivially.