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 calculating the next poll execution time."],["The `ExponentialPollAlgorithm` class is thread-safe and extends `ExponentialRetryAlgorithm`, inheriting several methods related to retry attempts."],["The latest version documented on the page is 2.63.1, while version 2.19.6 is also specifically called out with information about its methods and class constructor."],["The primary method of `ExponentialPollAlgorithm` is `shouldRetry`, which determines if another poll attempt should be made or if a `PollException` should be thrown due to exceeding the timeout or number of attempts."],["The page includes a comprehensive list of historical versions of the ExponentialPollAlgorithm, ranging from the latest down to version 2.7.1."]]],[]]
