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 that uses jittered exponential backoff for calculating the next poll execution time.\u003c/p\u003e\n"],["\u003cp\u003eThe \u003ccode\u003eExponentialPollAlgorithm\u003c/code\u003e class will throw a \u003ccode\u003ePollException\u003c/code\u003e if the total timeout or the total number of attempts has been reached.\u003c/p\u003e\n"],["\u003cp\u003eThis \u003ccode\u003eExponentialPollAlgorithm\u003c/code\u003e class is thread-safe and inherits from the \u003ccode\u003eExponentialRetryAlgorithm\u003c/code\u003e class.\u003c/p\u003e\n"],["\u003cp\u003eThe class's \u003ccode\u003eshouldRetry\u003c/code\u003e method returns \u003ccode\u003etrue\u003c/code\u003e if another poll operation should occur, otherwise, it throws a \u003ccode\u003ePollException\u003c/code\u003e.\u003c/p\u003e\n"],["\u003cp\u003eThe latest version of the documentation is for version 2.63.1, and the page lists versions dating back to version 2.7.1, with all of them implementing this \u003ccode\u003eExponentialPollAlgorithm\u003c/code\u003e class.\u003c/p\u003e\n"]]],[],null,[]]
