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\u003eThe page provides a comprehensive list of versions for \u003ccode\u003eExponentialPollAlgorithm\u003c/code\u003e, ranging from version 2.63.1 (latest) down to 2.7.1.\u003c/p\u003e\n"],["\u003cp\u003e\u003ccode\u003eExponentialPollAlgorithm\u003c/code\u003e is a timed poll algorithm that employs a jittered exponential backoff strategy to calculate the next poll execution time.\u003c/p\u003e\n"],["\u003cp\u003eThis class will throw a \u003ccode\u003ePollException\u003c/code\u003e if the maximum timeout or total number of attempts is reached, and is considered thread-safe for concurrent use.\u003c/p\u003e\n"],["\u003cp\u003eIt inherits from \u003ccode\u003eExponentialRetryAlgorithm\u003c/code\u003e and provides methods like \u003ccode\u003eshouldRetry\u003c/code\u003e, which determines if another poll should be made, throwing a \u003ccode\u003ePollException\u003c/code\u003e if not.\u003c/p\u003e\n"],["\u003cp\u003eThe \u003ccode\u003eExponentialPollAlgorithm\u003c/code\u003e class constructor requires \u003ccode\u003eRetrySettings\u003c/code\u003e and \u003ccode\u003eApiClock\u003c/code\u003e to create a new algorithm instance, to be able to use time-specific calculations.\u003c/p\u003e\n"]]],[],null,[]]
