Struct ZeroCopyTokenBucket 

pub struct ZeroCopyTokenBucket { /* private fields */ }

Zero-copy token bucket implementation

This implementation optimizes for minimal allocations by:

1. Using borrowed string references for lookups
2. Only allocating when inserting new keys
3. Avoiding intermediate string copies

Note: flurry’s current API requires String keys, so we still need to allocate on first access. However, subsequent accesses to the same key avoid allocation during the lookup phase.

Implementations

impl ZeroCopyTokenBucket

pub fn new(capacity: u64, refill_rate_per_second: u64) -> Self

Creates a new zero-copy token bucket

pub fn with_ttl( capacity: u64, refill_rate_per_second: u64, idle_ttl: Duration, ) -> Self

Creates a token bucket with TTL-based eviction

Trait Implementations

impl Algorithm for ZeroCopyTokenBucket

fn check<'life0, 'life1, 'async_trait>( &'life0 self, key: &'life1 str, ) -> Pin<Box<dyn Future<Output = Result<RateLimitDecision>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Checks if a request for the given key should be permitted.

fn check_with_cost<'life0, 'life1, 'async_trait>( &'life0 self, key: &'life1 str, cost: u64, ) -> Pin<Box<dyn Future<Output = Result<RateLimitDecision>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Checks if a request with the given cost should be permitted.