object RetryPolicies
- Alphabetic
- By Inheritance
- RetryPolicies
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
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
-
def
alwaysGiveUp[M[_]](implicit arg0: Applicative[M]): RetryPolicy[M]
Don't retry at all and always give up.
Don't retry at all and always give up. Only really useful for combining with other policies.
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
capDelay[M[_]](cap: FiniteDuration, policy: RetryPolicy[M])(implicit arg0: Applicative[M]): RetryPolicy[M]
Set an upper bound on any individual delay produced by the given policy.
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
def
constantDelay[M[_]](delay: FiniteDuration)(implicit arg0: Applicative[M]): RetryPolicy[M]
Delay by a constant amount before each retry.
Delay by a constant amount before each retry. Never give up.
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
exponentialBackoff[M[_]](baseDelay: FiniteDuration)(implicit arg0: Applicative[M]): RetryPolicy[M]
Each delay is twice as long as the previous one.
Each delay is twice as long as the previous one. Never give up.
-
def
fibonacciBackoff[M[_]](baseDelay: FiniteDuration)(implicit arg0: Applicative[M]): RetryPolicy[M]
Delay(n) = Delay(n - 2) + Delay(n - 1)
Delay(n) = Delay(n - 2) + Delay(n - 1)
e.g. if
baseDelay
is 10 milliseconds, the delays before each retry will be 10 ms, 10 ms, 20 ms, 30ms, 50ms, 80ms, 130ms, ... -
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
fullJitter[M[_]](baseDelay: FiniteDuration)(implicit arg0: Applicative[M]): RetryPolicy[M]
"Full jitter" backoff algorithm.
"Full jitter" backoff algorithm. See https://aws.amazon.com/blogs/architecture/exponential-backoff-and-jitter/
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
limitRetries[M[_]](maxRetries: Int)(implicit arg0: Applicative[M]): RetryPolicy[M]
Retry without delay, giving up after the given number of retries.
-
def
limitRetriesByCumulativeDelay[M[_]](threshold: FiniteDuration, policy: RetryPolicy[M])(implicit arg0: Applicative[M]): RetryPolicy[M]
Add an upperbound to a policy such that once the cumulative delay over all retries has reached or exceeded the given limit, the policy will stop retrying and give up.
-
def
limitRetriesByDelay[M[_]](threshold: FiniteDuration, policy: RetryPolicy[M])(implicit arg0: Applicative[M]): RetryPolicy[M]
Add an upper bound to a policy such that once the given time-delay amount per try has been reached or exceeded, the policy will stop retrying and give up.
Add an upper bound to a policy such that once the given time-delay amount per try has been reached or exceeded, the policy will stop retrying and give up. If you need to stop retrying once cumulative delay reaches a time-delay amount, use limitRetriesByCumulativeDelay.
-
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()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()