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 a jittered exponential backoff factor to determine the next poll execution time.\u003c/p\u003e\n"],["\u003cp\u003eThe \u003ccode\u003eExponentialPollAlgorithm\u003c/code\u003e class is thread-safe and throws a \u003ccode\u003ePollException\u003c/code\u003e if the total timeout or number of attempts is reached.\u003c/p\u003e\n"],["\u003cp\u003eIt inherits from \u003ccode\u003eExponentialRetryAlgorithm\u003c/code\u003e and further extends from \u003ccode\u003ejava.lang.Object\u003c/code\u003e, meaning it also includes their members and characteristics.\u003c/p\u003e\n"],["\u003cp\u003eThe \u003ccode\u003eshouldRetry\u003c/code\u003e method determines if another poll attempt should be made, returning true if so or throwing a \u003ccode\u003ePollException\u003c/code\u003e if the attempts or timeout have been exceeded.\u003c/p\u003e\n"],["\u003cp\u003eThe page lists all the available versions, with \u003ccode\u003e2.63.1\u003c/code\u003e being the latest version and has specific constructors and parameters including \u003ccode\u003eglobalSettings\u003c/code\u003e and \u003ccode\u003eclock\u003c/code\u003e.\u003c/p\u003e\n"]]],[],null,[]]
