Struct AdmissionOrder 

pub struct AdmissionOrder { /* private fields */ }

Stable admission ordering key for one lifecycle candidate.

The phase is the canonical typed protocol phase rather than a free integer. Binding-terminal transitions below additionally fix it to CandidatePhase::BindingTerminal and derive the participant index from the participant identifier, which is exactly that permanent index in v1.

Implementations

impl AdmissionOrder

pub const fn new( transaction_order: TransactionOrder, candidate_phase: CandidatePhase, participant_index: ParticipantIndex, ) -> Self

Creates an order for a typed lifecycle candidate.

pub const fn binding_terminal( transaction_order: TransactionOrder, participant_id: ParticipantId, ) -> Self

Creates the only order shape valid for a binding terminal.

pub const fn transaction_order(self) -> TransactionOrder

Returns the conversation transaction-order major.

pub const fn candidate_phase(self) -> CandidatePhase

Returns the canonical candidate phase.

pub const fn participant_index(self) -> ParticipantIndex

Returns the permanent participant-index tie-breaker.

Trait Implementations

impl Clone for AdmissionOrder

fn clone(&self) -> AdmissionOrder

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for AdmissionOrder

impl Debug for AdmissionOrder

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

Formats the value using the given formatter.

impl Eq for AdmissionOrder

impl Ord for AdmissionOrder

fn cmp(&self, other: &AdmissionOrder) -> 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 AdmissionOrder

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

Equality operator ==.

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

Inequality operator !=.

impl PartialOrd for AdmissionOrder

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