pub fn compute_topological_order(&self) -> Result<impl Iterator<Item = &CompiledModule>> {
        match petgraph::algo::toposort(&self.graph, None) {
            Err(_) => bail!("Circular dependency detected"),
            Ok(ordered_idxs) => Ok(ordered_idxs.into_iter().map(move |idx| self.modules[idx.0])),
        }
    }
/// Return an iterator over the modules in `self` in topological order--modules with least deps first.
/// Fails with an error if `self` contains circular dependencies
Return an iterator over the modules in `self` in topological order--modules with least deps first.
Fails with an error if `self` contains circular dependencies
Return an iterator over the modules in ` self ` in topological order -- modules with least deps first . Fails with an error if ` self ` contains circular dependencies
pub fn compute_topological_order(&self) -> Result<impl Iterator<Item = &CompiledModule>> {
        match petgraph::algo::toposort(&self.graph, None) {
            Err(_) => bail!("Circular dependency detected"),
            Ok(ordered_idxs) => Ok(ordered_idxs.into_iter().map(move |idx| self.modules[idx.0])),
        }
    }
pub fn compute_topological_order ( & self ) -> Result < impl Iterator < Item = & CompiledModule > > { match petgraph :: algo :: toposort ( & self . graph , None ) { Err ( _ ) => bail ! ( " " ) , Ok ( ordered_idxs ) => Ok ( ordered_idxs . into_iter ( ) . map ( move | idx | self . modules [ idx . 0 ] ) ) , } }
Return an iterator over the modules in `self` in topological order--modules with least deps first.
Return an iterator over the modules in ` self ` in topological order -- modules with least deps first .
&self