Skip to main content

order

spar::triage

Function order 

Source 
pub fn order(
    items: Vec<PlanItem>,
    skipped: &[SkippedItem],
    contested: &[ContestedItem],
) -> Vec<PlanItem>
Expand description

Topological by dependency, then cheapest first, so blockers clear early and the large risky items inherit a healthier base.