Struct KuzuGraphStore 

pub struct KuzuGraphStore { /* private fields */ }

Local KuzuDB-backed implementation of GraphStore.

One database file per repo (graph.kuzu), with per-branch node/edge tables inside it. A fresh Connection is created for each operation so we avoid the self-referential lifetime that Mutex<Connection<'db>> would require.

Implementations

impl KuzuGraphStore

pub fn open(repo_root: &Path) -> Result<Self>

Open (or create) the graph database for the repo at repo_root.

Trait Implementations

impl GraphStore for KuzuGraphStore

fn apply_diff(&mut self, branch: &str, diff: &GraphDiff) -> Result<()>

Apply an incremental diff to the named branch’s graph.

fn lookup_symbol(&self, branch: &str, name: &str) -> Result<Vec<Node>>

Find all nodes matching name (exact, case-sensitive) on branch.

fn find_callers(&self, branch: &str, function_name: &str) -> Result<Vec<Node>>

Find all call-site nodes whose outgoing Calls edge points to a node named function_name on branch.

fn list_definitions(&self, branch: &str, file: &Path) -> Result<Vec<Node>>

List all top-level definitions in file on branch.

fn branch_diff(&self, from: &str, to: &str) -> Result<GraphDiff>

Return the graph delta between two branches as a GraphDiff. Nodes/edges present in to but not from are in added_*. Nodes/edges present in from but not to are in removed_*.

fn list_all_nodes(&self, branch: &str) -> Result<Vec<Node>>

Return all nodes in branch’s graph.

fn list_all_edges(&self, branch: &str) -> Result<Vec<Edge>>

Return all edges in branch’s graph.

fn last_indexed_sha(&self, branch_name: &str) -> Result<Option<String>>

Last commit SHA successfully indexed for branch. None if the branch has never been indexed.

fn set_last_indexed_sha(&mut self, branch_name: &str, sha: &str) -> Result<()>

Persist the commit SHA after a successful index run.