Struct GraphStore 

pub struct GraphStore { /* private fields */ }

Combined graph and vector store

Implementations

impl GraphStore

pub fn open(db_path: &str) -> Result<Self>

Open or create a graph store at the given path

pub fn open_with_config( db_path: &str, index_config: IndexConfig, ) -> Result<Self>

Open or create a graph store with custom index configuration

pub fn in_memory() -> Result<Self>

Open an in-memory graph store (for testing)

pub fn insert_document(&mut self, doc: &Document) -> Result<()>

Insert a document

pub fn get_document(&self, id: Uuid) -> Result<Option<Document>>

Get a document by ID

pub fn get_document_by_path(&self, path: &Path) -> Result<Option<Document>>

Get a document by path

pub fn delete_document(&mut self, id: Uuid) -> Result<()>

Delete a document and its associated chunks/embeddings

pub fn get_all_documents(&self) -> Result<Vec<Document>>

Get all documents

pub fn insert_chunk(&mut self, chunk: &Chunk) -> Result<()>

Insert a chunk

pub fn get_chunks_for_doc(&self, doc_id: Uuid) -> Result<Vec<Chunk>>

Get chunks for a document

pub fn get_chunk(&self, id: Uuid) -> Result<Option<Chunk>>

Get a chunk by ID

pub fn insert_embedding(&mut self, emb: &Embedding) -> Result<()>

Insert an embedding and add it to the HNSW index

pub fn get_embedding_for_chunk( &self, chunk_id: Uuid, ) -> Result<Option<Embedding>>

Get embedding by chunk ID

pub fn get_embedding(&self, id: Uuid) -> Result<Option<Embedding>>

Get embedding by ID

pub fn get_chunk_id_for_embedding( &self, embedding_id: Uuid, ) -> Result<Option<Uuid>>

Get chunk ID for an embedding ID

pub fn get_all_embeddings(&self) -> Result<Vec<Embedding>>

Get all embeddings

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

Checkpoint the HNSW index with current state root

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

Save the HNSW index to disk

pub fn add_edge(&mut self, edge: &Edge) -> Result<()>

Add an edge to the graph

pub fn get_edges(&self, node_id: Uuid) -> Result<Vec<Edge>>

Get edges from a node

pub fn edges_to(&self, node_id: Uuid) -> Result<Vec<Edge>>

Get edges to a node

pub fn all_edges(&self) -> Result<Vec<Edge>>

Get all edges

pub fn search(&self, query_vec: &[f32], k: usize) -> Result<Vec<(Uuid, f32)>>

Search for similar embeddings

pub fn search_lexical(&self, query: &str, k: usize) -> Result<Vec<(Uuid, f32)>>

Lexical search using FTS5 Get graph statistics

pub fn get_sorted_chunk_hashes(&self) -> Result<Vec<([u8; 16], [u8; 32])>>

Get all chunk (id, text_hash) pairs sorted by id.

Used for building per-chunk Merkle proofs in proof receipts.

pub fn compute_chunk_tree_root(&self) -> Result<[u8; 32]>

Compute a proper binary Merkle tree root over all chunk text hashes.

Unlike compute_merkle_root() which uses a streaming hasher over all entities, this builds a binary Merkle tree that supports per-chunk inclusion proofs.

pub fn compute_merkle_root(&self) -> Result<[u8; 32]>

Compute Merkle root of the current state

This is strictly semantic and content-addressable. It does NOT include timestamps, UUIDs (except as IDs for relationships), or device-specific metadata.

pub fn get_state_root_by_hash( &self, hash: &[u8; 32], ) -> Result<Option<StateRoot>>

Get a state root by hash

pub fn get_latest_root(&self) -> Result<Option<StateRoot>>

Get the latest state root

pub fn set_latest_root(&mut self, root: &StateRoot) -> Result<()>

Set the latest state root

pub fn apply_diff(&mut self, diff: &CognitiveDiff) -> Result<()>

Apply a cognitive diff to the graph store with conflict resolution.

Per CP-013 §13: Uses Last-Writer-Wins (LWW) with Hybrid Logical Clocks (HLC) for deterministic conflict resolution:

1. Compare HLC timestamps - later one wins
2. If timestamps equal, use hash tiebreaker (lexicographically higher wins)

pub fn clear_state_roots(&mut self) -> Result<()>

Clear only state roots (used when pairing with a new device to force full snapshot push)

pub fn clear_all(&mut self) -> Result<()>

Clear all data from the graph store (for fresh sync)

pub fn stats(&self) -> Result<GraphStats>

Get statistics about the graph store