RetryPolicy

retry.RetryPolicy
See theRetryPolicy companion object
case class RetryPolicy[M[_]](decideNextRetry: RetryStatus => M[PolicyDecision])

Attributes

Companion
object
Graph
Supertypes
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
Show all

Members list

Value members

Concrete methods

def flatMapDelay(f: FiniteDuration => M[FiniteDuration])(implicit M: Monad[M]): RetryPolicy[M]
def followedBy(rp: RetryPolicy[M])(implicit M: Apply[M]): RetryPolicy[M]
def join(rp: RetryPolicy[M])(implicit M: Apply[M]): RetryPolicy[M]

Combine this schedule with another schedule, giving up when either of the schedules want to give up and choosing the maximum of the two delays when both of the schedules want to delay the next retry. The dual of the meet operation.

Combine this schedule with another schedule, giving up when either of the schedules want to give up and choosing the maximum of the two delays when both of the schedules want to delay the next retry. The dual of the meet operation.

Attributes

def mapDelay(f: FiniteDuration => FiniteDuration)(implicit M: Functor[M]): RetryPolicy[M]
def mapK[N[_]](nt: FunctionK[M, N]): RetryPolicy[N]
def meet(rp: RetryPolicy[M])(implicit M: Apply[M]): RetryPolicy[M]

Combine this schedule with another schedule, giving up when both of the schedules want to give up and choosing the minimum of the two delays when both of the schedules want to delay the next retry. The dual of the join operation.

Combine this schedule with another schedule, giving up when both of the schedules want to give up and choosing the minimum of the two delays when both of the schedules want to delay the next retry. The dual of the join operation.

Attributes

def show: String

Inherited methods

def productElementNames: Iterator[String]

Attributes

Inherited from:
Product
def productIterator: Iterator[Any]

Attributes

Inherited from:
Product