Struct GraphStore 

pub struct GraphStore { /* private fields */ }

The store. Clone-able (the underlying redb::Database is held by Arc and is safe to share across threads — redb is internally concurrent). Construct one per process; pass clones into worker tasks.

Implementations

impl GraphStore

pub fn open(root: impl Into<PathBuf>) -> Result<Self>

Open or create a store at root. Creates the root, blobs subtree, and redb index on first call. Idempotent.

pub fn layout(&self) -> &StoreLayout

Read-only view of the layout (paths, kinds). Useful for testing and for GC sweeps that walk the filesystem directly.

pub fn put(&self, kind: GraphKind, hash: GraphHash, bytes: &[u8]) -> Result<()>

Write a blob. Atomic: blob lands on disk + fsyncs before the index transaction commits. Idempotent on the same (kind, hash, bytes) triple. If the hash doesn’t match the bytes the call fails with Error::HashMismatch — protects against caller mistakes upstream.

pub fn put_unchecked( &self, kind: GraphKind, lookup_hash: GraphHash, bytes: &[u8], ) -> Result<()>

Write a blob under a query-derived lookup key (not the BLAKE3 of the bytes). Skips the content-hash validation that Self::put enforces.

Use only when the caller has a deterministic mapping from a non-content query (e.g. an eval-cache (source_hash, lock_hash) tuple) to a lookup hash, and the stored bytes are themselves not the BLAKE3 preimage of that hash. The lookup-hash space shares the same redb table as content-addressed entries, so callers MUST ensure their query-derived hashes can’t collide with arbitrary content (the usual trick: domain-separate by hashing "my-tier::v1::" + serialized_query).

Most callers should prefer Self::put.

pub fn contains(&self, kind: GraphKind, hash: GraphHash) -> Result<bool>

Check whether the index knows about (kind, hash). Cheap; does not touch the filesystem.

pub fn lookup(&self, kind: GraphKind, hash: GraphHash) -> Result<IndexEntry>

Look up an entry’s bookkeeping without reading the blob. Used by GC and inspection tools.

pub fn get(&self, kind: GraphKind, hash: GraphHash) -> Result<MappedBlob>

mmap the blob bytes for (kind, hash). Caller is trusted to have already verified the hash (e.g. they just computed it). Use Self::get_validated for substituter-pulled bytes that must also pass rkyv’s bytecheck pass.

pub fn get_validated( &self, kind: GraphKind, hash: GraphHash, ) -> Result<MappedBlob>

Same as Self::get but additionally recomputes the BLAKE3 of the bytes and rejects on mismatch. Pay this cost for any blob that arrived from an untrusted source (substituter pull, cross-host fleet transfer).

pub fn iter_keys(&self) -> Result<Vec<(GraphKind, GraphHash)>>

Iterate every (kind, hash) pair in the index. Backed by a redb read transaction so the snapshot is consistent at call time. Used by GC and inspection.

pub fn len(&self) -> Result<u64>

Number of entries in the index. Cheap; one read txn + table scan.

pub fn is_empty(&self) -> Result<bool>

True when the store has no entries.

Trait Implementations

impl Clone for GraphStore

fn clone(&self) -> GraphStore

Returns a duplicate of the value.

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

Performs copy-assignment from source.