Struct CodeGraph 

pub struct CodeGraph {
    pub graph: DiGraph<i64, EdgeKind>,
    pub file_symbols: HashMap<i64, Vec<i64>>,
    /* private fields */
}

Fields

graph: DiGraph<i64, EdgeKind>

file_symbols: HashMap<i64, Vec<i64>>

file node id → symbol node ids inside it

Implementations

impl CodeGraph

pub fn load(conn: &Connection, project_id: i64) -> Result<CodeGraph>

pub fn callers(&self, id: i64, depth: usize) -> Vec<Reached>

Who (transitively) calls id, up to depth hops, nearest first.

pub fn calls(&self, id: i64, depth: usize) -> Vec<Reached>

What id (transitively) calls, up to depth hops.

pub fn impact(&self, seeds: &[i64], depth: usize) -> Vec<Reached>

Blast radius of changing the given symbols (or whole files): reverse calls + reverse imports, depth-capped.

pub fn path(&self, a: i64, b: i64) -> Option<Vec<i64>>

Shortest call path a → b (forward over calls).

pub fn hubs(&self, limit: usize) -> Vec<(i64, usize)>

Most-called symbols (in-degree over calls), best first.

pub fn communities(&self, min_size: usize) -> Vec<Vec<i64>>

Label-propagation communities over the undirected call graph. Returns symbol-id groups of size >= min_size.