Struct RateLimiter 

pub struct RateLimiter { /* private fields */ }

Per-IP rate limiter using a sliding window.

Each IP address gets a bucket of timestamps. When a request arrives, expired entries (older than window) are pruned, and the remaining count is checked against max_requests. If the limit is exceeded, check() returns Err with the number of seconds the caller should wait before retrying.

Implementations

impl RateLimiter

pub fn new(max_requests: u32, window_secs: u64) -> Self

Create a new rate limiter.

• max_requests: maximum number of requests allowed within the window.
• window_secs: sliding window duration in seconds.

pub fn check(&self, ip: &str) -> Result<(), u64>

Check if a request from this IP is allowed.

Returns Ok(()) if the request is within limits, or Err(retry_after) with the number of seconds to wait before the next request will be accepted.

pub fn cleanup(&self)

Remove all expired entries from every bucket.

Call periodically (e.g., from a background thread) to prevent unbounded memory growth from IPs that stop sending requests.

pub fn current_count(&self, ip: &str) -> u32

Get the current request count for an IP within the active window.