Struct erg_compiler::module::graph::SharedModuleGraph

pub struct SharedModuleGraph(_);

Implementations

impl SharedModuleGraph

pub fn new() -> Self

pub fn get_node(&self, path: &Path) -> Option<&Node<PathBuf, ()>>

SAFETY: don’t hold this reference before sorting

pub fn add_node_if_none(&self, path: &Path)

pub fn inc_ref(&self, referrer: &Path, depends_on: PathBuf)

pub fn iter(&self) -> impl Iterator<Item = &Node<PathBuf, ()>>

SAFETY: don’t hold this iterator before sorting

pub fn sort(&self) -> Result<(), TopoSortError>

pub fn initialize(&self)

Trait Implementations

impl Clone for SharedModuleGraph

fn clone(&self) -> SharedModuleGraph

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for SharedModuleGraph

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

Formats the value using the given formatter.

impl Default for SharedModuleGraph

fn default() -> SharedModuleGraph

Returns the “default value” for a type.

impl IntoIterator for SharedModuleGraph

type Item = Node<PathBuf, ()>

The type of the elements being iterated over.

type IntoIter = IntoIter<<SharedModuleGraph as IntoIterator>::Item, Global>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.