Struct solvent::DepGraph

pub struct DepGraph<T: Eq> { /* fields omitted */ }

This is the dependency graph. The type T is intended to be a small type, or a reference to a larger type that implements Eq (you will need to supply the type and vectors of the type to functions).

Implementations

impl<T: Eq> DepGraph<T>

pub fn new() -> DepGraph<T>

Create an empty DepGraph.

pub fn register_nodes(&mut self, nodes: Vec<T>)

Register nodes in the graph. The nodes are added to any existing nodes, after checking to avoid duplicates.

pub fn register_node(&mut self, node: T)

Register a node in the graph. The node is added to any existing nodes, after checking to avoid duplicates.

pub fn register_dependency(&mut self, node: T, depends_on: T)

Add a dependency to a DepGraph. The node does not need to pre-exist, nor does the dependency node. If the node does pre-exist, the depends_on will be added to its existing dependency list. Otherwise it will be created.

pub fn register_dependencies(&mut self, node: T, depends_on: Vec<T>)

Add multiple dependencies of one node to a DepGraph. The node does not need to pre-exist, nor does the dependency node. If the node does pre-exist, the depends_on will be added to its existing dependency list. Otherwise it will be created.

pub fn mark_as_satisfied(&mut self, nodes: &[T]) -> Result<(), SolventError>

This marks a node as satisfied. Iterators will not output such nodes. Nodes must exist.

pub fn dependencies_of<'a>(
    &'a self,
    target: &T
) -> Result<DepGraphIterator<'a, T>, SolventError>

Get an iterator to iterate through the dependencies of the target node. Target node must exist.

Trait Implementations

impl<T: Clone + Eq> Clone for DepGraph<T>

fn clone(&self) -> DepGraph<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Eq> Debug for DepGraph<T>

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

Formats the value using the given formatter.