Struct RateLimitKey 

pub struct RateLimitKey(/* private fields */);

Opaque per-source bucket key for a RateLimiter.

Wraps a String so the underlying derivation strategy stays a hidden implementation detail of whoever builds the key. AuditEvent::rate_limit_key derives compound client_id_hint ‖ kid_hint keys per Phase 9 design call (e); future callers (Phase 10.11 nonce-store, OAuth callback PKCE throttle, etc) compose their own keys from substrate-relevant fields.

Newtype (rather than passing &str through the limiter trait) lets the type system prove that callers used the correct derivation — stringly-typed keys would silently re-bucket on stray formatting drift (whitespace, casing, separator choice).

Implementations

impl RateLimitKey

pub fn new(key: impl Into<String>) -> RateLimitKey

Construct from any string-like source.

pub fn as_str(&self) -> &str

Borrow the underlying string. Limiter substrates need this to build their backend key (HashMap entry, Redis key, etc).

Trait Implementations

impl Clone for RateLimitKey

fn clone(&self) -> RateLimitKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RateLimitKey

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

Formats the value using the given formatter.

impl Display for RateLimitKey

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

Formats the value using the given formatter.

impl From<&str> for RateLimitKey

fn from(s: &str) -> RateLimitKey

Converts to this type from the input type.

impl From<String> for RateLimitKey

fn from(s: String) -> RateLimitKey

Converts to this type from the input type.

impl Hash for RateLimitKey

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for RateLimitKey

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

impl StructuralPartialEq for RateLimitKey