Struct KeyedRatePolicy
pub struct KeyedRatePolicy<X, K> { /* private fields */ }net only.Expand description
A limit Policy that rate limits inputs per key: every key gets
its own token bucket, lazily created on first use and stored in a
bounded, idle-evicting cache.
The typical use is per-client fairness, keying on the client IP with
ClientIpRateKey; any
InputToRateKey extractor (including plain closures) works.
Modes mirror RatePolicy:
KeyedRatePolicy::abort rejects over-budget inputs with
RateLimitReached (a 429 path), KeyedRatePolicy::wait paces them.
Inputs without a derivable key are allowed through by default; use
KeyedRatePolicy::set_missing_key_allowed to abort them with
MissingRateKey instead.
Memory is bounded: at most KeyedRatePolicy::set_max_keys buckets
are kept, and buckets idle longer than
KeyedRatePolicy::set_idle_timeout are evicted. The idle timeout is
clamped to the time required to refill the configured burst from
empty, so an evicted-then-recreated bucket (which starts full) cannot
regain budget earlier than one that remained cached.
Implementations§
§impl<X, K> KeyedRatePolicy<X, K>where
K: RateKey,
impl<X, K> KeyedRatePolicy<X, K>where
K: RateKey,
pub fn wait(extractor: X, rate: Rate) -> KeyedRatePolicy<X, K>
pub fn wait(extractor: X, rate: Rate) -> KeyedRatePolicy<X, K>
Create a new KeyedRatePolicy that paces inputs beyond the
given per-key Rate: they wait, they never fail.
pub fn abort(extractor: X, rate: Rate) -> KeyedRatePolicy<X, K>
pub fn abort(extractor: X, rate: Rate) -> KeyedRatePolicy<X, K>
Create a new KeyedRatePolicy that aborts inputs beyond the
given per-key Rate with RateLimitReached.
pub fn with_burst(self, burst: u64) -> KeyedRatePolicy<X, K>
pub fn with_burst(self, burst: u64) -> KeyedRatePolicy<X, K>
Override the per-key burst capacity (default: one period worth of units).
§Panics
Panics if burst is zero.
pub fn set_burst(&mut self, burst: u64) -> &mut KeyedRatePolicy<X, K>
pub fn set_burst(&mut self, burst: u64) -> &mut KeyedRatePolicy<X, K>
Override the per-key burst capacity (default: one period worth of units).
§Panics
Panics if burst is zero.
pub fn with_missing_key_allowed(self, allowed: bool) -> KeyedRatePolicy<X, K>
pub fn with_missing_key_allowed(self, allowed: bool) -> KeyedRatePolicy<X, K>
Allow (default) or abort — with MissingRateKey — inputs
for which no key can be derived.
pub fn set_missing_key_allowed(
&mut self,
allowed: bool,
) -> &mut KeyedRatePolicy<X, K>
pub fn set_missing_key_allowed( &mut self, allowed: bool, ) -> &mut KeyedRatePolicy<X, K>
Allow (default) or abort — with MissingRateKey — inputs
for which no key can be derived.
pub fn with_max_keys(self, max_keys: u64) -> KeyedRatePolicy<X, K>
pub fn with_max_keys(self, max_keys: u64) -> KeyedRatePolicy<X, K>
Bound the number of tracked keys (default: 65 536); least recently used buckets are evicted beyond it.
§Panics
Panics if max_keys is zero.
pub fn set_max_keys(&mut self, max_keys: u64) -> &mut KeyedRatePolicy<X, K>
pub fn set_max_keys(&mut self, max_keys: u64) -> &mut KeyedRatePolicy<X, K>
Bound the number of tracked keys (default: 65 536); least recently used buckets are evicted beyond it.
§Panics
Panics if max_keys is zero.
pub fn with_idle_timeout(self, idle_timeout: Duration) -> KeyedRatePolicy<X, K>
pub fn with_idle_timeout(self, idle_timeout: Duration) -> KeyedRatePolicy<X, K>
Evict buckets idle for this long (default: 1 minute), clamped to at least the time required to refill the burst from empty.
pub fn set_idle_timeout(
&mut self,
idle_timeout: Duration,
) -> &mut KeyedRatePolicy<X, K>
pub fn set_idle_timeout( &mut self, idle_timeout: Duration, ) -> &mut KeyedRatePolicy<X, K>
Evict buckets idle for this long (default: 1 minute), clamped to at least the time required to refill the burst from empty.
Trait Implementations§
§impl<X, K> Debug for KeyedRatePolicy<X, K>where
X: Debug,
impl<X, K> Debug for KeyedRatePolicy<X, K>where
X: Debug,
§impl<X, K, Input> Policy<Input> for KeyedRatePolicy<X, K>
impl<X, K, Input> Policy<Input> for KeyedRatePolicy<X, K>
§type Error = Box<dyn Error + Sync + Send>
type Error = Box<dyn Error + Sync + Send>
§async fn check(
&self,
input: Input,
) -> PolicyResult<Input, <KeyedRatePolicy<X, K> as Policy<Input>>::Guard, <KeyedRatePolicy<X, K> as Policy<Input>>::Error>
async fn check( &self, input: Input, ) -> PolicyResult<Input, <KeyedRatePolicy<X, K> as Policy<Input>>::Guard, <KeyedRatePolicy<X, K> as Policy<Input>>::Error>
Auto Trait Implementations§
impl<X, K> !RefUnwindSafe for KeyedRatePolicy<X, K>
impl<X, K> !UnwindSafe for KeyedRatePolicy<X, K>
impl<X, K> Freeze for KeyedRatePolicy<X, K>where
X: Freeze,
impl<X, K> Send for KeyedRatePolicy<X, K>
impl<X, K> Sync for KeyedRatePolicy<X, K>
impl<X, K> Unpin for KeyedRatePolicy<X, K>where
X: Unpin,
impl<X, K> UnsafeUnpin for KeyedRatePolicy<X, K>where
X: UnsafeUnpin,
Blanket Implementations§
§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
§impl<T> Conv for T
impl<T> Conv for T
impl<T> ErasedDestructor for Twhere
T: 'static,
§impl<T> FutureExt for T
impl<T> FutureExt for T
§fn with_context(self, otel_cx: Context) -> WithContext<Self> ⓘ
fn with_context(self, otel_cx: Context) -> WithContext<Self> ⓘ
§fn with_current_context(self) -> WithContext<Self> ⓘ
fn with_current_context(self) -> WithContext<Self> ⓘ
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§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> ⓘ
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> ⓘ
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 more§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
T in a rama_grpc::Request§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
self, then passes self.as_ref() into the pipe function.§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
self, then passes self.as_mut() into the pipe
function.§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
self, then passes self.deref() into the pipe function.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
§fn and<P, B, E>(self, other: P) -> And<T, P>
fn and<P, B, E>(self, other: P) -> And<T, P>
Policy that returns Action::Follow only if self and other return
Action::Follow. Read more§impl<T, U> RamaTryFrom<T> for Uwhere
U: TryFrom<T>,
impl<T, U> RamaTryFrom<T> for Uwhere
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
fn rama_try_from(value: T) -> Result<U, <U as RamaTryFrom<T>>::Error>
§impl<T, U, CrateMarker> RamaTryInto<U, CrateMarker> for Twhere
U: RamaTryFrom<T, CrateMarker>,
impl<T, U, CrateMarker> RamaTryInto<U, CrateMarker> for Twhere
U: RamaTryFrom<T, CrateMarker>,
type Error = <U as RamaTryFrom<T, CrateMarker>>::Error
fn rama_try_into(self) -> Result<U, <U as RamaTryFrom<T, CrateMarker>>::Error>
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Borrow<B> of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
BorrowMut<B> of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
AsRef<R> view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
AsMut<R> view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Deref::Target of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Deref::Target of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap() only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut() only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
.tap_borrow() only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
.tap_borrow_mut() only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
.tap_ref() only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
.tap_ref_mut() only in debug builds, and is erased in release
builds.§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
.tap_deref() only in debug builds, and is erased in release
builds.