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"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2025-07-02 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 for managing retry attempts."],["The latest version documented on the page is 2.63.1, but it lists various other versions from 2.62.0 all the way back to 2.7.1, each linked to its specific documentation."],["The class can be constructed using `RetrySettings` and `ApiClock`, allowing for customized poll settings and time-specific calculations."],["The `shouldRetry` method determines if another poll operation should occur, and if not, it will throw a `PollException` if the total timeout or number of attempts has been exceeded."]]],[]]
