你正在阅读 Celery 3.1 的文档。开发版本文档见: 此处.
Utilities for functions.
LRU Cache implementation using a doubly linked list to track access.
参数: | limit – The maximum number of keys to keep in the cache. When a new key is inserted and the limit has been exceeded, the Least Recently Used key will be discarded from the cache. |
---|
Return true if the object is iterable (but not if object is a mapping or string).
Return list of one element if l is a scalar.
Memoized lazy evaluation.
The function is only evaluated once, every subsequent access will return the same value.
Set to to True after the object has been evaluated.
No operation.
Takes any arguments/keyword arguments and does nothing.
Return the first element in iterable that predicate Gives a True value for.
If predicate is None it will return the first item that is not None.
Return a function that with a list of instances, finds the first instance that gives a value for the given method.
The list can also contain lazy instances (lazy.)
Split an iterator into chunks with n elements each.
Examples
# n == 2 >>> x = chunks(iter([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]), 2) >>> list(x) [[0, 1], [2, 3], [4, 5], [6, 7], [8, 9], [10]]
# n == 3 >>> x = chunks(iter([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]), 3) >>> list(x) [[0, 1, 2], [3, 4, 5], [6, 7, 8], [9, 10]]
Pad list with default elements.
Examples:
>>> first, last, city = padlist(['George', 'Costanza', 'NYC'], 3)
('George', 'Costanza', 'NYC')
>>> first, last, city = padlist(['George', 'Costanza'], 3)
('George', 'Costanza', None)
>>> first, last, city, planet = padlist(
... ['George', 'Costanza', 'NYC'], 4, default='Earth',
... )
('George', 'Costanza', 'NYC', 'Earth')
Like operator.itemgetter() but return None on missing attributes instead of raising AttributeError.
Regen takes any iterable, and if the object is an generator it will cache the evaluated list on first access, so that the generator can be “consumed” multiple times.
Remove all keys from dict d whose value is None
Holds lazy evaluation.
Evaluated when called or if the evaluate() method is called. The function is re-evaluated on every call.