object Retry
- Alphabetic
- By Inheritance
- Retry
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
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
lazy val
always: Retry[Any, Unit]
A retry policy that always succeeds.
-
final
def
apply[E, A](initial0: IO[Nothing, A], update0: (E, A) ⇒ IO[Nothing, Decision[A]]): Retry[E, A]
Constructs a new retry policy from an initial value and an update function.
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
val
counted: Retry[Any, Int]
A retry policy that always retries and counts the number of retries.
-
final
def
duration(duration: Duration): Retry[Any, Duration]
A retry policy that will keep retrying until the specified duration has elapsed.
-
final
val
elapsed: Retry[Any, Duration]
A retry policy that always retries and computes the time since the beginning of the process.
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
errors[E]: Retry[E, List[E]]
A retry policy that always succeeds, collecting all errors into a list.
-
final
def
exponential(base: Duration, factor: Double = 2.0): Retry[Any, Duration]
A retry policy that will always succeed, but will wait a certain amount between retries, given by
base * factor.pow(n), wherenis the number of retries so far. -
final
def
fibonacci(one: Duration): Retry[Any, Duration]
A retry policy that always succeeds, increasing delays by summing the preceeding two delays (similar to the fibonacci sequence)
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
fixed(delay: Duration): Retry[Any, Int]
A retry policy that will always succeed, waiting the specified fixed duration between attempts.
-
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
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
lazy val
never: Retry[Any, Unit]
A retry policy that always fails.
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
point[A](a: ⇒ A): Retry[Any, A]
A retry policy that always succeeds with the specified constant state.
-
final
def
retries(max: Int): Retry[Any, Int]
A retry policy that will keep retrying until the specified number of retries is reached.
-
final
def
stateful[A](a: A)(f: (A) ⇒ A): Retry[Any, A]
A retry policy that always succeeds, and computes the state through repeated application of a function to a base value.
-
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
- @native() @throws( ... )
- object Decision extends Serializable