Struct PackedSeedStore 

pub struct PackedSeedStore { /* private fields */ }

A packed content-addressed store of canonical procedural seed nodes.

Implements SeedStore with the same identity, bytes, verification, range, and enumeration semantics as super::FsSeedStore; only the physical layout differs (fieldpack/ segments instead of one file per node).

Implementations

impl PackedSeedStore

pub fn open_read(root: impl AsRef<Path>, io: IoCounters) -> Result<Self>

Open the store read-only: sealed segments via their .idx, plus the open segment (if any) recovered by a framing scan.

pub fn open_write(root: impl AsRef<Path>, io: IoCounters) -> Result<Self>

Open the store read-write, recovering (and truncating the torn tail of) an unsealed segment so appends continue from the last complete record.

Uses the default SyncPolicy::Batch.

pub fn open_write_with_policy( root: impl AsRef<Path>, io: IoCounters, policy: SyncPolicy, ) -> Result<Self>

Open the store read-write with an explicit durability SyncPolicy.

pub fn root(&self) -> &Path

The store root.

pub fn seal(&self) -> Result<()>

Seal the open segment: fsync it, publish seg-N.idx atomically, and make it readable. Called by crate::field::FieldStore::sync.

pub fn insert(&self, canonical: &[u8]) -> Result<NodeId>

Store the canonical bytes of one node (idempotent).

With SyncPolicy::Each the record is fdatasync’d before returning; with the default SyncPolicy::Batch it is visible immediately (through the pending map) but becomes crash-durable at the next seal or PackedSeedStore::flush. See the module docs for the exact semantics.

pub fn flush(&self) -> Result<()>

Force every appended record in the open segment to stable storage without sealing it. A durability barrier, not a visibility change: the pending map already serves every appended node. Called by FieldStore::put_field so a published manifest only ever references nodes that are already durable.

pub fn fetch(&self, id: &NodeId) -> Result<Vec<u8>>

Fetch a node, verifying NodeId::of_node(bytes) == id.

pub fn fetch_range(&self, id: &NodeId, offset: u64, len: u64) -> Result<Vec<u8>>

Fetch len bytes at offset (strict; no EOF clip, no whole-node gate).

pub fn has(&self, id: &NodeId) -> Result<bool>

Whether id is present.

pub fn entries(&self) -> Result<Vec<(NodeId, u64)>>

Every stored (id, canonical_len), sorted ascending.

Trait Implementations

impl Debug for PackedSeedStore

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

Formats the value using the given formatter.

impl SeedStore for PackedSeedStore

fn put_node(&mut self, canonical: &[u8]) -> Result<NodeId>

Store the canonical bytes of one node, returning its content id.

fn get_node(&self, id: &NodeId) -> Result<Vec<u8>>

Fetch the exact canonical bytes for id.

fn get_node_range(&self, id: &NodeId, offset: u64, len: u64) -> Result<Vec<u8>>

Fetch len bytes of id starting at offset (strict; no EOF clip).

fn contains_node(&self, id: &NodeId) -> Result<bool>

Whether id is present.

fn list_nodes(&self) -> Result<Vec<(NodeId, u64)>>

Every stored (id, canonical_len), for closure checking and GC.