Struct TaskGraph 

pub struct TaskGraph {
    pub nodes: BTreeSet<TaskId>,
    pub edges: BTreeSet<Edge>,
}

The validated task graph of a workspace.

Examples

use std::collections::BTreeSet;
use std::str::FromStr;
use haz_dag::edge::{Edge, EdgeKind};
use haz_dag::graph::TaskGraph;
use haz_domain::name::{ProjectName, TaskName};
use haz_domain::task_id::TaskId;

let a = TaskId {
    project: ProjectName::from_str("p").unwrap(),
    task: TaskName::from_str("a").unwrap(),
};
let b = TaskId {
    project: ProjectName::from_str("p").unwrap(),
    task: TaskName::from_str("b").unwrap(),
};

let graph = TaskGraph {
    nodes: BTreeSet::from([a.clone(), b.clone()]),
    edges: BTreeSet::from([Edge {
        from: a,
        to: b,
        kind: EdgeKind::Hard,
    }]),
};
assert_eq!(graph.nodes.len(), 2);
assert_eq!(graph.edges.len(), 1);

Fields

nodes: BTreeSet<TaskId>

Every task that participates in the graph, by identity.

edges: BTreeSet<Edge>

Every edge in the graph, tagged by crate::edge::EdgeKind.

Trait Implementations

impl Clone for TaskGraph

fn clone(&self) -> TaskGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TaskGraph

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

Formats the value using the given formatter.

impl Default for TaskGraph

fn default() -> TaskGraph

Returns the “default value” for a type.

impl Eq for TaskGraph

impl PartialEq for TaskGraph

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl StructuralPartialEq for TaskGraph