pub enum Label {
Open,
Changed,
Ignored,
Unclear,
Censored,
NotArisen,
Remains,
}Expand description
What the judge made of an apply.
Variants§
Open
No verdict yet.
Changed
Changed the work and avoids the consequence (asked_then_changed).
Ignored
Changed nothing on its point (asked_ignored).
Unclear
The judge could not tell (asked_unclear; before 0.7.5 also a change that left the consequence).
Censored
Its session settled without a verdict (asked_not_corrected with an unjudged reason).
NotArisen
Its point never came up in the work (asked_not_arisen, 0.7.5 on): a verdict, read as “nothing in
the work”, no change on the lesson’s point (select/policy.rs Data::of, judged; replay.rs
unit_outcome). Appended, so older caches keep their labels’ places.
Remains
Changed on its point but the consequence remains (asked_consequence_remains, 0.7.5 on): read as
an unclear verdict everywhere but the label health (top.rs), which counts it apart.
Implementations§
Trait Implementations§
impl Copy for Label
Source§impl<'de> Deserialize<'de> for Label
impl<'de> Deserialize<'de> for Label
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>,
impl Eq for Label
impl StructuralPartialEq for Label
Auto Trait Implementations§
impl Freeze for Label
impl RefUnwindSafe for Label
impl Send for Label
impl Sync for Label
impl Unpin for Label
impl UnsafeUnpin for Label
impl UnwindSafe for Label
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,
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
key and return true if they are equal.