U .enc@sdZddlZddlmZddlmZddlmZmZm Z m Z m Z ddl m Z mZmZddlmZmZddlmZdd lmZmZmZmZd d lmZmZd d lmZzdd lm Z!Wne"k rdZ!YnXzddl#m$Z$m%Z%Wn(e"k r GdddZ$e$Z%YnXdZ&dZ'ddZ(ddZ)GdddeZGdddZ*Gddde+e*Z,GdddZ-e .e-Gdd d e Z/Gd!d"d"e/e*Z0Gd#d$d$Z1e .e1Gd%d&d&Z2Gd'd(d(e2Z3e .e3Gd)d*d*ee2Z4dS)+z8Custom maps, sets, sequences, and other data structures.N) OrderedDict)deque)CallableMappingMutableMapping MutableSetSequence)heapifyheappopheappush)chaincount)Empty)AnyDictIterableList)firstuniq) match_case) reversed_dict) LazyObject LazySettingsc@s eZdZdS)rN)__name__ __module__ __qualname__rrcCs*t|ttfr|j}t|ts&t|S|S)z?Wrap object into supporting the mapping interface if necessary.) isinstancerrZ_wrappedrr$mrrrr('sr(cs |jfdd|D|S)zpIn place left precedent dictionary merge. Keeps values from `L`, if the value in `R` is :const:`None`. cs"g|]\}}|dk r||qSNr).0kvsetitemrr 6szlpmerge..) __setitem__items)LRrr1rr)/sr)c@s<eZdZdZddZeeds8er.d ddZn d ddZd S) rz#Dict where insertion order matters.cCstt|Sr-)nextiterkeysselfrrr_LRUkey=szOrderedDict._LRUkey move_to_endTcCs|s td||||<dS)Nzno last=True on PyPy)NotImplementedErrorpop)r<keylastrrrr>FszOrderedDict.move_to_endcCs|j|}|d}|d}||d<||d<|j}|r^|d}||d<||d<||d<|d<n(|d}||d<||d<||d<|d<dSNrr)Z_OrderedDict__mapZ_OrderedDict__root)r<rArBlinkZ link_prevZ link_nextrootZ first_noderrrr>Qs N)T)T) rrr__doc__r=hasattr _OrderedDict_dict_is_orderedr>rrrrr:s   rc@s(eZdZdZddZeddddZdS)rz[Mixin for Mapping interface that adds attribute access. I.e., `d.key -> d[key]`). cCs<z ||WStk r6tt|jd|YnXdS)z`d.key -> d[key]`.z object has no attribute N)KeyErrorAttributeErrortyper)r<r/rrr __getattr__ks  zAttributeDictMixin.__getattr__N)rAreturncCs |||<dS)z"`d[key] = value -> d.key = value`.Nrr<rAvaluerrr __setattr__tszAttributeDictMixin.__setattr__)rrrrFrMstrrQrrrrres rc@seZdZdZdS)r z$Dict subclass with attribute access.N)rrrrFrrrrr ysr c@seZdZdZdZddZddZddZdd d Zdd d Z d dZ ddZ ddZ ddZ e ZddZddZeZddZeZeZe ZeZdS)r$z[Dict interface to attributes. `obj[k] -> obj.k` `obj[k] = val -> obj.k = val` NcCst|d|dS)Nobj)objectrQ)r<rSrrr__init__szDictAttribute.__init__cCs t|j|Sr-)getattrrSr<rArrrrMszDictAttribute.__getattr__cCst|j||Sr-setattrrSrOrrrrQszDictAttribute.__setattr__cCs(z ||WStk r"|YSXdSr-rJr<rAdefaultrrrgets zDictAttribute.getcCs||kr|||<dSr-rr[rrr setdefaultszDictAttribute.setdefaultcCs0zt|j|WStk r*t|YnXdSr-)rVrSrKrJrWrrr __getitem__szDictAttribute.__getitem__cCst|j||dSr-rXrOrrrr4szDictAttribute.__setitem__cCs t|j|Sr-)rGrSrWrrr __contains__szDictAttribute.__contains__cCstt|jSr-)r9dirrSr;rrr _iterate_keysszDictAttribute._iterate_keyscCs|Sr-rbr;rrr__iter__szDictAttribute.__iter__ccs$|D]}|t|j|fVqdSr-rbrVrSrWrrr_iterate_itemss zDictAttribute._iterate_itemsccs |D]}t|j|VqdSr-rerWrrr_iterate_valuess zDictAttribute._iterate_values)N)N)rrrrFrSrUrMrQr]r^r_r4r`rbiterkeysrdrf iteritemsrg itervaluesr5r:valuesrrrrr$}s(  r$c@s eZdZdZdZdZdZdZdZddZ ddZ dd Z d d Z d d Z ddZddZddZddZd4ddZddZddZddZddZeZd5d d!Zd"d#Zd$d%Zed&d'Zd(d)ZeZd*d+Zd,d-Z e Z!d.d/Z"e"Z#d0d1Z$e$Z%d2d3Z&e Z'e"Z(e$Z)dS)6r"z!Key lookup on a sequence of maps.NrcOs:t|p ig}|jj|d||d|ddgddS)Nkey_trr)rlmapschangesdefaults _observers)list__dict__updater])r<rmkwargsrrrrUs zChainMap.__init__cCs(t|}|jd||jd|dSrC)r(roinsertrm)r<drrr add_defaultsszChainMap.add_defaultscGs@z|jdj|f|WStk r:td|YnXdS)Nrz$Key not found in the first mapping: )rmr@rJr[rrrr@s z ChainMap.popcCs t|dSr-rZrWrrr __missing__szChainMap.__missing__cCs|jdk r||S|Sr-)rlrWrrr_keysz ChainMap._keyc CsD||}|jD](}z||WStk r6YqXq||Sr-)ryrmrJrx)r<rArymappingrrrr_s  zChainMap.__getitem__cCs||j||<dSr-rnryrOrrrr4szChainMap.__setitem__cCs:z|j||=Wn"tk r4td|YnXdS)Nz Key not found in first mapping: )rnryrJrWrrr __delitem__szChainMap.__delitem__cCs|jdSr-rnclearr;rrrr~ szChainMap.clearcCs.z|||WStk r(|YSXdSr-)ryrJr[rrrr] sz ChainMap.getcCsttj|jSr-)lensetunionrmr;rrr__len__szChainMap.__len__cCs|Sr-rcr;rrrrdszChainMap.__iter__cs"|tfdd|jDS)Nc3s|]}|kVqdSr-r)r.r,rArr sz(ChainMap.__contains__..)ryanyrmrWrrrr`s zChainMap.__contains__cCs t|jSr-)rrmr;rrr__bool__ szChainMap.__bool__cCs||}||kr|||<dSr-)ryr[rrrr^%s zChainMap.setdefaultcOs(|jj||}|jD]}|||q|Sr-)rnrsrp)r<argsrtresultcallbackrrrrs+s  zChainMap.updatecCsd|dtt|jS)Nz{0.__class__.__name__}({1})z, )formatjoinmapreprrmr;rrr__repr__2szChainMap.__repr__cGs|tj|f|S)z?Create a ChainMap with a single dict created from the iterable.)dictfromkeys)clsiterablerrrrr7szChainMap.fromkeyscCs$|j|jdf|jddSrC) __class__rmcopyr;rrrr=sz ChainMap.copycstfddt|jDS)Nc3s|]}|VqdSr-r)r.rvoprrrHsz!ChainMap._iter..)r reversedrm)r<rrrr_iterBszChainMap._itercCst|ddS)NcSs|Sr-r:)rvrrrLz(ChainMap._iterate_keys..)rrr;rrrrbJszChainMap._iterate_keyscsfddDS)Nc3s|]}||fVqdSr-rr.rAr;rrrQsz*ChainMap._iterate_items..rr;rr;rrfOszChainMap._iterate_itemscsfddDS)Nc3s|]}|VqdSr-rrr;rrrVsz+ChainMap._iterate_values..rr;rr;rrgTszChainMap._iterate_valuescCs|j|dSr-)rpappend)r<rrrrbind_toYszChainMap.bind_to)N)N)*rrrrFrlrnrormrprUrwr@rxryr_r4r|r~r]rrdr`r __nonzero__r^rsr classmethodrr__copy__rrbrhrfrirgrjrr:r5rkrrrrr"sN     r"csheZdZdZdfdd ZddZfddZd d Zd d Zdd dZ ddZ ddZ ddZ Z S)r#aA view over an applications configuration dictionaries. Custom (but older) version of :class:`collections.ChainMap`. If the key does not exist in ``changes``, the ``defaults`` dictionaries are consulted. Arguments: changes (Mapping): Map of configuration changes. defaults (List[Mapping]): List of dictionaries containing the default configuration. NcsH|dkr gn|}tj|f||jj|r:|ddn||ddS)N_)prefix_keys)superrUrrrsrstrip)r<rnror:rrrrrUos zConfigurationView.__init__cCs4|j}|r.||s||n|}t|||fS|fSr-)r startswithr)r<rArZpkeyrrr_to_keysxs zConfigurationView._to_keysc s|}tj}||jr2tfdd|jDndD](}z||WStk r^Yq8Xq8z |WStk rt|dkrtdj|YnXdS)Nc3s|]}|VqdSr-r)r.frrrrsz0ConfigurationView.__getitem__..rrz)Key not found: {0!r} (with prefix: {0!r})) rrr_rtuplerJrxrr)r<rAr:getitemr/rrrr_s"    zConfigurationView.__getitem__cCs||j||<dSr-r{rOrrrr4szConfigurationView.__setitem__cstdfdd|DS)Nc3s|]}|VqdSr-)r]rr;rrrsz*ConfigurationView.first..)r)r<r:rr;rrszConfigurationView.firstcCs(z ||WStk r"|YSXdSr-rZr[rrrr]s zConfigurationView.getcCs|jdS)z&Remove all changes, but keep defaults.Nr}r;rrrr~szConfigurationView.clearcs"||tfdd|jDS)Nc3s$|]tfddDVqdS)c3s|]}|kVqdSr-r)r.r/r+rrrsz;ConfigurationView.__contains__...N)r)r.rr+rrsz1ConfigurationView.__contains__..)rrrmrWrrrr`s zConfigurationView.__contains__cCs@|jd}|jd}|jj|||jd|jd|g|ddS)Nrnrorlr)rnrorlrrm)rrrs)r<otherrnrorrr swap_withs  zConfigurationView.swap_with)NNN)N)rrrrFrUrr_r4rr]r~r`r __classcell__rrrrr#as    r#c@seZdZdZdZd*ddZddZd d Zd d Zd+d dZ ddZ ddZ e Z d,ddZ d-edddZddZddZddZddZd d!Zd"d#Zd$d%Zd&d'ZeZed(d)ZdS).r&a/Kind-of Set (or priority queue) with limitations. Good for when you need to test for membership (`a in set`), but the set should not grow unbounded. ``maxlen`` is enforced at all times, so if the limit is reached we'll also remove non-expired items. You can also configure ``minlen``: this is the minimal residual size of the set. All arguments are optional, and no limits are enabled by default. Arguments: maxlen (int): Optional max number of items. Adding more items than ``maxlen`` will result in immediate removal of items sorted by oldest insertion time. expires (float): TTL for all items. Expired items are purged as keys are inserted. minlen (int): Minimal residual size of this set. .. versionadded:: 4.0 Value must be less than ``maxlen`` if both are configured. Older expired items will be deleted, only after the set exceeds ``minlen`` number of items. data (Sequence): Initial data to initialize set with. Can be an iterable of ``(key, value)`` pairs, a dict (``{key: insertion_time}``), or another instance of :class:`LimitedSet`. Example: >>> s = LimitedSet(maxlen=50000, expires=3600, minlen=4000) >>> for i in range(60000): ... s.add(i) ... s.add(str(i)) ... >>> 57000 in s # last 50k inserted values are kept True >>> '10' in s # '10' did expire and was purged from set. False >>> len(s) # maxlen is reached 50000 >>> s.purge(now=time.monotonic() + 7200) # clock + 2 hours >>> len(s) # now only minlen items are cached 4000 >>>> 57000 in s # even this item is gone now False rNcCs|dkr dn||_|dkrdn||_|dkr0dn||_i|_g|_|rP|||j|jkrhdksrntd|jdkrtddS)Nrz:minlen must be a positive number, less or equal to maxlen.zexpires cannot be negative!)maxlenminlenexpires_data_heaprs ValueError)r<rrdatarrrrrUs  zLimitedSet.__init__cCs,dd|jD|jdd<t|jdS)z=Time consuming recreating of heap. Don't run this too often.cSsg|]}|qSrr)r.entryrrrr3sz,LimitedSet._refresh_heap..N)rrkrr r;rrr _refresh_heapszLimitedSet._refresh_heapcCs|j|jkr|dSr-)_heap_overloadmax_heap_percent_overloadrr;rrr_maybe_refresh_heap s zLimitedSet._maybe_refresh_heapcCs|jg|jdd<dS)z)Clear all data, start from scratch again.N)rr~rr;rrrr~s zLimitedSet.clearcCs`|p t}||jkr ||||f}||j|<t|j||jr\t|j|jkr\|dS)z=Add a new item, or reset the expiry time of an existing item.N) time monotonicrdiscardr rrrpurge)r<itemnowrrrradds     zLimitedSet.addcCs|sdSt|tr2|j|j||nvt|tr|D]L\}}t|tt frb|d}t|t st dt |d|| ||qDn|D]}| |qdS)z8Update this set from other LimitedSet, dict or iterable.Nrz$Expecting float timestamp, got type z with value: )r*r&rrsrrrr5rrqfloatrrLr)r<rrAinsertedrSrrrrs s"    zLimitedSet.updatecCs|j|d|dSr-)rr@rr<rrrrr:szLimitedSet.discardcCs|p t}t|tr|n|}|jr@t|j|jkr@|q&|jrt|j|j krbdkrnn(|j d\}}||j|krq|qFdS)zCheck oldest items and remove them if needed. Arguments: now (float): Time of purging -- by default right now. This can be useful for unit testing. rN) rrr*rrrrr@rrr)r<rZ inserted_timerrrrrAs   zLimitedSet.purgerNcCsD|jr@t|j\}}z|j|Wntk r8YqX|Sq|S)z?Remove and return the oldest item, or :const:`None` when empty.)rr rr@rJ)r<r\rrrrrr@VszLimitedSet.popcCsdd|jDS)a6Whole set as serializable dictionary. Example: >>> s = LimitedSet(maxlen=200) >>> r = LimitedSet(maxlen=200) >>> for i in range(500): ... s.add(i) ... >>> r.update(s.as_dict()) >>> r == s True cSsi|]\}}||qSrr)r.rrArrr qsz&LimitedSet.as_dict..)rrkr;rrras_dictcszLimitedSet.as_dictcCs |j|jkSr-r)r<rrrr__eq__sszLimitedSet.__eq__cCstj|t|jt|dS)N)namesize)REPR_LIMITED_SETrrLrrr;rrrrws zLimitedSet.__repr__cCsddt|jDS)Ncss|]\}}|VqdSr-r)r.rirrrrsz&LimitedSet.__iter__..)sortedrrkr;rrrrd}szLimitedSet.__iter__cCs t|jSr-)rrr;rrrrszLimitedSet.__len__cCs ||jkSr-rrWrrrr`szLimitedSet.__contains__cCs|j|j|j||jffSr-)rrrrrr;rrr __reduce__s zLimitedSet.__reduce__cCs t|jSr-)boolrr;rrrrszLimitedSet.__bool__cCs"t|jdtt|jddS)z5Compute how much is heap bigger than data [percents].dr)rrmaxrr;rrrrszLimitedSet._heap_overload)rrNr)N)N)N)rrrrFrrUrrr~rrsrZ pop_valuerrr@rrrrdrr`rrrpropertyrrrrrr&s.5    r&c@sFeZdZdZeZddddZdefedddd Zddd d Z dS) r%z2Mixin for classes supporting the ``evict`` method.NrcCs|jtddS)z&Force evict until maxsize is enforced.)rangeN)_evictr r;rrrevictszEvictable.evictr)limitrNcs4zfdd||DWntk r.YnXdS)Ncsg|] }qSr)_evict1)r.rr;rrr3sz$Evictable._evict..) IndexError)r<rrrr;rrszEvictable._evictcCs@|j|jkrtz |Wn|jk r:tYnXdSr-) _evictcountmaxsizer _pop_to_evictrr;rrrrs   zEvictable._evict1) rrrrFrrrintrrrrrrr%s r%c@seZdZdZeZdefddZddZddZd d Z d d Z d dZ ddZ ddZ edddZddZddZeddZdS)r'zA buffer of pending messages.NcCs@||_||pg|_|jj|_|jj|_|jj|_|jj|_ dSr-) rrr_appendpopleft_popr_lenextend_extend)r<rrrrrrrUs    zMessagebuffer.__init__cCs|||jo|dSr-)rrrrrrrputs zMessagebuffer.putcCs|||jo|dSr-)rrr)r<itrrrrs zMessagebuffer.extendcGs<z |WStk r6|r*|dYS|YnXdS)Nr)rrrr<r\rrrtakes   zMessagebuffer.takecCs|Sr-)rr;rrrrszMessagebuffer._pop_to_evictcCs$dt|jdt|d|jdSN)rLrrrr;rrrrszMessagebuffer.__repr__ccs.z|VWqtk r&Yq*YqXqdSr-)rrr;rrrrdszMessagebuffer.__iter__cCs|Sr-)rr;rrrrszMessagebuffer.__len__rcCs ||jkSr-rrrrrr`szMessagebuffer.__contains__cCs t|jSr-)rrr;rrr __reversed__szMessagebuffer.__reversed__cCs |j|Sr-r)r<indexrrrr_szMessagebuffer.__getitem__cCst|Sr-rr;rrrrszMessagebuffer._evictcount)rrrrFrrrUrrrrrrdrrr`rr_rrrrrrr's  r'cseZdZdZeZeZdZdZdZ dfdd Z ddZ d d Z d d Z d dZddZddZddZddZeddZZS)r!zMap of buffers.Nrcs@t||_d|_|r$||tdd|D|_dS)Nrcss|]}t|VqdSr-r)r.bufrrrrsz%BufferMap.__init__..)rrUr bufmaxsizerssumr5total)r<rrrrrrrUs   zBufferMap.__init__cCs:||||jd7_|||jo4|dS)Nr)_get_or_create_bufferrrr>rr)r<rArrrrrs z BufferMap.putcCs4||||jt|7_|jo.|dSr-)rrrrrr)r<rArrrrrszBufferMap.extendcGsd\}}z ||}Wntk r,d}YnBXz|}|jd8_Wn|jk rbd}Yn X|||r|r~|dS||S)N)NFTrr)rJrrrr>)r<rAr\rthrowrrrrrs     zBufferMap.takecCs8z ||WStk r2|}||<|YSXdSr-)rJ _new_buffer)r<rArrrrr4s  zBufferMap._get_or_create_buffercCs|j|jdS)N)r)Bufferrr;rrrr<szBufferMap._new_buffercGs||j|Sr-)r=rrrrr_LRUpop@szBufferMap._LRUpopc CstdD]v}|}||}z |Wn$t|jfk rL||YqX|jd8_t|sp||n ||qqdS)Nrr) rr=rrrr@rrr>)r<rrArrrrrDs    zBufferMap._pop_to_evictcCs"dt|jd|jd|jdSr)rLrrrr;rrrrYszBufferMap.__repr__cCs|jSr-)rr;rrrr]szBufferMap._evictcount)Nr)rrrrFr'rrrrrrUrrrrrrrrrrrrrrrr!s" r!)5rFr collectionsrrHrcollections.abcrrrrrheapqr r r itertoolsr r queuertypingrrrrZ functionalrrtextrZ__pypy__rrI ImportErrorZdjango.utils.functionalrr__all__rr(r)rrr r$registerr"r#r&r%r'r!rrrrsL       +J Xb F