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-08-15 UTC."],[[["\u003cp\u003eThis webpage details the \u003ccode\u003eExponentialPollAlgorithm\u003c/code\u003e class, which is a timed poll algorithm that uses jittered exponential backoff for calculating the next poll execution time.\u003c/p\u003e\n"],["\u003cp\u003eThe \u003ccode\u003eExponentialPollAlgorithm\u003c/code\u003e class can be instantiated by providing \u003ccode\u003eRetrySettings\u003c/code\u003e and an \u003ccode\u003eApiClock\u003c/code\u003e to define poll settings and time calculations.\u003c/p\u003e\n"],["\u003cp\u003eThis class extends \u003ccode\u003eExponentialRetryAlgorithm\u003c/code\u003e and inherits several of its members, and overrides the \u003ccode\u003eshouldRetry\u003c/code\u003e method.\u003c/p\u003e\n"],["\u003cp\u003eThe class is thread-safe and will throw a \u003ccode\u003ePollException\u003c/code\u003e when the total timeout or number of attempts is exceeded, otherwise it will return \u003ccode\u003etrue\u003c/code\u003e if more attempts are to be made.\u003c/p\u003e\n"],["\u003cp\u003eThe page contains a list of available versions for this algorithm, from 2.63.1 down to 2.7.1, allowing users to see the history of the algorithm.\u003c/p\u003e\n"]]],[],null,[]]
