case class RetryPolicy[M[_]](decideNextRetry: (RetryStatus) => M[PolicyDecision]) extends Product with Serializable
- Alphabetic
- By Inheritance
- RetryPolicy
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new RetryPolicy(decideNextRetry: (RetryStatus) => M[PolicyDecision])
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- val decideNextRetry: (RetryStatus) => M[PolicyDecision]
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def flatMapDelay(f: (FiniteDuration) => M[FiniteDuration])(implicit M: Monad[M]): RetryPolicy[M]
- def followedBy(rp: RetryPolicy[M])(implicit M: Apply[M]): RetryPolicy[M]
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- 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.
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. - 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.
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. - final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def show: String
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()