Struct RateLimitHoop 

pub struct RateLimitHoop { /* private fields */ }

Per-IP rate limiting middleware using a token bucket algorithm.

Each client IP gets a bucket that starts at burst tokens and is replenished at a rate of max_tokens / window per second, capped at burst. If a request arrives and the bucket is empty, a 429 Too Many Requests response is returned.

burst defaults to max_tokens when not specified, which matches the previous behaviour.

Implementations

impl RateLimitHoop

pub fn new(window: Duration, max_requests: u64, burst: Option<u64>) -> Self

Create a new rate limiter.

• window — the time window over which max_requests applies.
• max_requests — steady-state refill rate (tokens per window).
• burst — maximum token bucket capacity; None defaults to max_requests (pre-existing behaviour).

Trait Implementations

impl Handler for RateLimitHoop

fn handle<'life0, 'life1, 'life2, 'life3, 'life4, 'async_trait>( &'life0 self, req: &'life1 mut Request, depot: &'life2 mut Depot, res: &'life3 mut Response, ctrl: &'life4 mut FlowCtrl, ) -> Pin<Box<dyn Future<Output = ()> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, 'life3: 'async_trait, 'life4: 'async_trait,

Handle http request.

fn arc(self) -> ArcHandler

where Self: Sized,

Wrap to ArcHandler.

fn hooped<H>(self) -> HoopedHandler

where H: Handler, Self: Sized,

Wrap to HoopedHandler.

fn hoop<H>(self, hoop: H) -> HoopedHandler

where H: Handler, Self: Sized,

Hoop this handler with middleware.

fn hoop_when<H, F>(self, hoop: H, filter: F) -> HoopedHandler

where Self: Sized, H: Handler, F: Fn(&Request, &Depot) -> bool + Send + Sync + 'static,

Hoop this handler with middleware.