Enum RateLimitOutcome 

pub enum RateLimitOutcome {
    NotLimited,
    Allowed {
        limit: u32,
        remaining: u32,
        reset_epoch_s: u64,
    },
    Denied {
        limit: u32,
        remaining: u32,
        reset_epoch_s: u64,
        retry_after_s: u32,
    },
}

What the engine decided for one request (DW-017).

Variants

NotLimited

No rule applied to the request: no limiting, and responses carry no rate headers.

Allowed

Admitted; limit/remaining/reset_epoch_s describe the binding constraint (the window with the least remaining budget).

Fields

limit: u32

remaining: u32

reset_epoch_s: u64

Denied

Denied: emit 429 with Retry-After = retry_after_s (ceil, min 1) and the binding (first-denying) rule’s rate headers. When several rules deny, retry_after_s is the MAX wait across them (see RateLimitEngine::check); headers still show the first binding rule — Limit/Remaining report the tightest constraint in resolution order, Retry-After the longest wait.

Fields

limit: u32

remaining: u32

reset_epoch_s: u64

retry_after_s: u32

Trait Implementations

impl Clone for RateLimitOutcome

fn clone(&self) -> RateLimitOutcome

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RateLimitOutcome

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

Formats the value using the given formatter.

impl PartialEq for RateLimitOutcome

fn eq(&self, other: &RateLimitOutcome) -> 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 Copy for RateLimitOutcome

impl Eq for RateLimitOutcome

impl StructuralPartialEq for RateLimitOutcome