ó O'—^c@@sIdZddlmZddlmZdgZdefd„ƒYZdS(sX kombu.utils.limits ================== Token bucket implementation for rate limiting. i(tabsolute_import(t monotonict TokenBucketcB@sMeZdZdZdZdZdd„Zdd„Zdd„Z d„Z RS(s—Token Bucket Algorithm. See http://en.wikipedia.org/wiki/Token_Bucket Most of this code was stolen from an entry in the ASPN Python Cookbook: http://code.activestate.com/recipes/511490/ .. admonition:: Thread safety This implementation is not thread safe. Access to a `TokenBucket` instance should occur within the critical section of any multithreaded code. icC@s7t|ƒ|_||_t|ƒ|_tƒ|_dS(N(tfloattcapacityt_tokenst fill_rateRt timestamp(tselfRR((s4/tmp/pip-unpacked-wheel-UAnTfW/kombu/utils/limits.pyt__init__'s cC@s)||jƒkr%|j|8_tStS(sLReturn :const:`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.(t _get_tokensRtTruetFalse(Rttokens((s4/tmp/pip-unpacked-wheel-UAnTfW/kombu/utils/limits.pyt can_consume-scC@s*|jƒ}t||ƒ}|||jS(s„Return the time (in seconds) when a new token is expected to be available. This will not consume any tokens from the bucket.(R tmaxR(RR R((s4/tmp/pip-unpacked-wheel-UAnTfW/kombu/utils/limits.pyt expected_time8s cC@s^|j|jkrWtƒ}|j||j}t|j|j|ƒ|_||_n|jS(N(RRRRRtmin(Rtnowtdelta((s4/tmp/pip-unpacked-wheel-UAnTfW/kombu/utils/limits.pyR ?s   N( t__name__t __module__t__doc__tNoneRRRR RRR (((s4/tmp/pip-unpacked-wheel-UAnTfW/kombu/utils/limits.pyRs   N(Rt __future__Rt kombu.fiveRt__all__tobjectR(((s4/tmp/pip-unpacked-wheel-UAnTfW/kombu/utils/limits.pyts