RetryOps

abstract def retryLogic(f: F[(A, List[L])], t: Duration, ts: Seq[Duration], es: ⇒ Stream[L], p: (L) ⇒ Boolean, accumulateErrors: Boolean): F[(A, List[L])]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def loop(ds: Seq[Duration], es: ⇒ Stream[L], p: (L) ⇒ Boolean, accumulateErrors: Boolean): F[(A, List[L])]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def retry(delays: Seq[Duration], p: (L) ⇒ Boolean): F[A]

Retries this F if it fails, once for each element in delays, each retry delayed by the corresponding duration.

def retryAccumulating(delays: Seq[Duration], p: (L) ⇒ Boolean): F[(A, List[L])]

Retries this F if it fails, once for each element in delays, each retry delayed by the corresponding duration, accumulating left sides into a list.

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