o Kg'@sdZddlmZddlZddlmZddlmZ m Z ddl Z ddl ZddlmZddlmZmZmZddlmZmZmZmZdd lmZmZm Z m!Z!m"Z"e rWdd l#m$Z$m%Z%ndd l&m$Z$m%Z%d d Zdd lm'Z'e!rqd4ddZ(nddlm(Z(e"rzddl)m*Z*Wn'e+yddl,m*Z*Ynwzddl-m*Z*Wne+yddl.m*Z*Ynwd5ddZ/Gddde0Z1Gddde2Z3zddlmZddl m4Z4Wn e+yYnwddZ5Gddde2Z6d d!Z7d4d"dZ(Gd#d$d$e%Z8dd%lm9Z9e9dfd&d'Z:d(d)Z;e3Ze(Z?eZ@e5ZAe/ZBe8ZCe:ZDe;ZEe jFd*krKdd+l#m3Z3m6Z6ddlm(Z(dd,lGm;Z;zdd-lm7Z7Wn e+yDYnwdd.lm:Z:e jFd/kr]ddlmZdd0l#m5Z5e jFd1krqdd2lHm/Z/dd3l#m8Z8dSdS)6a Miscellaneous function (re)definitions from the Py3.4+ standard library for Python 2.6/2.7. - math.ceil (for Python 2.7) - collections.OrderedDict (for Python 2.6) - collections.Counter (for Python 2.6) - collections.ChainMap (for all versions prior to Python 3.3) - itertools.count (for Python 2.6, with step parameter) - subprocess.check_output (for Python 2.6) - reprlib.recursive_repr (for Python 2.6+) - functools.cmp_to_key (for Python 2.6) )absolute_importN)ceil) itemgettereq)proxy)repeatchainstarmap) getaddrinfo SOCK_STREAMerrorsocket) iteritems itervaluesPY2PY26PY3)MappingMutableMappingcCs tt|S)zZ Return the ceiling of x as an int. This is the smallest integral value >= x. )intoldceil)xrZ/var/www/html/status_management/venv/lib/python3.10/site-packages/future/backports/misc.pyr#s r)islicecc |V||7}qNrstartsteprrrcount3s r!)r!) get_ident...csfdd}|S)zGDecorator to make a repr function return fillvalue for a recursive callcsLtfdd}td|_td|_td|_tdi|_|S)Nc sJt|tf}|vr S|z |}W||S|wr)idr"adddiscard)selfkeyresult) fillvalue repr_running user_functionrrwrapperMs    z.decorating_function..wrapper __module____doc____name____annotations__)setgetattrr.r/r0r1)r,r-r*)r+r,rdecorating_functionJs  z+recursive_repr..decorating_functionr)r*r5rr4rrecursive_reprGs r6c@seZdZdZdS)_Link)prevnextr( __weakref__N)r0r. __qualname__ __slots__rrrrr7jsr7c@seZdZdZddZejeefddZej fddZ dd Z d d Z d d Z d$ddZ d$ddZddZejZZejZejZejZejZeZefddZd%ddZeddZddZddZed%d d!Z d"d#Z!dS)& OrderedDictz)Dictionary that remembers insertion ordercOs|std|d}|dd}t|dkrtdt|z|jWntyAt|_t|j|_}||_|_i|_ Ynw|j |i|dS)zInitialize an ordered dictionary. The signature is the same as regular dictionaries, but keyword arguments are not recommended because their insertion order is arbitrary. z?descriptor '__init__' of 'OrderedDict' object needs an argumentrrN$expected at most 1 arguments, got %d) TypeErrorlen_OrderedDict__rootAttributeErrorr7_OrderedDict__hardroot_proxyr8r9_OrderedDict__map_OrderedDict__update)argskwdsr'rootrrr__init__|s      zOrderedDict.__init__c CsZ||vr%||j|<}|j}|j}||||_|_|_||_|||_||||dS)z!od.__setitem__(i, y) <==> od[i]=yN)rErAr8r9r() r'r(value dict_setitemrLinklinkrIlastrrr __setitem__s zOrderedDict.__setitem__cCs2||||j|}|j}|j}||_||_dS)z od.__delitem__(y) <==> del od[y]N)rEpopr8r9)r'r( dict_delitemrN link_prev link_nextrrr __delitem__s   zOrderedDict.__delitem__cc4|j}|j}||ur|jV|j}||us dSdS)zod.__iter__() <==> iter(od)N)rAr9r(r'rIcurrrrr__iter__zOrderedDict.__iter__ccrV)z#od.__reversed__() <==> reversed(od)N)rAr8r(rWrrr __reversed__rZzOrderedDict.__reversed__cCs*|j}||_|_|jt|dS)z.od.clear() -> None. Remove all items from od.N)rAr8r9rEcleardict)r'rIrrrr\s  zOrderedDict.clearTcCsj|std|j}|r|j}|j}||_||_n |j}|j}||_||_|j}|j|=t||}||fS)zod.popitem() -> (k, v), return and remove a (key, value) pair. Pairs are returned in LIFO order if last is true or FIFO order if false. zdictionary is empty)KeyErrorrAr8r9r(rEr]rQ)r'rOrIrNrSrTr(rKrrrpopitems  zOrderedDict.popitemcCsp|j|}|j}|j}||_||_|j}|r'|j}||_||_||_|_dS|j}||_||_||_|_dS)zMove an existing element to the end (or beginning if last==False). Raises KeyError if the element does not exist. When last=True, acts like a fast version of self[key]=self.pop(key). N)rEr8r9rA)r'r(rOrNrSrTrIfirstrrr move_to_ends zOrderedDict.move_to_endcCsVtj}t|d}||j}|||jd7}|||j|7}|||j|7}|S)Nr)sys getsizeofr@__dict__rErCrA)r'sizeofnsizerrr __sizeof__s  zOrderedDict.__sizeof__cCs0||vr ||}||=|S||jurt||S)zod.pop(k[,d]) -> v, remove specified key and return the corresponding value. If key is not found, d is returned if given, otherwise KeyError is raised. )_OrderedDict__markerr^)r'r(defaultr)rrrrQs zOrderedDict.popNcCs||vr||S|||<|S)zDod.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in odrr'r(rkrrr setdefaultszOrderedDict.setdefaultcCs*|s d|jjfSd|jjt|fS)zod.__repr__() <==> repr(od)%s()z%s(%r)) __class__r0listitemsr'rrr__repr__szOrderedDict.__repr__cCsDt|}ttD]}||dq |jd|pddt|fS)z%Return state information for picklingNr)varscopyr=rQroiterrq)r' inst_dictkrrr __reduce__ s zOrderedDict.__reduce__cC ||S)z!od.copy() -> a shallow copy of odrorrrrrru' zOrderedDict.copycCs|}|D]}|||<q|S)zOD.fromkeys(S[, v]) -> New ordered dictionary with keys from S. If not specified, the value defaults to None. r)clsiterablerKr'r(rrrfromkeys+s zOrderedDict.fromkeyscCs2t|trt||ottt||St||S)zod.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive while comparison to a regular mapping is order-insensitive. ) isinstancer=r]__eq__allmap_eqr'otherrrrr6s  zOrderedDict.__eq__)Tr)"r0r.r;r/rJr]rPrDr7rUrYr[r\r_rarirupdaterFkeysvaluesrq__ne__objectrjrQrmr6rsryru classmethodrrrrrrr=ms6           r=)r)nlargestcCs&|j}|D] }||dd||<qdS)z!Tally elements from the iterable.rrN)get)mappingr~ mapping_getelemrrr_count_elementsLsrcseZdZdZfddZddZd/ddZd d Zed/d d Z fd dZ ddZ ddZ ddZ fddZddZddZddZddZdd Zd!d"Zd#d$Zd%d&Zd'd(Zd)d*Zd+d,Zd-d.ZZS)0CounteraDict subclass for counting hashable items. Sometimes called a bag or multiset. Elements are stored as dictionary keys and their counts are stored as dictionary values. >>> c = Counter('abcdeabcdabcaba') # count elements from a string >>> c.most_common(3) # three most common elements [('a', 5), ('b', 4), ('c', 3)] >>> sorted(c) # list all unique elements ['a', 'b', 'c', 'd', 'e'] >>> ''.join(sorted(c.elements())) # list elements with repetitions 'aaaaabbbbcccdde' >>> sum(c.values()) # total of all counts 15 >>> c['a'] # count of letter 'a' 5 >>> for elem in 'shazam': # update counts from an iterable ... c[elem] += 1 # by adding 1 to each element's count >>> c['a'] # now there are seven 'a' 7 >>> del c['b'] # remove all 'b' >>> c['b'] # now there are zero 'b' 0 >>> d = Counter('simsalabim') # make another counter >>> c.update(d) # add in the second counter >>> c['a'] # now there are nine 'a' 9 >>> c.clear() # empty the counter >>> c Counter() Note: If a count is set to zero or reduced to zero, it will remain in the counter until the entry is deleted or the counter is cleared: >>> c = Counter('aaabbc') >>> c['b'] -= 2 # reduce the count of 'b' by two >>> c.most_common() # 'b' is still in, but its count is zero [('a', 3), ('c', 1), ('b', 0)] cs^|std|d}|dd}t|dkrtdt|tt||j|i|dS)a Create a new, empty Counter object. And if given, count elements from an input iterable. Or, initialize the count from another mapping of elements to their counts. >>> c = Counter() # a new, empty counter >>> c = Counter('gallahad') # a new counter from an iterable >>> c = Counter({'a': 4, 'b': 2}) # a new counter from a mapping >>> c = Counter(a=4, b=2) # a new counter from keyword args z;descriptor '__init__' of 'Counter' object needs an argumentrrNr>)r?r@superrrJr)rGrHr'r{rrrJs   zCounter.__init__cCsdS)z1The count of elements not in the Counter is zero.rrr'r(rrr __missing__szCounter.__missing__NcCs6|durt|tdddStj||tddS)zList the n most common elements and their counts from the most common to the least. If n is None, then list all element counts. >>> Counter('abcdeabcdabcaba').most_common(3) [('a', 5), ('b', 4), ('c', 3)] NrT)r(reverser()sortedrq _itemgetter_heapqr)r'rgrrr most_commons zCounter.most_commoncCsttt|S)aIterator over elements repeating each as many times as its count. >>> c = Counter('ABCABC') >>> sorted(c.elements()) ['A', 'A', 'B', 'B', 'C', 'C'] # Knuth's example for prime factors of 1836: 2**2 * 3**3 * 17**1 >>> prime_factors = Counter({2: 2, 3: 3, 17: 1}) >>> product = 1 >>> for factor in prime_factors.elements(): # loop over factors ... product *= factor # and multiply them >>> product 1836 Note, if an element's count has been set to zero or is a negative number, elements() will ignore it. )_chain from_iterable_starmap_repeatrqrrrrrelementsszCounter.elementscCtd)Nz@Counter.fromkeys() is undefined. Use Counter(iterable) instead.)NotImplementedError)r}r~vrrrrszCounter.fromkeyscs|std|d}|dd}t|dkrtdt||r$|dnd}|durUt|trP|rG|j}|D] \}}|||d||<q8ntt||nt |||r^||dSdS)aLike dict.update() but add counts instead of replacing them. Source can be an iterable, a dictionary, or another Counter instance. >>> c = Counter('which') >>> c.update('witch') # add elements from another iterable >>> d = Counter('watch') >>> c.update(d) # add elements from another counter >>> c['h'] # four 'h' in which, witch, and watch 4 z9descriptor 'update' of 'Counter' object needs an argumentrrNr>) r?r@rrrrqrrrrrGrHr'r~self_getrr!r{rrrs&    zCounter.updatecOs|std|d}|dd}t|dkrtdt||r$|dnd}|durS|j}t|trE|D] \}}||d|||<q6n|D] }||dd||<qG|r\||dSdS)aLike dict.update() but subtracts counts instead of replacing them. Counts can be reduced below zero. Both the inputs and outputs are allowed to contain zero and negative counts. Source can be an iterable, a dictionary, or another Counter instance. >>> c = Counter('which') >>> c.subtract('witch') # subtract elements from another iterable >>> c.subtract(Counter('watch')) # subtract elements from another counter >>> c['h'] # 2 in which, minus 1 in witch, minus 1 in watch 0 >>> c['w'] # 1 in which, minus 1 in witch, minus 1 in watch -1 z;descriptor 'subtract' of 'Counter' object needs an argumentrrNr>)r?r@rrrrqsubtractrrrrrs$   zCounter.subtractcCrz)zReturn a shallow copy.r{rrrrrrur|z Counter.copycCs|jt|ffSr)ror]rrrrrryszCounter.__reduce__cs ||vrtt||dSdS)zGLike dict.__delitem__() but does not raise KeyError for missing values.N)rrrU)r'rr{rrrUszCounter.__delitem__cCs`|sd|jjSzdtdj|}d|jj|fWSty/d|jjt|YSw)Nrn, z%r: %rz%s({%s})z {0}({1!r})) ror0joinr__mod__rr?formatr])r'rqrrrrs#s  zCounter.__repr__cCspt|tstSt}|D]\}}|||}|dkr |||<q|D]\}}||vr5|dkr5|||<q%|S)zAdd counts from two counters. >>> Counter('abbb') + Counter('bcc') Counter({'b': 4, 'c': 2, 'a': 1}) rrrNotImplementedrqr'rr)rr!newcountrrr__add__6s  zCounter.__add__cCstt|tstSt}|D]\}}|||}|dkr |||<q|D]\}}||vr7|dkr7d|||<q%|S)z Subtract count, but keep only results with positive counts. >>> Counter('abbbc') - Counter('bccd') Counter({'b': 2, 'a': 1}) rrrrrr__sub__Is   zCounter.__sub__cCs|t|tstSt}|D]\}}||}||kr|n|}|dkr&|||<q|D]\}}||vr;|dkr;|||<q+|S)zUnion is the maximum of value in either of the input counters. >>> Counter('abbb') | Counter('bcc') Counter({'b': 3, 'c': 2, 'a': 1}) rrr'rr)rr! other_countrrrr__or__\s zCounter.__or__cCsRt|tstSt}|D]\}}||}||kr|n|}|dkr&|||<q|S)z Intersection is the minimum of corresponding counts. >>> Counter('abbb') & Counter('bcc') Counter({'b': 1}) rrrrrr__and__ps zCounter.__and__cCs |tS)zEAdds an empty counter, effectively stripping negative and zero countsrrrrrr__pos__r|zCounter.__pos__cCs t|S)z{Subtracts from an empty counter. Strips positive and zero counts, and flips the sign on negative counts. rrrrrr__neg__s zCounter.__neg__cCs&dd|D}|D]}||=q |S)z?Internal method to strip elements with a negative or zero countcSsg|] \}}|dks|qS)rr).0rr!rrr sz*Counter._keep_positive..)rq)r' nonpositiverrrr_keep_positiveszCounter._keep_positivecCs*|D] \}}|||7<q|S)zInplace add from another counter, keeping only positive counts. >>> c = Counter('abbb') >>> c += Counter('bcc') >>> c Counter({'b': 4, 'c': 2, 'a': 1}) rqrr'rrr!rrr__iadd__ zCounter.__iadd__cCs*|D] \}}|||8<q|S)zInplace subtract counter, but keep only results with positive counts. >>> c = Counter('abbbc') >>> c -= Counter('bccd') >>> c Counter({'b': 2, 'a': 1}) rrrrr__isub__rzCounter.__isub__cCs2|D]\}}||}||kr|||<q|S)zInplace union is the maximum of value from either counter. >>> c = Counter('abbb') >>> c |= Counter('bcc') >>> c Counter({'b': 3, 'c': 2, 'a': 1}) r)r'rrrr!rrr__ior__  zCounter.__ior__cCs2|D]\}}||}||kr|||<q|S)zInplace intersection is the minimum of corresponding counts. >>> c = Counter('abbb') >>> c &= Counter('bcc') >>> c Counter({'b': 1}) r)r'rrr!rrrr__iand__rzCounter.__iand__r)r0r.r;r/rJrrrrrrrruryrUrsrrrrrrrrrrr __classcell__rrr{rrRs2 2    )#   rcOshd|vrtdtj|dtji|}|\}}|}|r2|d}|dur,|d}t|||S)z[ For Python 2.6 compatibility: see http://stackoverflow.com/questions/4814970/ stdoutz3stdout argument not allowed, it will be overridden.rGNr) ValueError subprocessPopenPIPE communicatepollrCalledProcessError) popenargskwargsprocessoutput unused_errretcodecmdrrr check_outputs   rccr)z ``itertools.count`` in Py 2.6 doesn't accept a step parameter. This is an enhanced version of ``itertools.count`` for Py2.6 equivalent to ``itertools.count`` in Python 2.7+. rrrrrr!s c@seZdZdZddZddZddZd'd d Zd d Zd dZ ddZ ddZ e Z e ddZeddZddZeZd'ddZeddZddZdd Zd!d"Zd#d$Zd%d&ZdS)(ChainMapa A ChainMap groups multiple dicts (or other mappings) together to create a single, updateable view. The underlying mappings are stored in a list. That list is public and can accessed or updated using the *maps* attribute. There is no other state. Lookups search the underlying mappings successively until a key is found. In contrast, writes, updates, and deletions only operate on the first mapping. cGst|pig|_dS)zInitialize a ChainMap by setting *maps* to the given mappings. If no mappings are provided, a single empty dictionary is used. N)rpmaps)r'rrrrrJszChainMap.__init__cCst|r)r^rrrrrzChainMap.__missing__c Cs6|jD]}z||WStyYqw||Sr)rr^r)r'r(rrrr __getitem__s   zChainMap.__getitem__NcCs||vr||S|Srrrlrrrrsz ChainMap.getcCttj|jSr)r@r2unionrrrrrr__len__zChainMap.__len__cCrr)rvr2rrrrrrrrYrzChainMap.__iter__cstfdd|jDS)Nc3s|]}|vVqdSrr)rmrrr sz(ChainMap.__contains__..anyrrrrr __contains__szChainMap.__contains__cCs t|jSrrrrrrr__bool__ zChainMap.__bool__cCsd|dtt|jS)Nz{0.__class__.__name__}({1})r)rrrreprrrrrrrrs!szChainMap.__repr__cGs|tj|g|RS)z?Create a ChainMap with a single dict created from the iterable.)r]r)r}r~rGrrrr&szChainMap.fromkeyscCs&|j|jdg|jddRS)zHNew ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]rrN)rorrurrrrrru+s&z ChainMap.copycCs |duri}|j|g|jRS)z New ChainMap with a new map followed by all previous maps. If no map is provided, an empty dict is used. Nror)r'rrrr new_child1szChainMap.new_childcCs|j|jddS)zNew ChainMap from maps[1:].rNrrrrrrparents:szChainMap.parentscCs||jd|<dSNr)r)r'r(rKrrrrP?rzChainMap.__setitem__cCs0z |jd|=WdStytd|w)Nr)Key not found in the first mapping: {0!r})rr^rrrrrrUBs  zChainMap.__delitem__cCs(z|jdWStytdw)zPRemove and return an item pair from maps[0]. Raise KeyError is maps[0] is empty.rz#No keys found in the first mapping.)rr_r^rrrrrr_Hs  zChainMap.popitemcGs8z |jdj|g|RWStytd|w)zWRemove *key* from maps[0] and return its value. Raise KeyError if *key* not in maps[0].rr)rrQr^r)r'r(rGrrrrQOs  z ChainMap.popcCs|jddS)z'Clear maps[0], leaving maps[1:] intact.rN)rr\rrrrrr\VszChainMap.clearr)r0r.r;r/rJrrrrrYrr __nonzero__r6rsrrru__copy__rpropertyrrPrUr_rQr\rrrrrs2       r)_GLOBAL_DEFAULT_TIMEOUTc Cs|\}}d}t||dtD]G}|\}}} } } d} z t||| } |tur(| ||r/| || | | WStyT} z| }| durJ| WYd} ~ q d} ~ ww|dur[|td)aBackport of 3-argument create_connection() for Py2.6. Connect to *address* and return the socket object. Convenience function. Connect to *address* (a 2-tuple ``(host, port)``) and return the socket object. Passing the optional *timeout* parameter will set the timeout on the socket instance before attempting to connect. If no *timeout* is supplied, the global default timeout setting returned by :func:`getdefaulttimeout` is used. If *source_address* is set it must be a tuple of (host, port) for the socket to bind as a source address before making the connection. An host of '' or port 0 tells the OS to use the default. Nrz!getaddrinfo returns an empty list) r r r r settimeoutbindconnectr close)addresstimeoutsource_addresshostporterrresafsocktypeproto canonnamesasock_rrrcreate_connection`s,     rcsGfdddt}|S)z,Convert a cmp= function into a key= functioncsjeZdZdgZddZfddZfddZfdd Zfd d Zfd d Z fddZ ddZ dS)zcmp_to_key..KobjcWs ||_dSrr)r'rrGrrrrJrzcmp_to_key..K.__init__cs|j|jdkSrrrmycmprr__lt__rzcmp_to_key..K.__lt__cs|j|jdkSrrrrrr__gt__rzcmp_to_key..K.__gt__cs|j|jdkSrrrrrrrrzcmp_to_key..K.__eq__cs|j|jdkSrrrrrr__le__rzcmp_to_key..K.__le__cs|j|jdkSrrrrrr__ge__rzcmp_to_key..K.__ge__cs|j|jdkSrrrrrrrrzcmp_to_key..K.__ne__cSr)Nzhash not implemented)r?rrrrr__hash__rzcmp_to_key..K.__hash__N) r0r.r;r<rJrrrrr rr rrrrKs       r )r)rr rrr cmp_to_keysr )rb)r=r)r )r)r)r)r)rr)r6)r)rr)r#)Ir/ __future__rrmathrroperatorrrrrrcheapqr_weakrefrrD itertoolsrrrrr rr r r r future.utilsrrrrr collectionsrrcollections.abcrr!_threadr" ImportError _dummy_threadthread dummy_threadr6rr7r]r=rrrrrrrr  _OrderedDict_Counter _check_output_count_ceil__count_elements_recursive_repr _ChainMap_create_connection _cmp_to_key version_info functoolsreprlibrrrrs         #V  |  l )