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 in the Google API client library for Java."],["The `ExponentialPollAlgorithm` class uses jittered exponential backoff to determine the time until the next poll execution, and it will throw a `PollException` if the total timeout or maximum attempts is reached."],["The class `ExponentialPollAlgorithm` is thread-safe and extends `ExponentialRetryAlgorithm`, inheriting several methods for creating and managing attempts."],["The latest version of the documentation available is version 2.63.1, and the page provides links to documentation for numerous prior versions, dating back to version 2.7.1."],["`shouldRetry` is a method that determines whether another poll attempt should be performed, throwing a `PollException` when no more attempts should be made, as opposed to returning `false`."]]],[]]
