Operation timed polling algorithm, which uses exponential backoff factor for determining when the
next polling operation should be executed. If the polling exceeds the total timeout this
algorithm cancels polling.
[[["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\u003eOperationTimedPollAlgorithm\u003c/code\u003e class, extending \u003ccode\u003eExponentialRetryAlgorithm\u003c/code\u003e, used for polling operations with exponential backoff.\u003c/p\u003e\n"],["\u003cp\u003eThe class is designed to manage the timing of polling operations, ensuring that if a total timeout is reached, the polling process will be canceled.\u003c/p\u003e\n"],["\u003cp\u003eThe latest version available is 2.63.1, and the content provided includes documentation links for several past versions, all the way down to 2.7.1.\u003c/p\u003e\n"],["\u003cp\u003e\u003ccode\u003eOperationTimedPollAlgorithm\u003c/code\u003e includes static methods to create the algorithm, offering options to specify \u003ccode\u003eRetrySettings\u003c/code\u003e and \u003ccode\u003eApiClock\u003c/code\u003e parameters.\u003c/p\u003e\n"],["\u003cp\u003eThis class overrides methods such as \u003ccode\u003eshouldRPCTerminate\u003c/code\u003e and \u003ccode\u003eshouldRetry\u003c/code\u003e, and can throw a \u003ccode\u003eCancellationException\u003c/code\u003e when no more attempts are to be made.\u003c/p\u003e\n"]]],[],null,[]]
