final class RetryPolicy[F[+_, +_], -A, +B] extends AnyRef
Instance Constructors
- new RetryPolicy(action: RetryFunction[F, A, B])
Value Members
- final def !=(arg0: Any): Boolean
- final def ##: Int
- def &&[A1 <: A, B1](policy: RetryPolicy[F, A1, B1])(implicit F: Applicative2[F]): RetryPolicy[F, A1, (B, B1)]
- final def ==(arg0: Any): Boolean
- def >>>[B1](that: RetryPolicy[F, B, B1])(implicit F: Monad2[F]): RetryPolicy[F, A, B1]
- val action: RetryFunction[F, A, B]
- final def asInstanceOf[T0]: T0
- def check[A1 <: A](pred: (A1, B) => Boolean)(implicit F: Functor2[F]): RetryPolicy[F, A1, B]
- def clone(): AnyRef
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- def finalize(): Unit
- final def getClass(): Class[_ <: AnyRef]
- def hashCode(): Int
- final def isInstanceOf[T0]: Boolean
- def map[B1](f: (B) => B1)(implicit F: Functor2[F]): RetryPolicy[F, A, B1]
- def modifyDelay(f: (B) => FiniteDuration)(implicit F: Functor2[F]): RetryPolicy[F, A, B]
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- final def synchronized[T0](arg0: => T0): T0
- def toString(): String
- final def wait(): Unit
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- def whileInput[A1 <: A](f: (A1) => Boolean)(implicit F: Applicative2[F]): RetryPolicy[F, A1, B]
- def whileOutput(f: (B) => Boolean)(implicit F: Applicative2[F]): RetryPolicy[F, A, B]
- def ||[A1 <: A, B1](policy: RetryPolicy[F, A1, B1])(implicit F: Applicative2[F]): RetryPolicy[F, A1, (B, B1)]
Inherited from AnyRef
Inherited from Any