Struct ReconnectPolicy 

pub struct ReconnectPolicy {
    pub max_attempts: u32,
    pub initial_backoff: Duration,
    pub max_backoff: Duration,
    pub total_budget: Duration,
    pub failure_cooldown: Duration,
}

Bounds on bringing a connection back.

The entire point of this machinery is killing a transfer that hangs forever, so a reconnect loop that can spin forever would reintroduce the bug in a new costume. Every field here exists to make that unreachable: attempts are counted, backoff is capped, and the whole thing runs under one wall-clock timeout.

Fields

max_attempts: u32

Dial attempts per revival, including the first. 0 disables reviving.

initial_backoff: Duration

Pause before the second attempt. Doubles each round, capped at max_backoff.

max_backoff: Duration

Ceiling on the backoff, so a server that is refusing connections is not hammered and the wait between attempts stays legible.

total_budget: Duration

Hard wall-clock ceiling on one revival, dial and authentication and every backoff included.

This is the bound that matters: the whole revival runs inside a single timeout of this length, so no attempt, however wedged, can outlive it.

failure_cooldown: Duration

How long a failed revival’s verdict stands before another caller is allowed to try again.

Without it, each of a deep pipeline’s callers pays the full total_budget in turn against a server that is plainly gone.

Trait Implementations

impl Clone for ReconnectPolicy

fn clone(&self) -> ReconnectPolicy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for ReconnectPolicy

impl Debug for ReconnectPolicy

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

Formats the value using the given formatter.

impl Default for ReconnectPolicy

fn default() -> Self

The shipping bounds.

Sized for the failures that actually recover — a Wi-Fi roam (1–5 s), a share flapping, a switch relearning a port — and deliberately NOT for a full NAS reboot (30–90 s). Sitting on a frozen transfer for minutes on the chance the box comes back is the behavior this whole effort exists to delete; surfacing a typed error at a minute lets the consumer retry the file, ask the user, or give up, all of which beat a silent stall.

Four attempts at 0.5 s → 1 s → 2 s of backoff leave the budget almost entirely to the dials themselves.

impl Eq for ReconnectPolicy

impl PartialEq for ReconnectPolicy

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for ReconnectPolicy