Struct DepMap

pub struct DepMap<T: PartialEq> { /* private fields */ }

The dependency map.

Implementations

impl<T: PartialEq> DepMap<T>

pub fn new(list: Vec<T>) -> Self

Creates a new DepMap from an initial list.

pub fn process<F, I, E>(initial: Vec<T>, f: F) -> Result<Vec<T>, Error<T, E>>

where F: FnMut(&T) -> I, I: Iterator<Item = Result<T, E>>,

Runs through a whole dependency map using a single producer function.

This is probably what one should use.

pub fn is_empty(&self) -> bool

Whether the map is empty (i.e nothing needs to be worked on).

pub fn destroy(self) -> Result<Vec<T>, Self>

Returns the result list if the dependency map is empty.

If it is not empty, then an error is returned with the whole map.

pub fn add<F, I, E>(&mut self, f: F) -> Result<Option<Vec<&T>>, E>

where F: FnOnce(&T) -> I, I: Iterator<Item = Result<T, E>>,

Adds the latest target’s dependencies at the end, removing those already done and returning cyclic dependency errors (if any).

When cyclic dependency errors occur, the target is retained but its dependencies are not. Skips everything if the depmap is empty.