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-02 UTC."],[[["This webpage details the `ExponentialPollAlgorithm` class, which is a timed poll algorithm that uses a jittered exponential backoff factor to calculate the next poll execution time."],["The `ExponentialPollAlgorithm` will throw a `PollException` if the total timeout or number of attempts is reached, and it is designed to be thread-safe."],["The class inherits from `ExponentialRetryAlgorithm` and further from `java.lang.Object`, including various methods for managing retry attempts, such as creating attempts and checking if retries should continue."],["The `shouldRetry` method determines if another poll operation should occur, and it will throw a `PollException` if it should not, instead of returning `false`."],["The page also provides a list of all versions of this class, with the latest being 2.63.1, and version 2.39.0 also having detailed information available."]]],[]]
