pub struct Plan {
pub decisions: Vec<Decision>,
pub waiting: BTreeMap<u64, Waiting>,
pub warm: BTreeSet<SlotRef>,
}Expand description
What plan decides, and why each queued job it starts no runner for waits.
Fields§
§decisions: Vec<Decision>What to start, hold 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.
Trait Implementations§
impl Eq for Plan
impl StructuralPartialEq for Plan
Auto Trait Implementations§
impl Freeze 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
Mutably borrows from an owned value. Read more
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
Compare self to
key and return true if they are equal.