Enum OrderingMode 

#[repr(u32)]
pub enum OrderingMode {
    Unordered = 0,
    MergeByStamp = 1,
    MergeStrict = 2,
}

How a stamped ring’s consumer side interprets stamps.

Variants

Unordered = 0

Existing partition pop. Stamps are read after the pop to drive the inversion counter; ordering guarantee stays per-producer FIFO.

MergeByStamp = 1

K-way min-stamp merge over the ring heads. Global FIFO within the stamp source’s skew window (freshness-guarded for time-based stamps). Single active drainer.

MergeStrict = 2

As MergeByStamp, plus the per-producer watermark gate: a candidate releases only once no empty in-use ring can still produce a smaller stamp. Exact global FIFO for every stamp kind, at the cost of slowest-producer latency coupling.

Trait Implementations

impl Clone for OrderingMode

fn clone(&self) -> OrderingMode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for OrderingMode

impl Debug for OrderingMode

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

Formats the value using the given formatter.

impl Eq for OrderingMode

impl PartialEq for OrderingMode

fn eq(&self, other: &OrderingMode) -> 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 StructuralPartialEq for OrderingMode