Struct taskchampion::DependencyMap

pub struct DependencyMap { /* private fields */ }

DependencyMap stores information on task dependencies between pending tasks.

This information requires a scan of the working set to generate, so it is typically calculated once and re-used.

Implementations

impl DependencyMap

pub fn dependencies(&self, dep_of: Uuid) -> impl Iterator<Item = Uuid> + '_

Return an iterator of Uuids on which task deps_of depends. This is equivalent to task.get_dependencies().

pub fn dependents(&self, dep_on: Uuid) -> impl Iterator<Item = Uuid> + '_

Return an iterator of Uuids of tasks that depend on dep_on task.get_dependencies().

Trait Implementations

impl Debug for DependencyMap

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

Formats the value using the given formatter.

impl PartialEq for DependencyMap

fn eq(&self, other: &DependencyMap) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for DependencyMap

impl StructuralPartialEq for DependencyMap