Struct ApproximateSlidingWindow 

pub struct ApproximateSlidingWindow<P: Precision, T: TimeSource> { /* private fields */ }

Approximate sliding window rate limiter with integrated time source and precision handling.

The approximate sliding window algorithm provides a memory-efficient approximation of sliding window behavior. It uses less memory than the precise sliding window counter while still providing reasonable sliding window characteristics.

Type Parameters

• P - The precision type that determines how Duration values are converted to internal ticks
• T - The time source type that provides elapsed time since the rate limiter’s reference point

Trait Implementations

impl<P: Precision, T> Debug for ApproximateSlidingWindow<P, T>

where T: Debug + TimeSource,

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

Formats the value using the given formatter.

impl<P: Precision, T: TimeSource> RateLimit for ApproximateSlidingWindow<P, T>

fn try_acquire(&self, tokens: Uint) -> SimpleRateLimitResult

Attempts to acquire the specified number of tokens.

fn try_acquire_verbose(&self, tokens: Uint) -> RateLimitResult

Attempts to acquire tokens with detailed diagnostic information.

fn capacity_remaining(&self) -> Result<Uint, SimpleRateLimitError>

Returns the number of tokens currently available for acquisition.