Struct ExponentialBackoffRetryPolicy

pub struct ExponentialBackoffRetryPolicy<E> { /* private fields */ }

The exponential backoff strategy is a retry approach that doubles the delay between retries. A combined exponential backoff and jitter strategy is recommended that is “Exponential Backoff and Jitter”. This is helpful to avoid Thundering Herd Problem.

Implementations

impl<E: Error> ExponentialBackoffRetryPolicy<E>

pub fn new(base_delay: Duration) -> ExponentialBackoffRetryPolicy<E>

Constructs a new instance using base_delay.

base_delay is the base delay duration for the backoff algorithm. First retry is base_delay after first attempt.

Trait Implementations

impl<E: Error> RetryPolicy for ExponentialBackoffRetryPolicy<E>

type E = E

The error type returned by the operation in retry.

fn next_delay(&self, context: &RetryContext<'_, Self::E>) -> Option<Duration>

Returns the duration to wait before trying the next attempt. context represents the context of a retry operation.

fn with_max_attempts(self, max_attempts: u32) -> MaxAttemptsRetryPolicy<Self>

Returns a new RetryPolicy that respects the given maximum attempts.

fn with_max_total_delay( self, max_total_delay: Duration, ) -> MaxTotalDelayRetryPolicy<Self>

Returns a new RetryPolicy that respects the given total delay.

fn with_max_jitter(self, max_jitter: Duration) -> JitteredRetryPolicy<Self>

Returns a new RetryPolicy that adds jitter(random delay) to underlying policy.

fn skip_retry_on_error<F>(self, function: F) -> FilteredRetryPolicy<Self, F>

where F: 'static + Fn(&Self::E) -> bool,

Skips retrying on errors that evaluate to true after applying function.