pub enum Interleaving {
Canonical,
Seeded,
}Expand description
How the parallel task set of each super-step is ordered.
Variants§
Canonical
Recorded order. The baseline every randomized run compares against.
Seeded
A seeded permutation drawn from the run’s RngSource — mechanism
2: the same evidence re-driven under one point of the interleaving
distribution. Journaled event order stays canonical; admission
waits, and therefore per-node latencies, follow the drawn order.
Trait Implementations§
Source§impl Clone for Interleaving
impl Clone for Interleaving
impl Copy for Interleaving
Source§impl Debug for Interleaving
impl Debug for Interleaving
Source§impl Default for Interleaving
impl Default for Interleaving
Source§impl<'de> Deserialize<'de> for Interleaving
impl<'de> Deserialize<'de> for Interleaving
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl Eq for Interleaving
Source§impl PartialEq for Interleaving
impl PartialEq for Interleaving
Source§impl Serialize for Interleaving
impl Serialize for Interleaving
impl StructuralPartialEq for Interleaving
Auto Trait Implementations§
impl Freeze for Interleaving
impl RefUnwindSafe for Interleaving
impl Send for Interleaving
impl Sync for Interleaving
impl Unpin for Interleaving
impl UnsafeUnpin for Interleaving
impl UnwindSafe for Interleaving
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