Struct PollSchedule 

pub struct PollSchedule { /* private fields */ }

The bounded, budget-aware poll interval.

The floor is a rate-budget constraint, not a preference

RefreshInterval refuses anything under 30 seconds at construction, and every delay this type produces is at least that — including the ones it computes from a remote header. A rate limit may only ever make this loop slower.

retry_delay is an absolute floor, not an addend

c3 documents RefreshState::retry_delay as “the earliest time a retry may occur”: the scheduling rule is next_attempt_at = now + retry_delay, and not the ordinary interval plus it. Adding the two compounds on every successive retry — each new answer carries the remaining window, so an addend ratchets outward — and the symptom is a dashboard that stays dark long after GitHub said it could come back, which reads as a hang rather than as a rate limit. So the two are combined with max, which is what makes the floor a floor.

Implementations

impl PollSchedule

pub const fn new(interval: RefreshInterval) -> Self

pub const fn interval(&self) -> RefreshInterval

pub const fn nominal(&self) -> Duration

The nominal interval as a Duration.

pub const fn consecutive_offline(&self) -> u32

The unbroken run of offline polls this schedule has seen.

pub fn offline_for(&self, now: Timestamp) -> Option<Duration>

How long GitHub has been unreachable, or None when it is not.

Measured from the first poll of the current run rather than inferred from Self::consecutive_offline times the interval. The two diverge as soon as the back-off starts doubling, and this is the number the 24-hour queue-cancellation warning is compared against — an estimate would make that warning fire early or late, and it is the one thing the offline state exists to say.

pub const fn floor() -> Duration

The hard floor no computed delay may go below.

pub fn next_poll( &mut self, failure: Option<&RefreshState>, now: Timestamp, jitter: &dyn Jitter, ) -> NextPoll

Decide when to poll next, given how this pass ended.

failure is the most severe failure across the targets polled this pass, or None when every target answered. A pass that answered resets the offline run, which is the whole of “recovery needs no bookkeeping”: demand is recomputed from the current queued-run set on every poll, so there is nothing else to unwind.

Trait Implementations

impl Clone for PollSchedule

fn clone(&self) -> PollSchedule

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PollSchedule

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.