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 the \u003ccode\u003eExponentialRetryAlgorithm\u003c/code\u003e class.\u003c/p\u003e\n"],["\u003cp\u003eThe primary function of \u003ccode\u003eExponentialPollAlgorithm\u003c/code\u003e is to determine if another poll operation should be attempted, or throw a \u003ccode\u003ePollException\u003c/code\u003e if the total timeout or total number of attempts is reached.\u003c/p\u003e\n"],["\u003cp\u003eThe page includes documentation for the class constructor, \u003ccode\u003eExponentialPollAlgorithm(RetrySettings globalSettings, ApiClock clock)\u003c/code\u003e, which requires global retry settings and a clock for time calculations.\u003c/p\u003e\n"],["\u003cp\u003eThe page contains a list of available versions for ExponentialPollAlgorithm, with the latest being 2.63.1.\u003c/p\u003e\n"]]],[],null,[]]
