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."],[[["The webpage details the `ExponentialPollAlgorithm` class, which is a timed poll algorithm utilizing jittered exponential backoff for determining the next poll execution time."],["`ExponentialPollAlgorithm` extends `ExponentialRetryAlgorithm` and is designed to throw a `PollException` when the total timeout or the maximum number of attempts is reached, and is thread-safe."],["The page includes an extensive list of historical versions of the `ExponentialPollAlgorithm`, ranging from the latest version 2.63.1 down to version 2.7.1."],["The `ExponentialPollAlgorithm` constructor requires `RetrySettings` and an `ApiClock` for creating a new instance, allowing for customization of global settings and time calculations."],["The `shouldRetry` method of `ExponentialPollAlgorithm` determines if another poll attempt should be made, and instead of returning false it will throw a `PollException`."]]],[]]
