Enum QueueItemLifecycle 

pub enum QueueItemLifecycle {
    Live,
    Struck,
}

Visible lifecycle state of a single rendered queue item, in ascending lawful order. This is the coarse lattice the CRDT convergence joins over; richer orchestration queue state machines refine this state but must map back to it.

Variants

Live

The item is a live, un-struck queue head and is still actionable.

Struck

The item is struck through (~~...~~) and visibly retired. A stale live re-emit must never regress past this.

Implementations

impl QueueItemLifecycle

pub fn rank(self) -> u8

Position in the total lifecycle order (Live = 0, Struck = 1).

pub fn join(self, other: QueueItemLifecycle) -> QueueItemLifecycle

The join (max) of two lifecycle states. Monotonic: a Live re-emit can never regress a Struck item.

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.

Trait Implementations

impl Clone for QueueItemLifecycle

fn clone(&self) -> QueueItemLifecycle

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for QueueItemLifecycle

impl Debug for QueueItemLifecycle

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for QueueItemLifecycle

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for QueueItemLifecycle

impl Hash for QueueItemLifecycle

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for QueueItemLifecycle

fn cmp(&self, other: &QueueItemLifecycle) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for QueueItemLifecycle

fn eq(&self, other: &QueueItemLifecycle) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for QueueItemLifecycle

fn partial_cmp(&self, other: &QueueItemLifecycle) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for QueueItemLifecycle

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for QueueItemLifecycle