RetryPolicy

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

6. val decideNextRetry: (RetryStatus) ⇒ M[PolicyDecision]

   

7. final def eq(arg0: AnyRef): Boolean

   

   Definition Classes

   AnyRef

8. def finalize(): Unit

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( classOf[java.lang.Throwable] )

9. def flatMapDelay(f: (FiniteDuration) ⇒ M[FiniteDuration])(implicit M: Monad[M]): RetryPolicy[M]

   

10. def followedBy(rp: RetryPolicy[M])(implicit M: Apply[M]): RetryPolicy[M]

    

11. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

12. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

13. 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.

14. def mapDelay(f: (FiniteDuration) ⇒ FiniteDuration)(implicit M: Functor[M]): RetryPolicy[M]

    

15. def mapK[N[_]](nt: FunctionK[M, N]): RetryPolicy[N]

    

16. 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.

17. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

18. final def notify(): Unit

    

    Definition Classes

    AnyRef

19. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

20. def show: String

    

21. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

22. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

23. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

24. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )