Struct DependencyResolver 

pub struct DependencyResolver {
    pub registered_plugins: HashMap<String, Vec<SemVer>>,
}

Resolves a set of plugin dependencies to a concrete version selection.

Algorithm

1. For each dependency, narrow the acceptable version set by intersecting all constraints that target the same plugin.
2. From the resulting range, pick the highest available version that satisfies the combined constraint.
3. Perform a topological sort over the dependency graph to detect cycles and produce a safe load order.

Fields

registered_plugins: HashMap<String, Vec<SemVer>>

Registered plugin versions: plugin_id → sorted Vec<SemVer>.

Implementations

impl DependencyResolver

pub fn new() -> Self

Create an empty resolver.

pub fn register(&mut self, plugin_id: impl Into<String>, versions: Vec<SemVer>)

Register all available versions of a plugin.

Versions need not be provided in sorted order.

pub fn resolve( &self, root_deps: &[PluginDependency], ) -> Result<HashMap<String, SemVer>, ResolveError>

Resolve the given root dependencies to a concrete HashMap<plugin_id, version>.

Errors

• ResolveError::NotFound — a dependency names an unregistered plugin.
• ResolveError::Conflict — two constraints for the same plugin have no common satisfying version.
• ResolveError::CircularDependency — the dependency graph has a cycle.

Trait Implementations

impl Default for DependencyResolver

fn default() -> Self

Returns the “default value” for a type.