Struct KeyedRateLimiter 

pub struct KeyedRateLimiter<K> { /* private fields */ }

Per-key rate limiter using a sliding window algorithm.

Each key (e.g., trading pair) has its own rate limit tracking. Useful for endpoints like order book that have per-pair limits.

Implementations

impl<K> KeyedRateLimiter<K>

where K: Hash + Eq + Clone,

pub fn new(window: Duration, max_requests: u32) -> Self

Create a new per-key rate limiter.

Arguments

• window - The sliding window duration
• max_requests - Maximum number of requests allowed per window

pub fn try_acquire(&mut self, key: K) -> Result<(), Duration>

Try to acquire a permit for the given key.

Returns Ok(()) if the request is allowed, or Err(wait_time) if the rate limit has been exceeded and you need to wait.

pub fn would_allow(&self, key: &K) -> bool

Check if a request for the given key would be allowed without consuming a permit.

pub fn remaining(&self, key: &K) -> u32

Get the remaining permits for a key.

pub fn time_until_available(&self, key: &K) -> Option<Duration>

Get the time until the next permit is available for a key.

pub fn remove(&mut self, key: &K)

Remove all rate limit tracking for a specific key.

pub fn cleanup(&mut self)

Clean up limiters that haven’t been used recently.

Removes limiters where all requests have expired from the window.

pub fn tracked_keys(&self) -> usize

Get the number of keys being tracked.

pub fn clear(&mut self)

Clear all rate limit tracking.

Trait Implementations

impl<K: Debug> Debug for KeyedRateLimiter<K>

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

Formats the value using the given formatter.

impl<K> Default for KeyedRateLimiter<K>

where K: Hash + Eq + Clone,

fn default() -> Self

Returns the “default value” for a type.