Enum SchedPolicy 

pub enum SchedPolicy {
    Cooperative,
    RoundRobin,
    Priority(PriorityPolicy),
    ProgressAware,
}

Scheduling policy.

All policies are observationally equivalent per the schedule_confluence theorem. Cooperative is the WASM-compatible single-threaded policy, justified by cooperative_refines_concurrent.

Variants

Cooperative

Single-threaded round-robin with explicit yield. WASM-compatible.

RoundRobin

Basic multi-coroutine round-robin.

Priority(PriorityPolicy)

Priority scheduling without function pointers.

ProgressAware

Prefer coroutines holding progress tokens (starvation freedom).

Trait Implementations

impl Clone for SchedPolicy

fn clone(&self) -> SchedPolicy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SchedPolicy

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

Formats the value using the given formatter.

impl Default for SchedPolicy

fn default() -> SchedPolicy

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for SchedPolicy

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for SchedPolicy

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for SchedPolicy

impl StructuralPartialEq for SchedPolicy