Struct CodeGraph 

pub struct CodeGraph {
    pub graph: DiGraph<NodeData, EdgeData>,
    pub snapshot_id: SnapshotId,
    /* private fields */
}

The canonical dependency graph for a codebase snapshot.

Fields

graph: DiGraph<NodeData, EdgeData>

The underlying petgraph with our node/edge data types.

snapshot_id: SnapshotId

Snapshot identifier for this graph as discussed before.

Implementations

impl CodeGraph

pub fn new(snapshot_id: SnapshotId) -> Self

Creates an empty CodeGraph for the given snapshot.

pub fn file_node_index(&self, file_id: FileId) -> Option<NodeIndex>

pub fn symbol_node_index(&self, symbol_id: SymbolId) -> Option<NodeIndex>

pub fn file_node(&self, file_id: FileId) -> Option<&FileNode>

pub fn symbol_node(&self, symbol_id: SymbolId) -> Option<&SymbolNode>

pub fn file_count(&self) -> usize

pub fn symbol_count(&self) -> usize

pub fn external_count(&self) -> usize

pub fn node_count(&self) -> usize

pub fn edge_count(&self) -> usize

pub fn get_or_create_external_node( &mut self, raw_path: String, language: LangId, ) -> NodeIndex

Resolves or creates the External node for a raw unresolved path, keeping external_index consistent so repeated loads reuse a single node.

pub fn add_edge_normalized( &mut self, source: NodeIndex, target: NodeIndex, kind: EdgeKind, confidence: f32, )

Adds an edge, normalizing duplicate (src, dst, kind) triples by max-merging confidence so injected edges obey the same invariant as builder-constructed ones.

pub fn files(&self) -> impl Iterator<Item = (FileId, &FileNode)> + '_

pub fn symbols(&self) -> impl Iterator<Item = (SymbolId, &SymbolNode)> + '_

pub fn edges_of_kind( &self, kind: EdgeKind, ) -> impl Iterator<Item = (NodeIndex, NodeIndex)> + '_

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.