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 calculating 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 like \u003ccode\u003ecreateFirstAttempt\u003c/code\u003e and \u003ccode\u003eshouldRetry\u003c/code\u003e.\u003c/p\u003e\n"],["\u003cp\u003eThe class includes a constructor that takes \u003ccode\u003eRetrySettings\u003c/code\u003e and \u003ccode\u003eApiClock\u003c/code\u003e as parameters to create a new instance, and will use them for time-specific calculations.\u003c/p\u003e\n"],["\u003cp\u003eThe \u003ccode\u003eshouldRetry\u003c/code\u003e method determines if another poll operation should occur, throwing a \u003ccode\u003ePollException\u003c/code\u003e if the total timeout or number of attempts is exceeded instead of returning false.\u003c/p\u003e\n"],["\u003cp\u003eThis page contains the API information for \u003ccode\u003eExponentialPollAlgorithm\u003c/code\u003e across several versions, with 2.63.1 being the latest and 2.7.1 being the oldest version.\u003c/p\u003e\n"]]],[],null,[]]
