Struct ratelimit_meter::algorithms::leaky_bucket::TooEarly

pub struct TooEarly<P: Reference>(_, _);

Returned in case of a negative rate-limiting decision.

To avoid the thundering herd effect, client code should always add some jitter to the wait time.

Trait Implementations

impl<P: Reference> NonConformance<P> for TooEarly<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<TooEarly<P>> for TooEarly<P>

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

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

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

This method tests for !=.

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

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

Formats the value using the given formatter.

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

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

Formats the value using the given formatter.