pub struct ResolvedGraph {
pub nodes: IndexMap<SourceName, ResolvedNode>,
pub order: Vec<SourceName>,
pub id_index: HashMap<SourceId, SourceName>,
}Expand description
The resolved dependency graph — all sources with concrete versions.
Produced by the resolver after fetching sources, reading manifests, intersecting version constraints, and topological sorting.
Fields§
§nodes: IndexMap<SourceName, ResolvedNode>§order: Vec<SourceName>Topological order (deps before dependents).
id_index: HashMap<SourceId, SourceName>Trait Implementations§
Source§impl Clone for ResolvedGraph
impl Clone for ResolvedGraph
Source§fn clone(&self) -> ResolvedGraph
fn clone(&self) -> ResolvedGraph
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for ResolvedGraph
impl RefUnwindSafe for ResolvedGraph
impl Send for ResolvedGraph
impl Sync for ResolvedGraph
impl Unpin for ResolvedGraph
impl UnsafeUnpin for ResolvedGraph
impl UnwindSafe for ResolvedGraph
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more