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-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, inheriting several methods like \u003ccode\u003ecreateFirstAttempt\u003c/code\u003e and \u003ccode\u003eshouldRetry\u003c/code\u003e.\u003c/p\u003e\n"],["\u003cp\u003eThe latest version of this class is 2.63.1, and the page also provides documentation links for versions dating back to 2.7.1.\u003c/p\u003e\n"],["\u003cp\u003eThe class constructor, \u003ccode\u003eExponentialPollAlgorithm(RetrySettings globalSettings, ApiClock clock)\u003c/code\u003e, requires global poll settings and an \u003ccode\u003eApiClock\u003c/code\u003e for time calculations.\u003c/p\u003e\n"],["\u003cp\u003eThe \u003ccode\u003eshouldRetry(TimedAttemptSettings nextAttemptSettings)\u003c/code\u003e method determines if another poll operation should be made, and it will throw a \u003ccode\u003ePollException\u003c/code\u003e if no more attempts are allowed due to timeouts or attempt limits.\u003c/p\u003e\n"]]],[],null,[]]
