Enum RetryClass 

pub enum RetryClass {
    Retryable,
    Permanent,
}

Whether a failure is worth retrying as-is.

This mirrors the transport layer’s TransportErrorKind: a Retryable failure is transient (a later attempt may succeed), a Permanent failure is deterministic (re-running the identical operation cannot change the outcome). It lives in the lock module — the lowest layer that needs it — so both LockError and RepositoryError can share one vocabulary without the repository layer depending on the bus.

Variants

Retryable

A transient failure. Retrying the same operation may succeed.

Permanent

A deterministic failure. Retrying the identical operation will not help.

Implementations

impl RetryClass

pub fn is_retryable(self) -> bool

Whether this class is retryable.

pub fn is_permanent(self) -> bool

Whether this class is permanent.

Trait Implementations

impl Clone for RetryClass

fn clone(&self) -> RetryClass

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for RetryClass

impl Debug for RetryClass

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

Formats the value using the given formatter.

impl Eq for RetryClass

impl Hash for RetryClass

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for RetryClass

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for RetryClass