pub enum QueueItemLifecycle {
Live,
Struck,
}Expand description
Visible lifecycle state of a single rendered queue item, in ascending lawful
order. This is the coarse lattice the CRDT convergence joins over; the
orchestration QueueItemState is a finer-grained refinement that maps onto it.
Variants§
Live
The item is a live (un-struck) queue head — still actionable.
Struck
The item is struck through (~~…~~) — answered and visibly retired. A
stale live re-emit must never regress past this.
Implementations§
Source§impl QueueItemLifecycle
impl QueueItemLifecycle
Sourcepub fn rank(self) -> u8
pub fn rank(self) -> u8
Position in the total lifecycle order (Live = 0, Struck = 1). The join
compares ranks.
Sourcepub fn join(self, other: QueueItemLifecycle) -> QueueItemLifecycle
pub fn join(self, other: QueueItemLifecycle) -> QueueItemLifecycle
The join (max) of two lifecycle states — the lawful reconciliation of two
sides’ visible states. Monotonic: a Live re-emit can never regress a
Struck item. Mirrors transition_queue_item’s rank join in the
orchestration state machine.
Sourcepub fn classify(item: &str) -> QueueItemLifecycle
pub fn classify(item: &str) -> QueueItemLifecycle
Classify a rendered queue item’s first line. A markdown strike (~~)
anywhere on the identity line marks the item answered-and-retired.
Keyed off the first line only (continuation lines are body, not the head
identity) so a struck head with an unstruck continuation still classifies
as Struck.
Trait Implementations§
Source§impl Clone for QueueItemLifecycle
impl Clone for QueueItemLifecycle
impl Copy for QueueItemLifecycle
Source§impl Debug for QueueItemLifecycle
impl Debug for QueueItemLifecycle
Source§impl<'de> Deserialize<'de> for QueueItemLifecycle
impl<'de> Deserialize<'de> for QueueItemLifecycle
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 QueueItemLifecycle
Source§impl Hash for QueueItemLifecycle
impl Hash for QueueItemLifecycle
Source§impl Ord for QueueItemLifecycle
impl Ord for QueueItemLifecycle
1.21.0 (const: unstable) · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
1.21.0 (const: unstable) · Source§fn min(self, other: Self) -> Selfwhere
Self: Sized,
fn min(self, other: Self) -> Selfwhere
Self: Sized,
Source§impl PartialEq for QueueItemLifecycle
impl PartialEq for QueueItemLifecycle
Source§impl PartialOrd for QueueItemLifecycle
impl PartialOrd for QueueItemLifecycle
Source§impl Serialize for QueueItemLifecycle
impl Serialize for QueueItemLifecycle
impl StructuralPartialEq for QueueItemLifecycle
Auto Trait Implementations§
impl Forget for QueueItemLifecycle
impl Freeze for QueueItemLifecycle
impl RefUnwindSafe for QueueItemLifecycle
impl Send for QueueItemLifecycle
impl Sync for QueueItemLifecycle
impl Unpin for QueueItemLifecycle
impl UnsafeUnpin for QueueItemLifecycle
impl UnwindSafe for QueueItemLifecycle
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> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
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§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.