Struct CodeGraphV2 

pub struct CodeGraphV2 { /* private fields */ }

Symbol relationship graph with Data-Oriented Design.

Design Principles

1. petgraph-free: No NodeIndex, direct SymbolId operations
2. SoA Layout: Edges stored in separate arrays for cache efficiency
3. String-free: All references use SymbolId/FileId
4. SmallVec: Stack allocation for typical adjacency sizes

Memory Layout

CodeGraphV2
├── Edge Storage (SoA)
│   └── edges: Vec<EdgeData>
├── Adjacency Lists (SymbolId → EdgeIds)
│   ├── outgoing: SecondaryMap<SymbolId, SmallVec<[EdgeId; 4]>>
│   └── incoming: SecondaryMap<SymbolId, SmallVec<[EdgeId; 4]>>
├── Indices
│   ├── by_kind: HashMap<SymbolKind, SmallVec<[SymbolId; 16]>>
│   └── crate_roots: SmallVec<[SymbolId; 4]>
└── Match Expressions
    ├── match_expr_index: SecondaryMap<SymbolId, SmallVec<[MatchExprId; 2]>>
    └── match_exprs: Vec<MatchExprDataV2>

NOTE: Deserialize is NOT derived because CodeGraphV2 contains SecondaryMap<SymbolId, …> and SymbolId is process-specific. Serialize is kept for debugging/inspection.

Implementations

impl CodeGraphV2

pub fn new() -> Self

Create a new empty graph.

pub fn with_capacity(_nodes: usize, edges: usize) -> Self

Create a graph with pre-allocated capacity.

pub fn add_node(&mut self, id: SymbolId) -> bool

Add a symbol to the graph.

Returns true if the symbol was newly added, false if it already existed.

pub fn contains(&self, id: SymbolId) -> bool

Check if a symbol exists in the graph.

pub fn remove_node(&mut self, id: SymbolId) -> bool

Remove a symbol and all its edges from the graph.

Returns true if the symbol was removed.

pub fn clear_outgoing_edges(&mut self, id: SymbolId)

Clear all outgoing edges from a symbol.

Used for incremental updates: clear old edges before rebuilding. Does not remove the node itself or its incoming edges.

pub fn add_edge( &mut self, from: SymbolId, to: SymbolId, kind: CodeEdgeV2, ) -> EdgeId

Add an edge between two symbols.

Both symbols are automatically added to the graph if not present.

pub fn edge(&self, id: EdgeId) -> Option<&EdgeData>

Get edge data by EdgeId.

pub fn has_edge(&self, from: SymbolId, to: SymbolId, kind: CodeEdgeV2) -> bool

Check if an edge exists between two symbols.

pub fn add_crate_root(&mut self, id: SymbolId)

Add a crate root symbol.

pub fn crate_roots(&self) -> &[SymbolId]

Get crate root symbols.

pub fn add_to_kind_index(&mut self, id: SymbolId, kind: SymbolKind)

Add a symbol to the kind index.

pub fn iter_by_kind( &self, kind: SymbolKind, ) -> impl Iterator<Item = SymbolId> + '_

Iterate over symbols of a specific kind.

pub fn outgoing_edges( &self, id: SymbolId, ) -> impl Iterator<Item = &EdgeData> + '_

Get outgoing edges from a symbol.

pub fn incoming_edges( &self, id: SymbolId, ) -> impl Iterator<Item = &EdgeData> + '_

Get incoming edges to a symbol.

pub fn callers_of(&self, id: SymbolId) -> impl Iterator<Item = SymbolId> + '_

Find callers of a symbol (deduplicated).

pub fn callees_of(&self, id: SymbolId) -> impl Iterator<Item = SymbolId> + '_

Find callees of a symbol (deduplicated).

pub fn implementors_of( &self, trait_id: SymbolId, ) -> impl Iterator<Item = SymbolId> + '_

Find implementors of a trait.

pub fn children_of( &self, parent_id: SymbolId, ) -> impl Iterator<Item = SymbolId> + '_

Find children (contained symbols) of a parent.

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

Find the parent (container) of a symbol.

pub fn reference_count(&self, id: SymbolId) -> usize

Get the reference count for a symbol (call references only).

pub fn impl_count(&self, id: SymbolId) -> usize

Get the impl count for a symbol.

pub fn add_match_expr( &mut self, function_id: SymbolId, data: MatchExprDataV2, ) -> MatchExprId

Add a match expression to a function.

pub fn match_exprs_in( &self, function_id: SymbolId, ) -> impl Iterator<Item = &MatchExprDataV2> + '_

Get match expressions in a function.

pub fn match_exprs_for_enum( &self, enum_id: SymbolId, ) -> impl Iterator<Item = (SymbolId, &MatchExprDataV2)> + '_

Find all match expressions that match on a given enum.

pub fn match_expr_count(&self) -> usize

Get total number of match expressions.

pub fn node_count(&self) -> usize

Get the number of nodes.

pub fn edge_count(&self) -> usize

Get the number of edges.

pub fn is_empty(&self) -> bool

Check if the graph is empty.

pub fn callers_chain(&self, start: SymbolId, max_depth: usize) -> Vec<ChainNode>

Find all callers transitively up to max_depth.

Returns a list of (SymbolId, depth) pairs where depth indicates how many hops from the starting symbol.

Example

A calls B, B calls C, C calls D
callers_chain(D, 3) returns: [(C, 1), (B, 2), (A, 3)]

pub fn callees_chain(&self, start: SymbolId, max_depth: usize) -> Vec<ChainNode>

Find all callees transitively up to max_depth.

Returns a list of (SymbolId, depth) pairs where depth indicates how many hops from the starting symbol.

Example

A calls B, B calls C, C calls D
callees_chain(A, 3) returns: [(B, 1), (C, 2), (D, 3)]

pub fn analyze_chain( &self, start: SymbolId, max_depth: usize, direction: ChainDirection, ) -> ChainResult

Get full chain result with statistics.

Trait Implementations

impl Clone for CodeGraphV2

fn clone(&self) -> CodeGraphV2

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Default for CodeGraphV2

fn default() -> CodeGraphV2

Returns the “default value” for a type.

impl Serialize for CodeGraphV2

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

where __S: Serializer,

Serialize this value into the given Serde serializer.