Struct Resolver 

pub struct Resolver { /* private fields */ }

Greedy dependency resolver.

The algorithm walks the dependency tree breadth-first, always picking the highest version that satisfies each requested semver range. When two different parts of the tree request the same package with compatible ranges the already-resolved version is reused; when an incompatible range is encountered we keep the first resolved version (similar to npm flat-mode) and emit a warning.

Implementations

impl Resolver

pub fn new(registry: Arc<RegistryClient>) -> Self

Create a new resolver backed by the given registry client.

pub fn with_overrides( registry: Arc<RegistryClient>, overrides: HashMap<String, String>, ) -> Self

Create a new resolver with overrides for forced version resolution.

pub fn with_workspace( registry: Arc<RegistryClient>, overrides: HashMap<String, String>, workspace_packages: HashMap<String, (String, PathBuf)>, ) -> Self

Create a new resolver with workspace package information.

pub fn set_hooks(&self, hooks: Hooks)

Set the hook system for this resolver.

pub fn set_auto_install_peers(&mut self, enabled: bool)

Enable or disable automatic peer dependency installation.

pub async fn resolve( &self, root_deps: &HashMap<String, String>, ) -> Result<DependencyGraph>

Resolve a set of root dependencies into a flat dependency graph.

root_deps maps package names to semver range strings, exactly as they appear in package.json under dependencies.

Uses a batch-drain BFS: drains up to 32 entries from the queue, fetches all missing metadata concurrently, then processes the batch.