Struct TransientPolicy 

pub struct TransientPolicy<P> {
    pub is_transient: P,
    pub max_retries: usize,
}

Which probe failures are contention — not attributable to the range’s contents — and how many re-probes they may buy.

The default classification is [is_contention]: a deadlock victim or a serialization failure, recognised anywhere in the error’s source chain. Override it for error types of your own that describe the same thing: a failure that says nothing about the items, only about the interleaving.

Other transients are left to the search on purpose. An optimistic-concurrency conflict names one stale item, so splitting isolates it where re-probing the same range would only conflict again; a lost connection cannot be re-probed at all, and surfaces as the helper’s outer Err on the next savepoint instead.

Fields

is_transient: P

Returns true when a probe failure carries no information about the range’s contents.

max_retries: usize

How many transient re-probes the whole search may take before it is abandoned.

Implementations

impl<P> TransientPolicy<P>

pub fn new(is_transient: P) -> Self

A policy with the default retry allowance.

pub fn with_max_retries(self, max_retries: usize) -> Self

Overrides the retry allowance.

Trait Implementations

impl<P: Clone> Clone for TransientPolicy<P>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<P: Copy> Copy for TransientPolicy<P>

impl<P: Debug> Debug for TransientPolicy<P>

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

Formats the value using the given formatter.