Struct hua_core::dependency::DependencyGraph

pub struct DependencyGraph<'a> { /* private fields */ }

A directed acyclic graph for dependency resolution.

Example

use std::collections::BTreeSet;
use semver::VersionReq;
use hua_core::dependency::{DependencyGraph, Requirement};
use hua_core::store::MemoryStore;

let store = MemoryStore::init()?;
let mut graph = DependencyGraph::new();

let first_req = Requirement::new("first".to_owned(), VersionReq::parse(">0.1.0")?, BTreeSet::new());
let second_req = Requirement::new("second".to_owned(), VersionReq::parse(">1.1.0")?, BTreeSet::new());
let requirements = [&first_req, &second_req];

graph.resolve(requirements, &store)?;
assert!(!graph.is_resolved());

Implementations

impl<'a> DependencyGraph<'a>

pub fn new() -> Self

Creates a new DependencyGraph.

Example

use hua_core::dependency::DependencyGraph;

let graph = DependencyGraph::new();

pub fn resolve<S, B: ReadBackend>(
    &mut self,
    requirements: impl IntoIterator<Item = &'a Requirement>,
    store: &'a Store<S, B>
) -> Result<(), DependencyError>

Resolves multiple Requirement with the given Store.

Example

use std::collections::BTreeSet;
use semver::VersionReq;
use hua_core::dependency::{DependencyGraph, Requirement};
use hua_core::store::MemoryStore;

let store = MemoryStore::init()?;
let mut graph = DependencyGraph::new();

let first_req = Requirement::new("first".to_owned(), VersionReq::parse(">0.1.0")?, BTreeSet::new());
let second_req = Requirement::new("second".to_owned(), VersionReq::parse(">1.1.0")?, BTreeSet::new());
let requirements = [&first_req, &second_req];

graph.resolve(requirements, &store)?;
assert!(!graph.is_resolved());

pub fn unresolved_requirements(&self) -> impl Iterator<Item = &Requirement>

Returns all Requirement that are still unresolved.

pub fn resolved_packages(&self) -> impl Iterator<Item = PackageId> + '_

Returns all PackageId that are resolved.

pub fn is_resolved(&self) -> bool

Checks if the DependencyGraph is resolved.

pub fn nodes(&self) -> impl Iterator<Item = &Step<'_>>

Returns all [Step] in the graph.

Trait Implementations

impl<'a> Clone for DependencyGraph<'a>

fn clone(&self) -> DependencyGraph<'a>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for DependencyGraph<'a>

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

Formats the value using the given formatter.

impl<'a> Default for DependencyGraph<'a>

fn default() -> DependencyGraph<'a>

Returns the “default value” for a type.