Struct ResolvedGraph 

pub struct ResolvedGraph {
    pub nodes: IndexMap<SourceName, ResolvedNode>,
    pub order: Vec<SourceName>,
    pub filters: HashMap<SourceName, Vec<FilterMode>>,
    pub version_constraints: HashMap<SourceName, Vec<(String, VersionConstraint)>>,
    pub unreadable_hook_surfaces: BTreeMap<SourceName, BTreeSet<String>>,
}

The resolved dependency graph — all sources with concrete versions.

Produced by the resolver after fetching sources, reading manifests, intersecting version constraints, and deterministic ordering.

Fields

nodes: IndexMap<SourceName, ResolvedNode>

order: Vec<SourceName>

Deterministic alphabetical order (prompt packages don’t require dependency ordering).

filters: HashMap<SourceName, Vec<FilterMode>>

All filter constraints collected for each source (direct + transitive).

version_constraints: HashMap<SourceName, Vec<(String, VersionConstraint)>>

All version constraints collected for each source (direct + transitive).

unreadable_hook_surfaces: BTreeMap<SourceName, BTreeSet<String>>

Hook surfaces that cannot be compiled because they use a removed schema.

This is classified during staging and consumed only by the recovery halt gate at the reader/compiler boundary.

Trait Implementations

impl Clone for ResolvedGraph

fn clone(&self) -> ResolvedGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ResolvedGraph

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

Formats the value using the given formatter.