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-07-01 UTC."],[[["This webpage details the `ExponentialPollAlgorithm` class, which is a timed poll algorithm utilizing a jittered exponential backoff factor to determine the next poll execution time."],["The `ExponentialPollAlgorithm` extends the `ExponentialRetryAlgorithm` and is designed to throw a `PollException` when the total timeout or the maximum number of attempts is reached."],["The page lists various versions of the package, with version 2.63.1 being the latest and version 2.7.1 being the lowest, and links to each of their specific documentations."],["The class's constructor, `ExponentialPollAlgorithm(RetrySettings globalSettings, ApiClock clock)`, allows the creation of new instances, requiring both `RetrySettings` and an `ApiClock` for proper function."],["The `shouldRetry(TimedAttemptSettings nextAttemptSettings)` method indicates whether another poll operation should occur, and throws a `PollException` instead of returning false when no more attempts should be made."]]],[]]
