Struct MilestoneGraph 

pub struct MilestoneGraph {

    pub milestone: String,
    pub declared: bool,
    pub record: Option<String>,
    pub title: AttestedText,
    pub outcome: AttestedText,
    pub status: AttestedText,
    pub rank: AttestedCount,
    pub depends_on: AttestedList,
    pub blocked_by: AttestedList,
    pub dependents: AttestedList,
    pub nodes: Vec<MilestoneNode>,
    pub edges: Vec<MilestoneEdge>,
    pub ready: Vec<String>,
    pub blocked: Vec<String>,
    pub waiting: Vec<String>,
    pub active: Vec<String>,
    pub review: Vec<String>,
    pub completion_blocked: Vec<String>,
    pub complete: Vec<String>,
    pub cancelled: Vec<String>,
    pub critical_blockers: Vec<CriticalBlocker>,
    pub parallelizable: Vec<ParallelSet>,
    pub cycles: Vec<Vec<String>>,
    pub diagnostics: Vec<DevTaskDiagnostic>,
    pub counts: MilestoneCounts,
}

One milestone as an executable dependency graph.

Fields

milestone: String

The milestone id, as asked for.

declared: bool

Whether the canonical model declares it. False is answered, not refused.

record: Option<String>

Repository-relative path of the canonical record, when there is one.

title: AttestedText

One line naming the outcome, as authored.

outcome: AttestedText

What is true once it is real, as authored.

status: AttestedText

The derived milestone status.

rank: AttestedCount

Its layer in the milestone graph: what orders the roadmap.

depends_on: AttestedList

The milestones it requires, as authored.

blocked_by: AttestedList

Those of them that are not DONE. Non-empty means every issue here is held back whatever its own dependencies say.

dependents: AttestedList

The milestones that require it.

nodes: Vec<MilestoneNode>

Every issue of the milestone, in canonical order.

edges: Vec<MilestoneEdge>

Every dependency edge with at least one end in this milestone, sorted.

ready: Vec<String>

The issues a worker may pick up now.

blocked: Vec<String>

The issues waiting on a peer.

waiting: Vec<String>

The issues waiting only on the milestone gate.

active: Vec<String>

The issues somebody has started.

review: Vec<String>

The issues awaiting confirmation.

completion_blocked: Vec<String>

The issues declared complete whose evidence does not back that up.

complete: Vec<String>

The issues finished on their own terms.

cancelled: Vec<String>

The issues withdrawn.

critical_blockers: Vec<CriticalBlocker>

What to unblock first, most downstream work first.

parallelizable: Vec<ParallelSet>

The startable work partitioned into subsets that may run at the same time.

cycles: Vec<Vec<String>>

Every dependency cycle with an issue of this milestone in it, each as its strongly connected component in canonical order.

diagnostics: Vec<DevTaskDiagnostic>

Everything wrong with the records of this milestone or of its issues.

counts: MilestoneCounts

The issues counted by readiness.

Implementations

impl MilestoneGraph

pub fn build( plan: &Plan, milestone: &str, record: Option<RecordRef<'_>>, ) -> MilestoneGraph

Build one milestone’s graph out of the derived plan.

Pure: a walk of values the caller already has. Nothing is read, and no derivation the plan owns is repeated — the statuses, waves, edges and findings below are the plan’s own, and only the partitions are computed here.

pub fn is_partitioned(&self) -> bool

Is every partition consistent with the nodes: each issue in exactly one readiness bucket, and every bucket naming an issue of this milestone?

The check a surface would otherwise have to trust. A node counted twice or in no bucket at all is the failure mode of grouping by hand, which is exactly what this type exists to remove from every template.

pub fn has_failures(&self) -> bool

Whether anything about this milestone’s records is a failure rather than a warning.

pub fn is_consistent(&self) -> bool

Is every attested field’s invariant held?

Trait Implementations

impl Clone for MilestoneGraph

fn clone(&self) -> MilestoneGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MilestoneGraph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for MilestoneGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for MilestoneGraph

impl JsonSchema for MilestoneGraph

fn schema_name() -> Cow<'static, str>

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(generator: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn inline_schema() -> bool

Whether JSON Schemas generated for this type should be included directly in parent schemas, rather than being re-used where possible using the $ref keyword.

impl PartialEq for MilestoneGraph

fn eq(&self, other: &MilestoneGraph) -> 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 Serialize for MilestoneGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for MilestoneGraph