Struct RateLimitKey 

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

A rate-limit dimension key supplied by the host (RFC-008 §4).

The key should be derived from a trustworthy, non-spoofable signal. It must never be the raw plaintext code or a user-display identifier. The recommended shape is HMAC(purpose || 0x00 || ip_or_scope) or a stable fingerprint that the host can compute without codlet.

Implementations

impl RateLimitKey

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

Wrap a pre-computed key string.

pub fn as_str(&self) -> &str

Borrow the key string.

pub fn fingerprint(&self) -> &str

A privacy-safe fingerprint of the key, safe to include in audit events and metrics labels (RFC-012 §10.3). Currently the first 8 characters of the key; adapters may override with a hashed prefix.

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

Formats the value using the given formatter.

impl Eq for RateLimitKey

impl Hash for RateLimitKey

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

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 StructuralPartialEq for RateLimitKey