Enum Jitter 

#[non_exhaustive]
pub enum Jitter {
    None,
    Full,
    Equal,
    Decorrelated,
}

How retry delays are randomized to avoid synchronized retries.

The non-None modes follow the taxonomy from the AWS Architecture Blog’s “Exponential Backoff And Jitter”: full, equal, and decorrelated.

#[non_exhaustive]: more modes may be added, so a match needs a wildcard.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

None

No randomization: the delay is exactly the (capped) base curve.

Full

Uniform in [0, delay]. Maximum spread; a retry can fire almost immediately.

Equal

Half the delay plus a uniform half: delay/2 + rand(0, delay/2). Keeps a floor under each wait while still spreading.

Decorrelated

min(max, rand(base, previous * 3)). Self-correlated growth that adapts to observed waits; the strongest at breaking up a thundering herd, and the default.

Trait Implementations

impl Clone for Jitter

fn clone(&self) -> Jitter

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Jitter

impl Debug for Jitter

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

Formats the value using the given formatter.

impl Default for Jitter

fn default() -> Jitter

Returns the “default value” for a type.

impl Eq for Jitter

impl PartialEq for Jitter

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