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-02 UTC."],[[["This webpage details the `ExponentialPollAlgorithm` class, which is a timed poll algorithm utilizing jittered exponential backoff to determine the next poll execution time."],["The `ExponentialPollAlgorithm` class is thread-safe and extends `ExponentialRetryAlgorithm`, inheriting several methods like `createFirstAttempt` and `shouldRetry`."],["The class's main functionality is determined by its method, `shouldRetry`, which determines if another poll attempt should be made based on `TimedAttemptSettings` and throws a `PollException` if no more attempts are allowed."],["A constructor, `ExponentialPollAlgorithm(RetrySettings globalSettings, ApiClock clock)`, is provided for creating an instance of this class, requiring global poll settings and an `ApiClock` for time-related calculations."],["The page also lists numerous versions of the `ExponentialPollAlgorithm` ranging from version 2.63.1 (latest) all the way back to 2.7.1."]]],[]]
