Enum RateLimitAlgorithm 

pub enum RateLimitAlgorithm {
    TokenBucket,
    SlidingWindow,
    FixedWindow,
    LeakyBucket,
}

Rate limiting algorithm to use.

Variants

TokenBucket

Token bucket algorithm.

Tokens are added at a fixed rate. Each request consumes one token. Allows bursting up to the bucket capacity.

SlidingWindow

Sliding window algorithm.

Counts requests in a sliding time window. Provides smoother rate limiting than fixed windows.

FixedWindow

Fixed window algorithm.

Counts requests in fixed time windows. Simple but can allow bursting at window boundaries.

LeakyBucket

Leaky bucket algorithm.

Requests are processed at a constant rate. Excess requests are queued or rejected.

Trait Implementations

impl Clone for RateLimitAlgorithm

fn clone(&self) -> RateLimitAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RateLimitAlgorithm

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

Formats the value using the given formatter.

impl Default for RateLimitAlgorithm

fn default() -> RateLimitAlgorithm

Returns the “default value” for a type.

impl PartialEq for RateLimitAlgorithm

fn eq(&self, other: &RateLimitAlgorithm) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for RateLimitAlgorithm

impl Eq for RateLimitAlgorithm

impl StructuralPartialEq for RateLimitAlgorithm