Struct DependencyAnalysis 

pub struct DependencyAnalysis {
    pub sccs: Vec<Vec<String>>,
    /* private fields */
}

Result of dependency analysis.

Fields

sccs: Vec<Vec<String>>

Strongly connected components in reverse topological order.

• sccs[0] has no dependencies (or depends only on things not in this list).
• sccs.last() depends on everything else.
• Definitions within an SCC are mutually recursive.
• Every definition in the symbol table appears exactly once.

Implementations

impl DependencyAnalysis

pub fn def_id_by_symbol(&self, sym: Symbol) -> Option<DefId>

Get the DefId for a definition by Symbol.

pub fn def_id(&self, interner: &Interner, name: &str) -> Option<DefId>

Get the DefId for a definition name (requires interner for lookup).

pub fn def_name_sym(&self, id: DefId) -> Symbol

Get the name Symbol for a DefId.

pub fn def_name<'a>(&self, interner: &'a Interner, id: DefId) -> &'a str

Get the name string for a DefId.

pub fn def_count(&self) -> usize

Number of definitions.

pub fn def_names(&self) -> &[Symbol]

Get the def_names slice (for seeding TypeContext).

pub fn name_to_def(&self) -> &HashMap<Symbol, DefId>

Get the name_to_def map (for seeding TypeContext).

pub fn is_recursive(&self, name: &str) -> bool

Returns true if this definition is recursive.

A definition is recursive if it’s part of a mutual recursion group (SCC > 1), or it’s a single definition that references itself.

Trait Implementations

impl Clone for DependencyAnalysis

fn clone(&self) -> DependencyAnalysis

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DependencyAnalysis

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

Formats the value using the given formatter.

impl Default for DependencyAnalysis

fn default() -> DependencyAnalysis

Returns the “default value” for a type.