Struct hedwig::googlepubsub::retry_policy::exponential_backoff::ExponentialBackoff

pub struct ExponentialBackoff<R, S = TokioSleeper> { /* fields omitted */ }

This is supported on crate feature google only.

A RetryPolicy which delays repeated retries by an increasing amount of time with each attempt.

Implementations

impl<R> ExponentialBackoff<R, TokioSleeper>

pub fn new(
    retry_check: R,
    config: Config
) -> ExponentialBackoff<R, TokioSleeper>

Create a new backoff policy which will produce retry intervals for errors that satisfy the given RetryPredicate

This uses the default Sleeper implementation, which might be unavailable depending on the crate’s enabled features. ExponentialBackoff::with_sleeper can be used to specify the sleeper instead of using the default

impl<R, S> ExponentialBackoff<R, S>

pub fn with_sleeper(
    retry_check: R,
    config: Config,
    sleeper: S
) -> ExponentialBackoff<R, S>

Create a new backoff policy which will produce retry intervals for errors that satisfy the given RetryPredicate, and uses the given Sleeper to produce the interval futures.

Trait Implementations

impl<R, S> Clone for ExponentialBackoff<R, S> where
    R: Clone,
    S: Clone, 

pub fn clone(&self) -> ExponentialBackoff<R, S>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<R, S> Debug for ExponentialBackoff<R, S> where
    R: Debug,
    S: Debug, 

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

Formats the value using the given formatter.

impl<T, E, R, S> RetryPolicy<T, E> for ExponentialBackoff<R, S> where
    R: RetryPredicate<E> + Clone,
    S: Sleeper + Clone,
    E: Debug,
    T: ?Sized, 

type RetryOp = ExponentialRetry<R, S>

The RetryOperation returned by new_operation

pub fn new_operation(
    &mut self
) -> <ExponentialBackoff<R, S> as RetryPolicy<T, E>>::RetryOp

Prepare to retry some operation.