Struct ratelimit_meter::algorithms::gcra::NotUntil

pub struct NotUntil<P: Reference>(_);

Returned in case of a negative rate-limiting decision. Indicates the earliest instant that a cell might get accepted again.

To avoid thundering herd effects, client code should always add a random amount of jitter to wait time estimates.

Trait Implementations

impl<P: Reference> NonConformance<P> for NotUntil<P>

fn earliest_possible(&self) -> P

Returns the earliest time at which a decision could be conforming (excluding conforming decisions made by the Decider that are made in the meantime).

fn wait_time_from(&self, from: P) -> Duration

Returns the minimum amount of time from the time that the decision was made (relative to the at argument in a Decider's check_at method) that must pass before a decision can be conforming. Since Durations can not be negative, a zero duration is returned if from is already after that duration.

impl<P: PartialEq + Reference> PartialEq<NotUntil<P>> for NotUntil<P>

fn eq(&self, other: &NotUntil<P>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &NotUntil<P>) -> bool

This method tests for !=.

impl<P: Debug + Reference> Debug for NotUntil<P>

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

Formats the value using the given formatter.

impl<P: Reference> Display for NotUntil<P>

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

Formats the value using the given formatter.