pub struct Plan {
pub decisions: Vec<Decision>,
pub waiting: BTreeMap<u64, Waiting>,
pub warm: BTreeSet<SlotRef>,
pub slot_waiting: BTreeSet<u64>,
pub held: Vec<Demand>,
pub barrier: Option<Barrier>,
}Expand description
What plan decides, and why each queued job it starts no runner for waits.
Fields§
§decisions: Vec<Decision>What to start and stop.
waiting: BTreeMap<u64, Waiting>Why each queued job of a repository’s matching jobs waits, by job ID. A job an idle runner will take is
Waiting::RunnerStarting; a job this plan starts a runner for has no reason, as that runner does not exist
until the start succeeds.
warm: BTreeSet<SlotRef>The idle runners kept warm: no queued job of their repository waits for them.
slot_waiting: BTreeSet<u64>The queued jobs one more slot of their profile would start now: none of its slots is free or a warm runner’s
to give, while the memory and CPU budgets, less what the older of these jobs would take, have room for their
runners. Whatever waiting calls it, NoSlot or BehindStart; a job that also lacks memory or CPU is not
one (ADR 0090), nor is one a barrier holds, which another slot would not start.
held: Vec<Demand>The pools’ next jobs a slot had room for and memory or CPU not: one per pool and resource. What a wait starts from, once a scheduling path commits the plan (ADR 0096).
barrier: Option<Barrier>The job no younger job starts before, if one waited long enough.
Trait Implementations§
impl Eq for Plan
impl StructuralPartialEq for Plan
Auto Trait Implementations§
impl Forget for Plan
impl Freeze for Plan
impl Move for Plan
impl RefUnwindSafe for Plan
impl Send for Plan
impl Sync for Plan
impl Unpin for Plan
impl UnsafeUnpin for Plan
impl UnwindSafe for Plan
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.