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-28 UTC."],[[["\u003cp\u003eThis webpage details the \u003ccode\u003eExponentialPollAlgorithm\u003c/code\u003e class, which is a timed poll algorithm utilizing jittered exponential backoff to determine 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 is \u003ccode\u003e2.63.1\u003c/code\u003e, and a historical list of previous versions dating back to \u003ccode\u003e2.7.1\u003c/code\u003e is available.\u003c/p\u003e\n"],["\u003cp\u003eThe class includes a constructor that takes \u003ccode\u003eRetrySettings\u003c/code\u003e and \u003ccode\u003eApiClock\u003c/code\u003e parameters, and it throws a \u003ccode\u003ePollException\u003c/code\u003e when the total timeout or number of attempts is exceeded.\u003c/p\u003e\n"],["\u003cp\u003eThe \u003ccode\u003eshouldRetry\u003c/code\u003e method determines whether another poll attempt should be made, throwing a \u003ccode\u003ePollException\u003c/code\u003e instead of returning \u003ccode\u003efalse\u003c/code\u003e.\u003c/p\u003e\n"]]],[],null,[]]
