Struct GraphDb 

pub struct GraphDb { /* private fields */ }

SQLite-backed code graph database.

Implementations

impl GraphDb

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

Open or create a graph database at the given path.

pub fn in_memory() -> Result<Self>

Create an in-memory graph database (for testing).

pub fn insert_node(&self, node: &Node) -> Result<i64>

Insert a node and return its ID.

pub fn insert_batch( &self, nodes: &[Node], edges: &[(i64, i64, EdgeKind)], ) -> Result<Vec<i64>>

Batch insert nodes and edges in a single transaction (much faster for indexing).

pub fn keyword_search(&self, query: &str) -> Result<Vec<Node>>

Full-text keyword search using FTS5 BM25 ranking.

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

Insert an edge.

pub fn search_nodes(&self, query: &str) -> Result<Vec<Node>>

Search nodes by name (case-insensitive substring match).

pub fn fuzzy_search_nodes(&self, query: &str) -> Result<Vec<Node>>

Fuzzy search nodes by name — ranked by match score (best first).

pub fn edges_from(&self, node_id: i64) -> Result<Vec<Edge>>

Get all edges from a node (outgoing relationships).

pub fn node_count(&self) -> Result<usize>

Get total node count.

pub fn edge_count(&self) -> Result<usize>

Get total edge count.

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

Clear all data (for re-indexing).

pub fn path(&self) -> Option<PathBuf>

Get the database file path.

pub fn content_hash(content: &str) -> String

Compute SHA-256 hash of content (first 16 hex chars).

pub fn needs_reindex(&self, file_path: &str, content: &str) -> Result<bool>

Check if a file needs re-indexing (hash changed or new file).

pub fn store_file_hash(&self, file_path: &str, content: &str) -> Result<()>

Store file hash after indexing.

pub fn remove_file(&self, file_path: &str) -> Result<()>

Remove nodes and edges for a specific file (for re-indexing).