U d @s2dZddlmZddlmZdZGdddZdS)z.Token bucket implementation for rate limiting.)deque) monotonic) TokenBucketc@sZeZdZdZdZdZdZdddZddZdd Z d d Z dd d Z dddZ ddZ dS)raToken Bucket Algorithm. See Also: https://en.wikipedia.org/wiki/Token_Bucket Most of this code was stolen from an entry in the ASPN Python Cookbook: https://code.activestate.com/recipes/511490/ Warning: Thread Safety: This implementation is not thread safe. Access to a `TokenBucket` instance should occur within the critical section of any multithreaded code. NcCs.t||_||_t||_t|_t|_dSN)floatcapacity_tokens fill_rater timestamprcontents)selfr rr6/tmp/pip-unpacked-wheel-hqfrjlvz/kombu/utils/limits.py__init__!s   zTokenBucket.__init__cCs|j|dSr)r append)r itemrrradd(szTokenBucket.addcCs |jSr)r popleftr rrrpop+szTokenBucket.popcCs|jdSr)r clearrrrr clear_pending.szTokenBucket.clear_pendingcCs"||kr|j|8_dSdS)aCheck if one or more tokens can be consumed. Returns: bool: true if the number of tokens can be consumed from the bucket. If they can be consumed, a call will also consume the requested number of tokens from the bucket. Calls will only consume `tokens` (the number requested) or zero tokens -- it will never consume a partial number of tokens. TF) _get_tokensr )r tokensrrr can_consume1s zTokenBucket.can_consumecCs |}t||}|||jS)zoReturn estimated time of token availability. Returns: float: the time in seconds. )rmaxr )r rr rrr expected_timeAs zTokenBucket.expected_timecCsB|j|jkrs