pub enum RateLimitBackpressureSchema {
Block,
Drop,
Buffer,
}Expand description
Backpressure strategy for rate limiting.
Variants§
Block
Block until rate allows.
Drop
Drop items that exceed rate.
Buffer
Buffer items and process when rate allows.
Trait Implementations§
Source§impl Clone for RateLimitBackpressureSchema
impl Clone for RateLimitBackpressureSchema
Source§fn clone(&self) -> RateLimitBackpressureSchema
fn clone(&self) -> RateLimitBackpressureSchema
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreimpl Copy for RateLimitBackpressureSchema
Source§impl Debug for RateLimitBackpressureSchema
impl Debug for RateLimitBackpressureSchema
Source§impl Default for RateLimitBackpressureSchema
impl Default for RateLimitBackpressureSchema
Source§fn default() -> RateLimitBackpressureSchema
fn default() -> RateLimitBackpressureSchema
Returns the “default value” for a type. Read more
Source§impl<'de> Deserialize<'de> for RateLimitBackpressureSchema
impl<'de> Deserialize<'de> for RateLimitBackpressureSchema
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
impl Eq for RateLimitBackpressureSchema
Source§impl PartialEq for RateLimitBackpressureSchema
impl PartialEq for RateLimitBackpressureSchema
Source§fn eq(&self, other: &RateLimitBackpressureSchema) -> bool
fn eq(&self, other: &RateLimitBackpressureSchema) -> bool
Tests for
self and other values to be equal, and is used by ==.impl StructuralPartialEq for RateLimitBackpressureSchema
Auto Trait Implementations§
impl Freeze for RateLimitBackpressureSchema
impl RefUnwindSafe for RateLimitBackpressureSchema
impl Send for RateLimitBackpressureSchema
impl Sync for RateLimitBackpressureSchema
impl Unpin for RateLimitBackpressureSchema
impl UnsafeUnpin for RateLimitBackpressureSchema
impl UnwindSafe for RateLimitBackpressureSchema
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,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.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>
impl<T> Scalar for T
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.