pub enum SchedulePolicy {
Fifo,
Lifo,
RoundRobin,
Random,
Priority,
}Expand description
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§
Source§impl Clone for SchedulePolicy
impl Clone for SchedulePolicy
Source§fn clone(&self) -> SchedulePolicy
fn clone(&self) -> SchedulePolicy
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for SchedulePolicy
impl Debug for SchedulePolicy
Source§impl Default for SchedulePolicy
impl Default for SchedulePolicy
Source§fn default() -> SchedulePolicy
fn default() -> SchedulePolicy
Returns the “default value” for a type. Read more
Source§impl Hash for SchedulePolicy
impl Hash for SchedulePolicy
Source§impl PartialEq for SchedulePolicy
impl PartialEq for SchedulePolicy
impl Copy for SchedulePolicy
impl Eq for SchedulePolicy
impl StructuralPartialEq for SchedulePolicy
Auto Trait Implementations§
impl Freeze for SchedulePolicy
impl RefUnwindSafe for SchedulePolicy
impl Send for SchedulePolicy
impl Sync for SchedulePolicy
impl Unpin for SchedulePolicy
impl UnsafeUnpin for SchedulePolicy
impl UnwindSafe for SchedulePolicy
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.