Struct Analytics 

pub struct Analytics { /* private fields */ }

DuckDB analytics engine for code intelligence.

Implementations

impl Analytics

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

Open DuckDB and attach the SQLite database.

pub fn call_graph( &self, start_name: &str, max_depth: i32, ) -> Result<Vec<CallGraphNode>>

Get the full call graph starting from a symbol (forward traversal).

The start_name can be:

• A simple name like “new” (matches first symbol with that name)
• A qualified name like “LocalProvider::new”
• A full ID like “src/embeddings/local.rs::LocalProvider::new@20”

pub fn impact_analysis( &self, target_name: &str, max_depth: i32, ) -> Result<Vec<ImpactNode>>

Impact analysis: find all symbols that would be affected by changing the target.

The target_name can be:

• A simple name like “new” (matches first symbol with that name)
• A qualified name like “LocalProvider::new”
• A full ID like “src/embeddings/local.rs::LocalProvider::new@20”

pub fn file_statistics(&self) -> Result<Vec<FileStats>>

Get file statistics for all indexed files.

pub fn symbol_summary(&self) -> Result<Vec<(String, i64, i64)>>

Get symbol counts by kind.

pub fn has_path( &self, from_name: &str, to_name: &str, max_depth: i32, ) -> Result<bool>

Find if a path exists between two symbols (simplified version).

Both from_name and to_name can be symbol IDs, qualified names, or simple names.

pub fn most_connected( &self, limit: i32, ) -> Result<Vec<(String, String, i64, i64)>>

Get the most connected symbols (highest in/out degree).

This correctly counts incoming edges per symbol ID, not by name, avoiding over-counting for common names like “new”.

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

Check if there are any self-recursive functions.

Uses target_id when available for accurate recursion detection.

pub fn file_dependencies(&self) -> Result<Vec<(String, String, i64)>>

Get dependency graph between files (module-level).

Uses target_id when available for accurate file resolution.

pub fn complexity_analysis( &self, threshold: i64, ) -> Result<Vec<ComplexityResult>>

Analyze code complexity based on fan-out (outgoing calls) and fan-in (incoming calls).

This correctly counts incoming edges per symbol ID, not by name, avoiding over-counting for common names like “new”.

pub fn full_call_graph( &self, _max_depth: i32, ) -> Result<Vec<(String, String, String, String)>>

Get the full call graph (all edges with resolved symbols).

Uses target_id when available for accurate symbol resolution.