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-04-17 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 retry attempts and settings."],["The `shouldRetry` method in `ExponentialPollAlgorithm` determines if another poll attempt should be made, throwing a `PollException` if the total timeout or number of attempts is exceeded, instead of returning false."],["The class constructor requires `RetrySettings` for global poll settings and an `ApiClock` for time-specific calculations."],["The page contains a list of versions for this `ExponentialPollAlgorithm`, from 2.63.1 down to 2.7.1, with links to their respective documentation."]]],[]]
