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 \u003ccode\u003eExponentialRetryAlgorithm\u003c/code\u003e, inheriting several methods for managing retry attempts.\u003c/p\u003e\n"],["\u003cp\u003eThe latest version documented on the page is 2.63.1, but it lists various other versions from 2.62.0 all the way back to 2.7.1, each linked to its specific documentation.\u003c/p\u003e\n"],["\u003cp\u003eThe class can be constructed using \u003ccode\u003eRetrySettings\u003c/code\u003e and \u003ccode\u003eApiClock\u003c/code\u003e, allowing for customized poll settings and time-specific calculations.\u003c/p\u003e\n"],["\u003cp\u003eThe \u003ccode\u003eshouldRetry\u003c/code\u003e method determines if another poll operation should occur, and if not, it will throw a \u003ccode\u003ePollException\u003c/code\u003e if the total timeout or number of attempts has been exceeded.\u003c/p\u003e\n"]]],[],null,[]]
