Skip to content

Instantly share code, notes, and snippets.

Embed
What would you like to do?
Fibonacci Backoff Strategy
import groovy.transform.Memoized
class FibBackoff {
int tryNum
void backoff() {
tryNum = fib(tryNum)
sleep(tryNum * 1000)
}
@Memoized
private int fib(n) {
if (n < 2) return 1
return fib(n - 1) + fib(n - 2)
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment