Struct RetryPolicy 

pub struct RetryPolicy {
    pub max_retries: u32,
    pub retry_delay_ms: u64,
    pub deadline: Option<Duration>,
}

How hard to retry, and for how long overall.

use dataflow_rs::RetryPolicy;
use std::time::Duration;

// Three retries, 100ms doubling, but never more than 5s in total.
let policy = RetryPolicy {
    max_retries: 3,
    retry_delay_ms: 100,
    deadline: Some(Duration::from_secs(5)),
};
assert_eq!(policy.max_retries, 3);

Fields

max_retries: u32

Retries after the first attempt. 0 means try once and give up.

retry_delay_ms: u64

Base delay. Doubles per attempt, capped at 60s.

deadline: Option<Duration>

Wall-clock ceiling for the whole loop, sleeps included.

Without this, a call with a 30s per-attempt timeout and capped backoff can run to roughly 127s under a 30s caller budget — the per-attempt bound says nothing about the total.

Implementations

impl RetryPolicy

pub fn none() -> Self

A policy that never retries. Useful as an explicit opt-out at a call site that takes a policy.

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 Copy for RetryPolicy

impl Debug for RetryPolicy

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

Formats the value using the given formatter.

impl Default for RetryPolicy

fn default() -> Self

Three retries, 100ms base delay, no deadline.

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