Struct RateLimitKey 

pub struct RateLimitKey {
    pub path: Path,
    pub category: Option<Category>,
}

Identifies one of Bybit’s independent per-UID rate-limit buckets.

Bybit tracks limits per UID per endpoint (https://bybit-exchange.github.io/docs/v5/rate-limit: “Each endpoint has its own independent limit”), and for the order endpoints (create / amend / cancel / cancel-all, single and batch) the limit additionally varies by category. category: None means the endpoint has one limit regardless of category.

Fields

path: Path

Endpoint.

category: Option<Category>

Category, for endpoints whose limit depends on it.

Implementations

impl RateLimitKey

pub const fn new(path: Path) -> Self

Key of a category-independent endpoint.

pub const fn with_category(path: Path, category: Category) -> Self

Key of an endpoint whose limit depends on the category.

Trait Implementations

impl Clone for RateLimitKey

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for RateLimitKey

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: &Self) -> bool

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for RateLimitKey