Enum QueueStrategy

pub enum QueueStrategy {
    Fifo,
    Lifo,
}

Queue strategy for waiters at a given priority level.

Variants

Fifo

First In, First Out - waiters are served in the order they arrive.

Lifo

Last In, First Out - waiters are served in reverse order of arrival.

Trait Implementations

impl Clone for QueueStrategy

fn clone(&self) -> QueueStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for QueueStrategy

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

Formats the value using the given formatter.

impl PartialEq for QueueStrategy

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

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

const 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 Copy for QueueStrategy

impl Eq for QueueStrategy

impl StructuralPartialEq for QueueStrategy