Enum SchedulePolicy 

pub enum SchedulePolicy {
    Fifo,
    Lifo,
    RoundRobin,
    Random,
    Priority,
}

The ready-task selection discipline. Determinism holds under every policy: Fifo/Lifo/RoundRobin/Priority are deterministic by construction, and Random resolves its pick through the seeded Chooser, so it is reproducible under a fixed seed.

Variants

Fifo

Deterministic FIFO ready queue — fair, predictable. The default.

Lifo

LIFO (stack) — depth-first; better locality, but can starve siblings.

RoundRobin

Round-robin rotation with a cooperative quantum.

Random

Seeded-random ready pick — explores interleavings (fuzzing / race-finding).

Priority

Highest task priority first; FIFO within a priority band.

Trait Implementations

impl Clone for SchedulePolicy

fn clone(&self) -> SchedulePolicy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SchedulePolicy

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

Formats the value using the given formatter.

impl Default for SchedulePolicy

fn default() -> Self

Returns the “default value” for a type.

impl Hash for SchedulePolicy

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for SchedulePolicy

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

impl Eq for SchedulePolicy

impl StructuralPartialEq for SchedulePolicy