Struct RetryPolicy 

#[non_exhaustive]
pub struct RetryPolicy {
    pub attempts: u32,
    pub base_delay: Duration,
    pub retry_on: Cow<'static, [u16]>,
}

How many times an operation may be sent, and how the waits between attempts grow. Every operation carries one: a modelled route’s comes from the behavior model, a raw call’s from the client, and both are held under the client’s own ceilings.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

attempts: u32

Total attempts, the first included. One means the call is never resent.

base_delay: Duration

The first backoff, doubled after every attempt.

retry_on: Cow<'static, [u16]>

The statuses that are resent.

Implementations

impl RetryPolicy

pub fn none() -> RetryPolicy

A call sent once and never resent.

pub fn retries(&self, status: u16) -> bool

Whether an answer with this status is resent.

Trait Implementations

impl Clone for RetryPolicy

fn clone(&self) -> RetryPolicy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RetryPolicy

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

Formats the value using the given formatter.

impl Eq for RetryPolicy

impl PartialEq for RetryPolicy

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for RetryPolicy