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 the \u003ccode\u003eExponentialRetryAlgorithm\u003c/code\u003e class.\u003c/p\u003e\n"],["\u003cp\u003eThe page provides links to various versions of the class documentation, ranging from version 2.63.1 down to 2.7.1, with version 2.63.1 being the latest.\u003c/p\u003e\n"],["\u003cp\u003eThe algorithm throws a \u003ccode\u003ePollException\u003c/code\u003e if the total timeout or total number of attempts is reached during polling.\u003c/p\u003e\n"],["\u003cp\u003eIt includes a constructor for creating a new instance and a \u003ccode\u003eshouldRetry\u003c/code\u003e method, that returns true if another poll operation should be made or throws a \u003ccode\u003ePollException\u003c/code\u003e.\u003c/p\u003e\n"]]],[],null,[]]
