Retry

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

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def retry[A](times: Int, shouldRetry: (Throwable) ⇒ Boolean = alwaysRetry)(fBlock: ⇒ Future[A])(implicit ec: ExecutionContext): Future[A]

Evaluate a block that creates a future up to a specific number of times, if the future fails, decide if to retry using the shouldRetry predicate, if it returns true - retry else return the failed future.

def retryWithBackOff[A](times: Int, backOffUnit: FiniteDuration, shouldRetry: (Throwable) ⇒ Boolean = alwaysRetry)(fBlock: ⇒ Future[A])(implicit ec: ExecutionContext): Future[A]

Evaluate a block that creates a future up to a specific number of times, if the future fails, decide about retrying using a predicate, if it should retry an exponential back off is applied so that the retry waits longer and longer for every retry it makes.

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

def toString(): String

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit