Struct InheritanceGraph 

pub struct InheritanceGraph { /* private fields */ }

Implementations

impl InheritanceGraph

pub fn new() -> Self

pub fn add_inheritance(&self, child: SymbolId, parents: &[SymbolId])

Register a class or interface and its direct parents.

Arguments

• child - The SymbolId of the class/interface being defined
• parents - List of SymbolIds this type extends or implements

pub fn is_derived_from(&self, child: SymbolId, ancestor: SymbolId) -> bool

Checks if child is a subtype of ancestor nominally.

This is an O(1) operation after the first lazy computation. Returns true if child extends or implements ancestor (transitively).

pub fn get_resolution_order(&self, symbol_id: SymbolId) -> Vec<SymbolId>

Gets the Method Resolution Order (MRO) for a symbol.

Returns a list of SymbolIds in the order they should be searched for members. Implements a depth-first, left-to-right traversal (standard for TS/JS).

pub fn find_common_ancestor(&self, a: SymbolId, b: SymbolId) -> Option<SymbolId>

Finds the Least Upper Bound (common ancestor) of two symbols.

Returns the most specific symbol that both A and B inherit from. In cases of multiple inheritance (interfaces), this might return one of several valid candidates.

pub fn detects_cycle(&self, child: SymbolId, parent: SymbolId) -> bool

Detects if adding an edge would create a cycle.

pub fn get_parents(&self, symbol_id: SymbolId) -> Vec<SymbolId>

Get the direct parents of a symbol (for cycle detection).

pub fn clear(&self)

Clear all cached data (useful for testing or rebuilding)

pub fn len(&self) -> usize

Get the number of nodes in the graph

pub fn is_empty(&self) -> bool

Check if the graph is empty

Trait Implementations

impl Debug for InheritanceGraph

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

Formats the value using the given formatter.

impl Default for InheritanceGraph

fn default() -> Self

Returns the “default value” for a type.