Retry and repeat

A common demand when working with actions is to retry or repeat them when (adverse) certain circumstances happen. Usually, the retrial or repetition does not occur immediately; instead, it is done based on a policy. For instance, when fetching content from a network request, we may want to retry it when it fails using an exponential backoff algorithm for a maximum of 15 seconds or 5 attempts, whatever happens first.

Additional context for this pattern

Retry pattern in Cloud Design Patterns.

Schedule allows you to define and compose powerful yet simple policies. There are two steps involved in using Schedule.

1. First, we need to construct a policy, which specifies the amount and the delay in repetition.
2. Then we run this schedule with a specified action. There are two ways to do so:
   • retry executes the action once, and if it fails, it is reattempted based on the scheduling policy. It stops when the action succeeds or when the policy determines it should not be reattempted again.
   • repeat executes the action, and if it succeeds, keeps executing it again based on the scheduling policy passed as an argument. It stops if the action fails or the policy determines it should not be executed again. It returns the last internal state of the scheduling policy or the error that happened running the action.

Constructing a policy

Scheduling policies are constructed using the methods in Schedule's companion object. Schedule policies also return values on each step, which can be used to take decisions based on previous values.

One of the simplest policies is recurring ten times. This means that if we call repeat, the same action is performed ten times, and if we call retry, the action is attempted until successful for a maximum of ten times.

fun <A> recurTenTimes() = Schedule.recurs<A>(10)

The exponential backoff algorithm is a standard algorithm to retry operations communicating with external services, such as network requests. Roughly, this means that the delay between attempts increases by the given factor.

@ExperimentalTime
val exponential = Schedule.exponential<Unit>(250.milliseconds)

Here's a much more complex schedule. Let's walk through it step by step:

• It recurs with exponential backoff as long as the delay is less than 60 seconds.
• Afterwards, we have a spaced (constant) delay of 60 seconds for up to 100 attempts.
• Some random noise is added by calling jittered.
• We also collect every input to the schedule and return it.

@ExperimentalTime
fun <A> complexPolicy(): Schedule<A, List<A>> =
  Schedule.exponential<A>(10.milliseconds).doWhile { _, duration -> duration < 60.seconds }
    .andThen(Schedule.spaced<A>(60.seconds) and Schedule.recurs(100)).jittered()
    .zipRight(Schedule.identity<A>().collect())

Repeating an action

When we repeat an action, we do it as long as it is successful and the scheduling policy tells us to keep recursing. For example, this block repeats an action three times after its first successful execution (so four times in total).

suspend fun example(): Unit {
  var counter = 0
  val res = Schedule.recurs<Unit>(3).repeat {
    counter++
  }
  counter shouldBe 4
}

Notice that we did not handle the error case. There are overloads repeatOrElse and repeatOrElseEither offering that capability. Repeat will just rethrow any error encountered.

Collecting values

Using repeat, the resulting value is the number of iterations it has performed. We're throwing away any value produced by each iteration of the repetition. But we have three other possibilities:

• Discard all results; that is, return Unit.
• Discard all intermediate results and just keep the last produced result.
• Keep all intermediate results.

To discard the values provided by the repetition of the action, we combine our policy with Schedule.unit, using the zipLeft or zipRight combinators, which keep just the output of one of the policies:

suspend fun example(): Unit {
  var counter = 0

  val keepLeft = (Schedule.identity<Unit>() zipLeft Schedule.recurs(3)).repeat {
    counter++
  }
  val keepRight = (Schedule.recurs<Unit>(3) zipRight Schedule.identity<Unit>()).repeat {
    counter++
  }

  counter shouldBe 8
  keepLeft shouldBe Unit
  keepRight shouldBe Unit
}

Following the same strategy, we can zip it with the Schedule.identity policy to keep only the last result of the action.

suspend fun example(): Unit {
  var counter = 0

  val keepLast = (Schedule.identity<String>() zipLeft Schedule.recurs(3)).repeat {
    counter++; "$counter"
  }
  
  keepLast shouldBe "4"
}

Finally, if we want to keep all intermediate results, we can zip the policy with Schedule.collect.

suspend fun example(): Unit {
  var counter = 0

  val keepAll = (Schedule.collect<Int>() zipLeft Schedule.recurs(3)).repeat {
    counter++
    counter
  }

  keepAll shouldBe listOf(1, 2, 3, 4)
}

Until/while it produces a certain value

We can make use of the policies doWhile and doUntil to repeat an action while or until its produced result matches a given predicate.

suspend fun example(): Unit {
  var result = ""

  Schedule.doWhile<String>  { input, _ -> input.length <= 5 }.repeat {
    result += "a"
    result
  }
  
  result shouldBe "aaaaaa"
}