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-17 UTC."],[[["The document 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 document includes an extensive list of historical versions of the `ExponentialPollAlgorithm`, ranging from version 2.63.1 down to 2.7.1, each with links to their respective documentation."],["The constructor for `ExponentialPollAlgorithm` requires `RetrySettings` and `ApiClock` to manage global settings and time calculations."],["The `shouldRetry` method determines if another poll attempt should be made based on the given `TimedAttemptSettings`, throwing a `PollException` instead of returning `false` if no more attempts are allowed."]]],[]]
