Enum DistributedAlgorithm 

pub enum DistributedAlgorithm {
    TokenBucket,
    SlidingWindow,
}

The rate-limiting algorithm a backend must apply for a key.

This mirrors the algorithm selection in RateLimitConfig but is expressed as an explicit, Copy value so backends do not need to depend on the full configuration struct when performing atomic arithmetic.

Variants

TokenBucket

Token bucket: tokens refill continuously at rate up to burst.

SlidingWindow

Sliding window: at most rate * window events within window seconds.

Trait Implementations

impl Clone for DistributedAlgorithm

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for DistributedAlgorithm

impl Debug for DistributedAlgorithm

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

Formats the value using the given formatter.

impl Eq for DistributedAlgorithm

impl PartialEq for DistributedAlgorithm

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for DistributedAlgorithm