Memory is bounded two ways: a key's timestamps older than the window are dropped whenever the key is
touched, and when the number of keys exceeds MaxKeys the least-recently-inserted keys are evicted
(an evicted key simply starts a fresh window — the limiter fails open by forgetting, never closed).
Counts events per key over a sliding window.
Memory is bounded two ways: a key's timestamps older than the window are dropped whenever the key is touched, and when the number of keys exceeds
MaxKeysthe least-recently-inserted keys are evicted (an evicted key simply starts a fresh window — the limiter fails open by forgetting, never closed).