Struct BootPlan 

pub struct BootPlan {
    pub stages: Vec<Vec<String>>,
    pub unresolved: Vec<Unresolved>,
    pub cycles: Vec<Vec<String>>,
    pub knots: Vec<BTreeSet<String>>,
}

The order to start a flock in, and what was wrong with the graph.

Fields

stages: Vec<Vec<String>>

Stages in start order. Every stage is non-empty and its names are sorted, so one flock always plans the same way.

unresolved: Vec<Unresolved>

Edges dropped because nothing answers to the name.

cycles: Vec<Vec<String>>

One cycle for every knot in the graph, as a path with the first name not repeated at the end. render_cycle closes it for display. Several cycles can run through the same knot; the one named here is a representative, and breaking it is what an operator does about it.

knots: Vec<BTreeSet<String>>

Every member of each knot, index-aligned with BootPlan::cycles.

The representative path names only the nodes one cycle runs through, so a knot of three reached by two edges leaves one of them off it. A caller asking whether a name is stuck asks this; a caller printing what to break prints the path.

Trait Implementations

impl Clone for BootPlan

fn clone(&self) -> BootPlan

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BootPlan

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

Formats the value using the given formatter.

impl Default for BootPlan

fn default() -> BootPlan

Returns the “default value” for a type.

impl Eq for BootPlan

impl PartialEq for BootPlan

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for BootPlan