Struct SingleModuleGraph 

pub struct SingleModuleGraph {
    pub graph: TracedDiGraph<SingleModuleGraphNode, RefData>,
    pub number_of_modules: usize,
    pub entries: GraphEntriesT,
    /* private fields */
}

Fields

graph: TracedDiGraph<SingleModuleGraphNode, RefData>

number_of_modules: usize

The number of modules in the graph (excluding VisitedModule nodes)

entries: GraphEntriesT

Implementations

impl SingleModuleGraph

pub fn iter_nodes( &self, ) -> impl Iterator<Item = ResolvedVc<Box<dyn Module>>> + '_

Iterate over all nodes in the graph

pub fn has_entry_module(&self, module: ResolvedVc<Box<dyn Module>>) -> bool

Returns true if the given module is in this graph and is an entry module

pub fn entry_modules( &self, ) -> impl Iterator<Item = ResolvedVc<Box<dyn Module>>> + '_

Iterate over graph entry points

pub fn enumerate_nodes( &self, ) -> impl Iterator<Item = (NodeIndex, &SingleModuleGraphNode)> + '_

Enumerate all nodes in the graph

pub fn read(self: &ReadRef<SingleModuleGraph>) -> ModuleGraphRef

pub async fn compute_import_traces_for_issues( &self, issues: &AutoSet<ResolvedVc<Box<dyn Issue>>>, ) -> Result<FxHashMap<ResolvedVc<Box<dyn Issue>>, Vec<ImportTrace>>>

For each issue computes a (possibly empty) list of traces from the file that produced the issue to roots in this module graph. There are potentially multiple traces because a given file may get assigned to multiple modules depend on how it is used in the application. Consider a simple utility that is used by SSR pages, client side code, and the edge runtime. This may lead to there being 3 traces. The returned map is guaranteed to have an entry for every issue.

impl SingleModuleGraph

pub fn new_with_entries( entries: Vc<GraphEntries>, include_traced: bool, ) -> Vc<Self>

pub fn new_with_entries_visited( entries: Vc<GraphEntries>, visited_modules: Vc<VisitedModules>, include_traced: bool, ) -> Vc<Self>

pub fn new_with_entries_visited_intern( entries: GraphEntriesT, visited_modules: Vc<VisitedModules>, include_traced: bool, ) -> Vc<Self>

Trait Implementations

impl Clone for SingleModuleGraph

fn clone(&self) -> SingleModuleGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Default for SingleModuleGraph

fn default() -> SingleModuleGraph

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for SingleModuleGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for SingleModuleGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl ShrinkToFit for SingleModuleGraph

fn shrink_to_fit(&mut self)

impl TraceRawVcs for SingleModuleGraph

fn trace_raw_vcs(&self, __context__: &mut TraceRawVcsContext)

fn get_raw_vcs(&self) -> Vec<RawVc>

impl ValueDebug for SingleModuleGraph

fn dbg(self: Vc<Self>) -> Vc<ValueDebugString>

fn dbg_depth(self: Vc<Self>, depth: usize) -> Vc<ValueDebugString>

Like dbg, but with a depth limit.

impl ValueDebugFormat for SingleModuleGraph

fn value_debug_format<'a>(&'a self, depth: usize) -> ValueDebugFormatString<'a>

impl VcValueType for SingleModuleGraph

type Read = VcDefaultRead<SingleModuleGraph>

How to read the value.

type CellMode = VcCellNewMode<SingleModuleGraph>

How to update cells of this value type.

fn get_value_type_id() -> ValueTypeId

Returns the type id of the value type.

impl NonLocalValue for SingleModuleGraph

impl Upcast<Box<dyn ValueDebug>> for SingleModuleGraph

impl UpcastStrict<Box<dyn ValueDebug>> for SingleModuleGraph