Struct RateLimitRule 

pub struct RateLimitRule {
    pub name: Option<String>,
    pub selector: Vec<RateLimitSelector>,
    pub requests_per: RateRequestsPer,
    pub burst: Option<u32>,
}

One rate-limit rule (DW-017): a key selector plus one or more stacked windows. selector names the request attributes that form the counter key (all listed attributes are joined into ONE key, so [ip, route] limits each (client IP, route) pair independently); requests_per carries the sustained rates per window (at least one window must be present); burst is the bucket size (defaults to the window’s request count).

Fields

name: Option<String>

Optional label (documentation only; not part of the key).

selector: Vec<RateLimitSelector>

Key components: ip, credential, and/or route (at least one; order does not matter). credential falls back to the client IP until authentication (DW-019) identifies consumers.

requests_per: RateRequestsPer

burst: Option<u32>

Bucket size (burst capacity); must be >= 1 when present. Defaults to the window’s request count.

Trait Implementations

impl Clone for RateLimitRule

fn clone(&self) -> RateLimitRule

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RateLimitRule

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for RateLimitRule

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl JsonSchema for RateLimitRule

fn schema_name() -> Cow<'static, str>

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(generator: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn inline_schema() -> bool

Whether JSON Schemas generated for this type should be included directly in parent schemas, rather than being re-used where possible using the $ref keyword.

impl PartialEq for RateLimitRule

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for RateLimitRule

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for RateLimitRule