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 utilizing jittered exponential backoff for determining the next poll execution time.\u003c/p\u003e\n"],["\u003cp\u003eThe \u003ccode\u003eExponentialPollAlgorithm\u003c/code\u003e class is thread-safe and extends the \u003ccode\u003eExponentialRetryAlgorithm\u003c/code\u003e class.\u003c/p\u003e\n"],["\u003cp\u003eThe primary function of this class is to manage polling attempts, throwing a \u003ccode\u003ePollException\u003c/code\u003e when the total timeout or maximum number of attempts is reached.\u003c/p\u003e\n"],["\u003cp\u003eThe latest version is \u003ccode\u003e2.63.1\u003c/code\u003e, with a comprehensive list of previous versions ranging from \u003ccode\u003e2.62.0\u003c/code\u003e down to \u003ccode\u003e2.7.1\u003c/code\u003e, all linked to their respective documentation.\u003c/p\u003e\n"],["\u003cp\u003eThe \u003ccode\u003eshouldRetry\u003c/code\u003e method determines if additional polling attempts are necessary, throwing a \u003ccode\u003ePollException\u003c/code\u003e instead of returning false if no more are allowed.\u003c/p\u003e\n"]]],[],null,[]]