Struct SlidingWindow 

pub struct SlidingWindow;

Sliding Window rate limiting algorithm.

Uses weighted combination of current and previous windows to eliminate the boundary burst problem.

Implementations

impl SlidingWindow

pub fn new() -> Self

Create a new Sliding Window algorithm instance.

Trait Implementations

impl Algorithm for SlidingWindow

fn name(&self) -> &'static str

Get the algorithm name (for logging/metrics).

async fn check_and_record<S: Storage>( &self, storage: &S, key: &str, quota: &Quota, ) -> Result<Decision>

Check if a request is allowed AND record it atomically.

async fn check<S: Storage>( &self, storage: &S, key: &str, quota: &Quota, ) -> Result<Decision>

Check without recording (peek at current state).

fn reset<S: Storage>( &self, storage: &S, key: &str, ) -> impl Future<Output = Result<()>> + Send

Reset the rate limit for a key.

impl Clone for SlidingWindow

fn clone(&self) -> SlidingWindow

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for SlidingWindow

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

Formats the value using the given formatter.

impl Default for SlidingWindow

fn default() -> SlidingWindow

Returns the “default value” for a type.