Struct Dfs 

pub struct Dfs<I, M> {
    pub trace: Trace<I>,
    /* private fields */
}

An Evaluator that visits modules in DFS order.

Fields

trace: Trace<I>

Module trace.

Implementations

impl<I, M> Dfs<I, M>

pub const fn new() -> Self

Create a new Dfs evaluator.

Trait Implementations

impl<I: Debug, M: Debug> Debug for Dfs<I, M>

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

Formats the value using the given formatter.

impl<I, M> Default for Dfs<I, M>

fn default() -> Self

Returns the “default value” for a type.

impl<I, M> Evaluator for Dfs<I, M>

where M: Merge,

type Id = I

Id of a module.

type Module = M

The type of the module.

type Error = Error

Evaluation error.

fn is_empty(&self) -> bool

Check whether the evaluator has evaluated any modules.

fn next(&mut self) -> Option<Self::Id>

Get the next module in evaluation order.

fn eval( &mut self, id: Self::Id, imports: Imports<Self::Id>, module: Self::Module, ) -> Result<(), Self::Error>

Evaluate module identified by id that imports the modules specified by imports.

fn finish(self) -> Option<Self::Module>

Destruct the evaluator and get the final value.