Enum r3::kernel::QueueOrder

#[non_exhaustive]
pub enum QueueOrder {
    Fifo,
    TaskPriority,
}

Specifies the sorting order of a wait queue.

This enum type is defined as #[non_exhaustive] to allow for potential future extensions. The function QueueOrder::is_supported indicates whether a QueueOrder is supported by the kernel. The behavior is implementation-defined (preferably approximating the request or falling back to a supported option) if a specified QueueOrder is not supported.

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.

Fifo

The wait queue is processed in a FIFO order.

TaskPriority

The wait queue is processed in a task priority order. Tasks with the same priorities follow a FIFO order.

Implementations

impl QueueOrder

pub const fn is_supported<System>(&self) -> boolwhere System: KernelBase,

Return a flag indicating whether the kernel supports this QueueOrder.

It’s possible for this function to return false for all possible values of QueueOrder if the kernel doesn’t precisely implement any possible options of QueueOrder.

Trait Implementations

impl Clone for QueueOrder

fn clone(&self) -> QueueOrder

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for QueueOrder

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

Formats the value using the given formatter.

impl PartialEq<QueueOrder> for QueueOrder

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

This method tests for self and other values to be equal, and is used by ==.

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

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

impl Copy for QueueOrder

impl Eq for QueueOrder

impl StructuralEq for QueueOrder

impl StructuralPartialEq for QueueOrder