pub enum JobSort {
Queued,
Wait,
Run,
Memory,
}Expand description
What a sorted list of jobs is sorted by.
Variants§
Queued
When GitHub queued it, in the order of the jobs’ IDs, which GitHub gives as it queues them: the default order.
Wait
How long it waited for a runner, as its page says it (JobSummary::waited): from queued to started, in
whole seconds. Unknown until it starts, so a job still queued sorts with the unknown ones.
Run
How long it ran (JobSummary::ran) once its record is final; unknown while it runs.
Memory
Its memory peak once its record is final; unknown while it runs, whose peak still grows.
Implementations§
Trait Implementations§
impl Copy for JobSort
Source§impl<'de> Deserialize<'de> for JobSort
impl<'de> Deserialize<'de> for JobSort
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl Eq for JobSort
impl StructuralPartialEq for JobSort
Auto Trait Implementations§
impl Forget for JobSort
impl Freeze for JobSort
impl Move for JobSort
impl RefUnwindSafe for JobSort
impl Send for JobSort
impl Sync for JobSort
impl Unpin for JobSort
impl UnsafeUnpin for JobSort
impl UnwindSafe for JobSort
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,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
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.