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-07-01 UTC."],[[["This webpage details the `ExponentialPollAlgorithm` class, which is a timed poll algorithm utilizing jittered exponential backoff to determine the next poll execution time."],["The `ExponentialPollAlgorithm` class is part of the Google API Client Library for Java and is designed to manage retries when polling, throwing a `PollException` when time or attempt limits are reached."],["This class extends `ExponentialRetryAlgorithm` and inherits several methods, as well as contains a `shouldRetry` method that will return true if more attempts should be made, and instead will throw a `PollException` if no more attempts should be made."],["The `ExponentialPollAlgorithm` class provides a constructor to create new instances and takes in `RetrySettings` and `ApiClock` parameters for use."],["The page provides documentation for this class across multiple versions, ranging from 2.63.1 (latest) to version 2.7.1, with links to each version."]]],[]]
