Enum QueueSchedulingAlgorithm 

pub enum QueueSchedulingAlgorithm {
    FCFS,
    SJF,
    Priority,
    RoundRobin,
    MLFQ,
    SciRS2Optimized,
}

Queue scheduling algorithms

Variants

FCFS

First-come, first-served

SJF

Shortest job first

Priority

Priority-based scheduling

RoundRobin

Round-robin

MLFQ

Multilevel feedback queue

SciRS2Optimized

SciRS2-optimized scheduling

Trait Implementations

impl Clone for QueueSchedulingAlgorithm

fn clone(&self) -> QueueSchedulingAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for QueueSchedulingAlgorithm

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for QueueSchedulingAlgorithm

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for QueueSchedulingAlgorithm

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

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for QueueSchedulingAlgorithm