Skip to main content

Notes

  • satisfied drives the loop’s until.
  • The first attempt runs immediately; intervalMs is the delay between attempts.
  • Backoff scales that gap. For the Nth gap (1-indexed): fixed = intervalMs; linear = intervalMs * N; exponential = intervalMs * 2^(N-1).
  • The gap is a durable <Timer>: the run parks as waiting-timer between attempts, surviving a crash or resume instead of sleeping in-process. A detached run resumes via the gateway’s timer sweep.
  • intervalMs doesn’t bound how long a check may run; use checkTimeoutMs to cap a single attempt.

Source

The <Poller> implementation and the files it imports, straight from the package source. This section is generated; edit the source, not this block.