Enum FairOrder 

#[non_exhaustive]
pub enum FairOrder {
    Lifo,
    Fifo,
}

The order of which Acquire should enter the queue.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Lifo

Last in, first out. Increases tail latencies, but can have better average performance.

Fifo

First in, first out. Fairer option, but can have cascading failures if queue processing is slow.

Trait Implementations

impl Clone for FairOrder

fn clone(&self) -> FairOrder

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for FairOrder

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

Formats the value using the given formatter.

impl Copy for FairOrder