Struct CodeGraph 

pub struct CodeGraph {
    pub nodes: HashMap<SymbolId, SymbolNode>,
    pub edges_out: HashMap<SymbolId, Vec<Edge>>,
    pub edges_in: HashMap<SymbolId, Vec<Edge>>,
    pub file_symbols: HashMap<PathBuf, Vec<SymbolId>>,
    pub file_mtimes: HashMap<PathBuf, u64>,
}

Cross-file code knowledge graph indexing symbol relationships.

Fields

nodes: HashMap<SymbolId, SymbolNode>

edges_out: HashMap<SymbolId, Vec<Edge>>

edges_in: HashMap<SymbolId, Vec<Edge>>

file_symbols: HashMap<PathBuf, Vec<SymbolId>>

file_mtimes: HashMap<PathBuf, u64>

Implementations

impl CodeGraph

pub fn new() -> Self

Create an empty graph.

pub fn make_id(file: &PathBuf, name: &str, start_line: usize) -> SymbolId

Deterministic symbol ID from file path, name, and start line.

pub fn add_symbol(&mut self, node: SymbolNode)

Add a symbol node to the graph.

pub fn add_edge(&mut self, from: SymbolId, edge: Edge)

Add a directed edge from from to the target in edge.

pub fn node(&self, id: SymbolId) -> Option<&SymbolNode>

Look up a node by ID.

pub fn symbols_in_file(&self, file: &PathBuf) -> Option<&Vec<SymbolId>>

Get all symbol IDs in a file.

pub fn callees(&self, id: SymbolId) -> Option<&Vec<Edge>>

Get outgoing edges (callees / targets) from a symbol.

pub fn callers(&self, id: SymbolId) -> Option<&Vec<Edge>>

Get incoming edges (callers / sources) to a symbol.

pub fn remove_file(&mut self, file: &PathBuf)

Remove all symbols belonging to a file and clean up associated edges.

pub fn find_by_name(&self, name: &str) -> Vec<&SymbolNode>

Find symbols by name (exact match).

pub fn node_count(&self) -> usize

Total number of symbol nodes.

pub fn file_count(&self) -> usize

Total number of indexed files.

pub fn is_ready(&self) -> bool

Whether the graph has any data.

pub fn trace_callers( &self, id: SymbolId, max_depth: usize, ) -> Vec<(SymbolId, usize)>

BFS reverse traversal — find all transitive callers up to max_depth.

pub fn trace_callees( &self, id: SymbolId, max_depth: usize, ) -> Vec<(SymbolId, usize)>

BFS forward traversal — find all transitive callees up to max_depth.

pub fn shortest_path( &self, from: SymbolId, to: SymbolId, ) -> Option<Vec<SymbolId>>

BFS shortest path from from to to, max 10 hops. Returns the ordered path [from, ..., to] or None.

pub fn file_dependents(&self, file: &Path, max_depth: usize) -> Vec<PathBuf>

Find all files that depend on (call into) symbols in the given file.

pub fn file_dependency_summary(&self, filename: &str) -> Option<String>

Generate a dependency summary for a file: what it uses, what uses it.

pub fn call_chain_summary(&self, fn_name: &str) -> Option<String>

Generate a call chain summary for a function. Skips struct/enum/trait nodes (they don’t have call edges). If multiple functions match, picks the one with the most callees.

Trait Implementations

impl Clone for CodeGraph

fn clone(&self) -> CodeGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for CodeGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for CodeGraph

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for CodeGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for CodeGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.