The timed poll algorithm which uses jittered exponential backoff factor for calculating the next
poll execution time and throws PollException in case if total timeout or total number of
attempts is reached.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Hard to understand","hardToUnderstand","thumb-down"],["Incorrect information or sample code","incorrectInformationOrSampleCode","thumb-down"],["Missing the information/samples I need","missingTheInformationSamplesINeed","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2025-03-21 UTC."],[[["This webpage details the `ExponentialPollAlgorithm` class, which is a timed poll algorithm utilizing jittered exponential backoff for determining the next poll execution time."],["The `ExponentialPollAlgorithm` class is thread-safe and extends `ExponentialRetryAlgorithm`, inheriting several methods related to creating and managing retry attempts."],["The page lists numerous versions of the `ExponentialPollAlgorithm`, with version 2.63.1 being the latest available version, and lists all versions down to 2.7.1."],["The class constructor `ExponentialPollAlgorithm(RetrySettings globalSettings, ApiClock clock)` requires global retry settings and an `ApiClock` for time-related calculations."],["The `shouldRetry(TimedAttemptSettings nextAttemptSettings)` method determines if another poll attempt is needed, and it will throw a `PollException` if no more attempts should be made."]]],[]]
