pub enum RateLimitAlgorithm {
SlidingWindowLog,
TokenBucket,
FixedWindow,
LeakyBucket,
}Expand description
Rate limiting algorithm type.
Variants§
SlidingWindowLog
Sliding window log algorithm (most accurate).
TokenBucket
Token bucket algorithm (allows bursts).
FixedWindow
Fixed window counter (simplest).
LeakyBucket
Leaky bucket algorithm (smooth rate).
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<'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
Source§impl PartialEq for RateLimitAlgorithm
impl PartialEq for RateLimitAlgorithm
Source§impl Serialize for RateLimitAlgorithm
impl Serialize for RateLimitAlgorithm
impl Copy for RateLimitAlgorithm
impl StructuralPartialEq for RateLimitAlgorithm
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> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
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> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Returns the layout of the type.
Source§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
Source§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Returns whether the given value has been niched. Read more
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
Writes data to
out indicating that a T is niched.