This document describes an older version of Celery (2.1). For the latest stable version please go here.
Dict subclass with attribute access.
Exception wrapping an exception and its traceback.
Parameters: | exc_info – The exception tuple info as returned by traceback.format_exception(). |
---|
The original exception.
Kind-of Set with limitations.
Good for when you need to test for membership (a in set), but the list might become to big, so you want to limit it so it doesn’t consume too much resources.
Parameters: |
|
---|
Add a new member.
Remove all members
Get the oldest member.
Remove membership by finding value.
Dictionary with a finite number of keys.
Older items expires first.
A positional queue of a specific length, with slots that are either filled or unfilled. When all of the positions are filled, the queue is considered full().
Parameters: | length – see length. |
---|
The number of items required for the queue to be considered full.
Describes an unfilled slot.
Returns the filled slots as a list.
Returns True if all of the slots has been filled.
Thread-safe counter.
Please note that the final value is not synchronized, this means that you should not update the value by using a previous value, the only reliable operations are increment and decrement.
Example
>>> max_clients = SharedCounter(initial_value=10)# Thread one >>> max_clients += 1 # OK (safe)
# Thread two >>> max_clients -= 3 # OK (safe)
# Main thread >>> if client >= int(max_clients): # Max clients now at 8 ... wait()
>>> max_client = max_clients + 10 # NOT OK (unsafe)
Decrement value.
Increment value.
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/
Parameters: |
---|
The rate in tokens/second that the bucket will be refilled.
Maximum number of tokens in the bucket. Default is 1.
Timestamp of the last time a token was taken out of the bucket.
Returns the expected time in seconds when a new token should be available. Note: consumes a token from the bucket
Iterator yielding all immediately available items in a Queue.Queue.
The iterator stops as soon as the queue raises Queue.Empty.
Example
>>> q = Queue()
>>> map(q.put, range(4))
>>> list(consume_queue(q))
[0, 1, 2, 3]
>>> list(consume_queue(q))
[]