๓ P'—^c@@sฮdZddlmZddlZddlZddlmZddlmZddl m Z ddl m Z m Z mZmZddlmZdd lmZmZmZmZmZd d d d ddddddddddddgZeedƒZeƒZdefd„ƒYZd efd„ƒYZdded„Z de fd„ƒYZ!d „Z"d!„Z#d"„Z$d#„Z%dd$„Z&d%„Z'd&„Z(d'„Z)d(ee*fd)„ƒYZ+dd*„Z,dS(+sX celery.utils.functional ~~~~~~~~~~~~~~~~~~~~~~~ Utilities for functions. i(tabsolute_importN(twraps(tislice(tcached_property(tlazytmaybe_evaluatetis_listt maybe_list(t OrderedDict(tUserDicttUserListtitemstkeystrangetLRUCacheRRtmemoizetmlazytnooptfirstt firstmethodtchunkstpadlistt mattrgettertuniqtregent dictfilterRRtpypy_version_infot DummyContextcB@seZd„Zd„ZRS(cC@s|S(N((tself((s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyt __enter__"scG@sdS(N((Rtexc_info((s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyt__exit__%s(t__name__t __module__RR(((s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyR s cB@sแeZdZdd„Zd„Zd„Zeed„Z d„Z d„Z ed„Z e Z ed„ZeZd „ZeZd d „Zd „Zd „ZejddkrฤeZeZe Znd„Zd„Zd„ZRS(s$LRU Cache implementation using a doubly linked list to track access. :keyword 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. cC@s(||_tjƒ|_tƒ|_dS(N(tlimitt threadingtRLocktmutexRtdata(RR"((s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyt__init__3s cC@s.|j|jj|ƒ}||(R((s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyR …scC@st|jƒƒS(N(RKR=(R((s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pytvaluesˆscC@st|jƒƒS(N(RKR<(R((s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyR ‹sN(R R!t__doc__tNoneR'R+R-tTruetIS_PYPYR/R7R8R<t iteritemsR=t itervaluesR>titerkeysRCRGRJtsyst version_infoR RLR (((s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyR)s.              c@s‡‡‡fd†}|S(Nc@sztjƒ‰ˆdˆƒ‰tˆƒ‡‡‡‡‡fd†ƒ‰‡‡fd†}dˆ_ˆ_|ˆ_ˆˆ_ˆS(NR"c@sฒˆrˆ||ƒ}n#|tftt|jƒƒƒ}yˆˆ|}WdQXWnFtk ržˆ||Ž}ˆjd7_ˆ|ˆ|ฺsN(R5RN(Rktit((Rks9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyRาsc@s‡fd†}|S(sื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 (:class:`~kombu.utils.functional.lazy`.) c@s[xT|D]L}y"tt|ƒˆƒ||Ž}Wntk rBqX|dk r|SqWdS(N(tgetattrRtAttributeErrorRN(RlR1R2tobjtanswer(tmethod(s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyt_matcher่s "  ((RqRr((Rqs9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyR฿s  cc@s4x-|D]%}|gtt||dƒƒVqWdS(s‡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]] iN(RKR(RltnR((s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyR๕s cC@s#t|ƒ| |g|t|ƒS(sพ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') (RKR.(t containertsizetdefault((s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyR sc@s ‡fd†S(s}Like :func:`operator.itemgetter` but return :const:`None` on missing attributes instead of raising :exc:`AttributeError`.c@st‡fd†ˆDƒƒS(Nc3@s'|]}|tˆ|dƒfVqdS(N(RmRN(Ritattr(Ro(s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pys s(RD(Ro(tattrs(Ros9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyts((Rx((Rxs9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyRsc@stƒ‰‡fd†|DƒS(s7Return all unique elements in ``it``, preserving order.c3@s0|]&}|ˆkrˆj|ƒp'|VqdS(N(tadd(RiRo(tseen(s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pys &s(tset(Rl((R{s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyR#s cC@s#t|ttfƒr|St|ƒS(sญ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.(t isinstanceRKRWt_regen(Rl((s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyR)sR~cB@s2eZd„Zd„Zd„Zed„ƒZRS(cC@s ||_dS(N(t _regen__it(RRl((s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyR'4scC@st|jffS(N(RKR&(R((s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyt __reduce__7scC@s |jjƒS(N(Rt__length_hint__(R((s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyR:scC@s t|jƒS(N(RKR(R((s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyR&=s(R R!R'R€RRR&(((s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyR~2s   cK@sG|dkr|n|r't||n|}td„t|ƒDƒƒS(s<Remove all keys from dict ``d`` whose value is :const:`None`cs@s-|]#\}}|dk r||fVqdS(N(RN(RiR;Rj((s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pys EsN(RNRDR (RFtkw((s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyRBs-(-RMt __future__RRTR#t functoolsRt itertoolsRt kombu.utilsRtkombu.utils.functionalRRRRtkombu.utils.compatRt celery.fiveR R R R R t__all__thasattrRPtobjectRVRRRNRRRRRRRRRRRKR~R(((s9/tmp/pip-unpacked-wheel-gV1wwp/celery/utils/functional.pyts8  "(  f%