A retry policy that always succeeds.
Constructs a new retry policy from an initial value and an update function.
A retry policy that always retries and counts the number of retries.
A retry policy that will keep retrying until the specified duration has elapsed.
A retry policy that always retries and computes the time since the beginning of the process.
A retry policy that always succeeds, collecting all errors into a list.
A retry policy that will always succeed, but will wait a certain amount
between retries, given by base * factor.pow(n), where n is the
number of retries so far.
A retry policy that always succeeds, increasing delays by summing the preceeding two delays (similar to the fibonacci sequence)
A retry policy that will always succeed, waiting the specified fixed duration between attempts.
A retry policy that always fails.
A retry policy that always succeeds with the specified constant state.
A retry policy that will keep retrying until the specified number of retries is reached.
A retry policy that always succeeds, and computes the state through repeated application of a function to a base value.