Struct CodeGraph 

pub struct CodeGraph { /* private fields */ }

Implementations

impl CodeGraph

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

pub fn open_in_memory() -> Result<Self>

pub fn db_path(&self) -> &Path

pub fn connection(&self) -> &Connection

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

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

pub fn get_node_by_path(&self, file_path: &str) -> Result<Option<Node>>

pub fn get_node_by_symbol( &self, name: &str, file_path: &str, ) -> Result<Option<Node>>

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

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

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

pub fn dependents(&self, file_path: &str) -> Result<Vec<String>>

pub fn dependencies(&self, file_path: &str) -> Result<Vec<String>>

pub fn impact_analysis( &self, file_path: &str, max_depth: usize, ) -> Result<ImpactResult>

pub fn dependency_chain( &self, from: &str, to: &str, ) -> Result<Option<DependencyChain>>

pub fn related_files( &self, file_path: &str, limit: usize, ) -> Result<Vec<(String, f64)>>

pub fn file_connectivity( &self, file_path: &str, ) -> Result<HashMap<String, (usize, usize)>>

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

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

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

pub fn upsert_file_catalog(&self, entry: &FileCatalogEntry) -> Result<()>

pub fn get_file_catalog(&self, path: &str) -> Result<Option<FileCatalogEntry>>

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

pub fn file_catalog_paths(&self) -> Result<Vec<String>>

pub fn find_symbols( &self, name: &str, file_filter: Option<&str>, kind_filter: Option<&str>, ) -> Result<Vec<Node>>

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

pub fn all_edges_flat(&self) -> Result<Vec<(String, String, String, f64)>>