pub enum RateLimitAlgorithm {
TokenBucket {
capacity: u64,
refill_rate: u64,
},
SlidingWindow {
window_size: Duration,
max_requests: u64,
},
LeakyBucket {
capacity: u64,
leak_rate: u64,
},
FixedWindow {
window_size: Duration,
max_requests: u64,
},
Adaptive {
base_limit: u64,
adjustment_factor: f64,
},
}Expand description
Rate limiting algorithm
Variants§
TokenBucket
Token bucket algorithm
- capacity: Maximum number of tokens
- refill_rate: Tokens added per second
SlidingWindow
Sliding window counter algorithm
- window_size: Duration of the sliding window
- max_requests: Maximum requests in the window
LeakyBucket
Leaky bucket algorithm
- capacity: Maximum bucket capacity
- leak_rate: Rate at which bucket empties (per second)
FixedWindow
Fixed window counter algorithm
- window_size: Fixed window duration
- max_requests: Maximum requests per window
Adaptive
Adaptive rate limiting
- base_limit: Base rate limit
- adjustment_factor: How much to adjust based on load
Trait Implementations§
Source§impl Clone for RateLimitAlgorithm
impl Clone for RateLimitAlgorithm
Source§fn clone(&self) -> RateLimitAlgorithm
fn clone(&self) -> RateLimitAlgorithm
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for RateLimitAlgorithm
impl Debug for RateLimitAlgorithm
Source§impl Default for RateLimitAlgorithm
impl Default for RateLimitAlgorithm
Source§impl<'de> Deserialize<'de> for RateLimitAlgorithm
impl<'de> Deserialize<'de> for RateLimitAlgorithm
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations§
impl Freeze for RateLimitAlgorithm
impl RefUnwindSafe for RateLimitAlgorithm
impl Send for RateLimitAlgorithm
impl Sync for RateLimitAlgorithm
impl Unpin for RateLimitAlgorithm
impl UnsafeUnpin for RateLimitAlgorithm
impl UnwindSafe for RateLimitAlgorithm
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.