Packages

trait RetryStrategy extends AnyRef

A RetryStrategy is conceptually a lazy sequence of delays, possibly infinite.

Self Type
RetryStrategy
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RetryStrategy
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def nextRetry: commons.Opt[(FiniteDuration, RetryStrategy)]

    Determines a delay that will be waited before retrying some operation that failed (e.g.

    Determines a delay that will be waited before retrying some operation that failed (e.g. Redis connection attempt) and also returns next retry strategy that should be used if that retry itself also fails. If this method returns Opt.Empty, the operation will not be retried and failure should be reported.

Concrete Value Members

  1. def andThen(otherStrategy: RetryStrategy): RetryStrategy

    Concatenates two retry strategies, understood as lazy sequences of delays.

  2. def maxDelay(duration: FiniteDuration): RetryStrategy

    Limits the maximum delay between retries to some specified duration.

  3. def maxRetries(retries: Int): RetryStrategy

    Limits the maximum number of retries to some specified number.

  4. def maxTotal(duration: FiniteDuration): RetryStrategy

    Limits the maximum total duration (sum of retry delays) to some specified duration.

  5. def next: RetryStrategy
  6. def randomized(minFactor: Double, maxFactor: Double): RetryStrategy

    Randomizes delays.

    Randomizes delays. Each delay is multiplied by a factor which is randomly and uniformly choosen from specified segment [minFactor, maxFactor) (e.g. 0.9 to 1.1)