Struct RetryPace 

pub struct RetryPace { /* private fields */ }

Pacing for a recovery loop that never gives up.

Construct once, wait() before each attempt. There is no next() that grows, no attempt counter, and no terminal state — that absence is the contract.

Implementations

impl RetryPace

pub const fn fixed(base: Duration) -> Self

A fixed interval with no jitter.

Correct only where nothing else on the estate is looping against the same resource on the same cadence. If two independent loops can rendezvous, use RetryPace::jittered.

pub const fn jittered(base: Duration, jitter: Duration) -> Self

A fixed interval plus a uniform random 0..=jitter.

The jitter breaks phase-lock between two loops that have no shared clock, which is what the WFB bind rendezvous needs.

pub const fn base(&self) -> Duration

The floor of the interval.

pub const fn jitter(&self) -> Duration

The width of the jitter window.

pub fn wait(&self) -> Duration

The wait before the next attempt.

Deliberately takes no attempt index: an interval that could vary by attempt is an interval that can grow, and the whole point is that this one cannot. Compute the jitter from rand in 0..=jitter; a failure to read the OS entropy source degrades to zero jitter rather than propagating, because a loop that stops pacing is worse than a loop that briefly loses its phase-lock protection.

pub fn max_wait(&self) -> Duration

The widest wait this pace can produce, for a test or a doc.

Trait Implementations

impl Clone for RetryPace

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for RetryPace

impl Debug for RetryPace

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

Formats the value using the given formatter.

impl Eq for RetryPace

impl PartialEq for RetryPace

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for RetryPace