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 calculating the next poll execution time."],["The `ExponentialPollAlgorithm` class extends `ExponentialRetryAlgorithm` and is thread-safe, ensuring safe concurrent usage."],["The class constructor `ExponentialPollAlgorithm` takes `RetrySettings` and `ApiClock` parameters, which control the overall settings and time calculations."],["The `shouldRetry` method determines if another poll operation should be attempted, throwing a `PollException` if either the total timeout or the total number of attempts is exceeded."],["The page provides access to various versions of the ExponentialPollAlgorithm, ranging from the latest 2.63.1 down to 2.7.1, with links to each version's documentation."]]],[]]
