grthtrhthjhtyjytjytkergtrhtrjytjerhrfh4:24 29/09/2026U if @sdZddddddddd d d d d g ZddlmZddlmZddlmZddlm Z dZ dZ e e fddZ e e fddZ efddZefddZefddZefddZefdd Zefd!d"Zefd#d$Zefd%d&Zefd'd(Zefd)d*Zefd+d,Zefd-d.Zd/efd0efd1efgd1efd2efd/efgd2efd1efd0efgd0efd/efd2efgd3Zd4dZd5dZzdd6lmZWnek rYnXe Z!e!fd7dZ"zdd8lm"Z"Wnek rYnXGd9d d Z#zdd:lm#Z#Wnek rYnXGd;d d e Z$dd?d@dAdBgZ&GdCdDdDe'Z(e fe)e*he+e,e-fdEdFZ.dYdIdZ/dJdKZ0zddLlm0Z0Wnek rYnXdMdNZ1dZdPdQZ2dRdSZ3dTdUZ4dVd Z5GdWd d Z6e Z7GdXd d Z8dOS)[zEfunctools.py - Tools for working with functions and callable objects update_wrapperwrapsWRAPPER_ASSIGNMENTSWRAPPER_UPDATEStotal_ordering cmp_to_key lru_cachereducepartial partialmethodsingledispatchsingledispatchmethodcached_property)get_cache_token) namedtuple)recursive_repr)RLock) __module____name__ __qualname____doc____annotations__)__dict__c Csf|D]4}zt||}Wntk r*YqXt|||q|D]}t||t||iq>||_|S)aUpdate a wrapper function to look like the wrapped function wrapper is the function to be updated wrapped is the original function assigned is a tuple naming the attributes assigned directly from the wrapped function to the wrapper function (defaults to functools.WRAPPER_ASSIGNMENTS) updated is a tuple naming the attributes of the wrapper that are updated with the corresponding attribute from the wrapped function (defaults to functools.WRAPPER_UPDATES) )getattrAttributeErrorsetattrupdate __wrapped__)wrapperwrappedassignedupdatedattrvaluer$./opt/alt/python38/lib64/python3.8/functools.pyr"scCstt|||dS)aDecorator factory to apply update_wrapper() to a wrapper function Returns a decorator that invokes update_wrapper() with the decorated function as the wrapper argument and the arguments to wraps() as the remaining arguments. Default arguments are as for update_wrapper(). This is a convenience function to simplify applying partial() to update_wrapper(). rr r!)r rr&r$r$r%r@s cCs$||}||kr|S| o"||kS)zIReturn a > b. Computed by @total_ordering from (not a < b) and (a != b).__lt__selfotherNotImplemented op_resultr$r$r% _gt_from_ltXs r.cCs||}|p||kS)zEReturn a <= b. Computed by @total_ordering from (a < b) or (a == b).r'r)r$r$r% _le_from_lt_s r/cCs||}||kr|S| S)z=Return a >= b. Computed by @total_ordering from (not a < b).r'r)r$r$r% _ge_from_ltds r0cCs$||}||kr|S| p"||kS)zJReturn a >= b. Computed by @total_ordering from (not a <= b) or (a == b).__le__r)r$r$r% _ge_from_leks r3cCs"||}||kr|S|o ||kS)zFReturn a < b. Computed by @total_ordering from (a <= b) and (a != b).r1r)r$r$r% _lt_from_lers r4cCs||}||kr|S| S)z=Return a > b. Computed by @total_ordering from (not a <= b).r1r)r$r$r% _gt_from_leys r5cCs$||}||kr|S| o"||kS)zIReturn a < b. Computed by @total_ordering from (not a > b) and (a != b).__gt__r)r$r$r% _lt_from_gts r8cCs||}|p||kS)zEReturn a >= b. Computed by @total_ordering from (a > b) or (a == b).r6r)r$r$r% _ge_from_gts r9cCs||}||kr|S| S)z=Return a <= b. Computed by @total_ordering from (not a > b).r6r)r$r$r% _le_from_gts r:cCs$||}||kr|S| p"||kS)zJReturn a <= b. Computed by @total_ordering from (not a >= b) or (a == b).__ge__r)r$r$r% _le_from_ges r=cCs"||}||kr|S|o ||kS)zFReturn a > b. Computed by @total_ordering from (a >= b) and (a != b).r;r)r$r$r% _gt_from_ges r>cCs||}||kr|S| S)z=Return a < b. Computed by @total_ordering from (not a >= b).r;r)r$r$r% _lt_from_ges r?r7r2r<r()r(r2r7r<csVfddtD}|stdt|}t|D]"\}}||kr.||_t||q.S)z6Class decorator that fills in missing ordering methodscs(h|] }t|dtt|dk r|qSN)robject).0opclsr$r% sz!total_ordering..z6must define at least one ordering operation: < > <= >=)_convert ValueErrormaxrr)rErootsrootopnameopfuncr$rDr%rscsGfdddt}|S)z,Convert a cmp= function into a key= functioncsZeZdZdgZddZfddZfddZfdd Zfd d Zfd d Z dZ dS)zcmp_to_key..KobjcSs ||_dSr@rN)r*rNr$r$r%__init__szcmp_to_key..K.__init__cs|j|jdkSNrrOr*r+mycmpr$r%r(szcmp_to_key..K.__lt__cs|j|jdkSrQrOrRrSr$r%r7szcmp_to_key..K.__gt__cs|j|jdkSrQrOrRrSr$r%__eq__szcmp_to_key..K.__eq__cs|j|jdkSrQrOrRrSr$r%r2szcmp_to_key..K.__le__cs|j|jdkSrQrOrRrSr$r%r<szcmp_to_key..K.__ge__N) rrr __slots__rPr(r7rUr2r<__hash__r$rSr$r%Ks     rX)rA)rTrXr$rSr%rs)rcCsZt|}|tkr>z t|}WqBtk r:tddYqBXn|}|D]}|||}qF|S)a reduce(function, sequence[, initial]) -> value Apply a function of two arguments cumulatively to the items of a sequence, from left to right, so as to reduce the sequence to a single value. For example, reduce(lambda x, y: x+y, [1, 2, 3, 4, 5]) calculates ((((1+2)+3)+4)+5). If initial is present, it is placed before the items of the sequence in the calculation, and serves as a default when the sequence is empty. z0reduce() of empty sequence with no initial valueN)iter_initial_missingnext StopIteration TypeError)ZfunctionZsequenceinitialitr#Zelementr$r$r%rs   )rcsJeZdZdZdZfddZddZeddZd d Z d d Z Z S) r zSNew function with partial application of the given arguments and keywords. )funcargskeywordsr __weakref__csZt|stdt|dr4|j|}|j|}|j}tt||}||_||_||_|S)Nz#the first argument must be callabler`) callabler]hasattrrarbr`superr __new__)rEr`rarbr* __class__r$r%rgs   zpartial.__new__cOs|j|}|j|j||Sr@rbr`ra)r*rarbr$r$r%__call__%s zpartial.__call__cCst|j}t|jg}|dd|jD|dd|jDt|jdkrld|dd |dS|dd |dS) Ncss|]}t|VqdSr@)repr)rBxr$r$r% -sz#partial.__repr__..css |]\}}|d|VqdS)=Nr$rBkvr$r$r%rn.s functoolsz functools.(, )) typerrlr`extendrarbitemsrjoin)r*qualnamerar$r$r%__repr__)s  zpartial.__repr__cCs*t||jf|j|j|jpd|jp$dffSr@)rwr`rarbrr*r$r$r% __reduce__3szpartial.__reduce__cCst|tstdt|dkr0tdt||\}}}}t|rrt|trr|dk r`t|trr|dk rzt|tsztdt|}|dkri}nt|tk rt|}|dkri}||_||_||_ ||_ dS)Nz(argument to __setstate__ must be a tuplezexpected 4 items in state, got zinvalid partial state) isinstancetupler]lenrddictrwrr`rarb)r*stater`rakwds namespacer$r$r% __setstate__7s4    zpartial.__setstate__) rrrrrVrgrkrr|r~r __classcell__r$r$rhr%r s  )r c@sDeZdZdZddZde_ddZddZdd d Ze d d Z d S)r zMethod descriptor with partial application of the given arguments and keywords. Supports wrapping existing descriptors and handles non-descriptor callables as instance methods. cOst|dkr|^}}}nV|s&tdnHd|krZ|d}|^}}ddl}|jdtddntdt|dt|}t|st|d std |t |t r|j |_ |j ||_ |j||_n||_ ||_ ||_dS) Nz8descriptor '__init__' of partialmethod needs an argumentr`rz0Passing 'func' as keyword argument is deprecated) stacklevelz8type 'partialmethod' takes at least one argument, got %d__get__z${!r} is not callable or a descriptor)rr]popwarningswarnDeprecationWarningrrdreformatrr r`rarb)rarbr*r`rr$r$r%rP]s6       zpartialmethod.__init__z#($self, func, /, *args, **keywords)cCsNdtt|j}ddd|jD}d}|j|jj|jj |j ||dS)Nrucss|]\}}d||VqdS)z{}={!r}N)rrpr$r$r%rnsz)partialmethod.__repr__..z*{module}.{cls}({func}, {args}, {keywords}))modulerEr`rarb) rzmaprlrarbryrrirrr`)r*rarb format_stringr$r$r%r|s  zpartialmethod.__repr__csfdd}j|_|_|S)Ncs j|}j|fj||Sr@rj) cls_or_selfrarbr}r$r%_methods z3partialmethod._make_unbound_method.._method)__isabstractmethod___partialmethod)r*rr$r}r%_make_unbound_methods z"partialmethod._make_unbound_methodNcCst|jdd}d}|dk rd|||}||jk rdt|f|j|j}z |j|_Wntk rbYnX|dkr||||}|S)Nr) rr`r rarb__self__rrr)r*rNrEgetresultnew_funcr$r$r%rs   zpartialmethod.__get__cCst|jddSNrFrr`r}r$r$r%rsz"partialmethod.__isabstractmethod__)N) rrrrrP__text_signature__r|rrpropertyrr$r$r$r%r Us"  cCst|tr|j}q|Sr@)rr r`r`r$r$r%_unwrap_partials r CacheInfohitsmissesmaxsizecurrsizec@s(eZdZdZdZefddZddZdS) _HashedSeqz This class guarantees that hash() will be called no more than once per element. This is important because the lru_cache() will hash the key multiple times on a cache miss. hashvaluecCs||dd<|||_dSr@r)r*tuphashr$r$r%rPs z_HashedSeq.__init__cCs|jSr@rr}r$r$r%rWsz_HashedSeq.__hash__N)rrrrrVrrPrWr$r$r$r%rs rc s|}|r&||7}|D] } || 7}q|rh||fdd|D7}|r||fdd|D7}n$||dkr|d|kr|dSt|S)aMake a cache key from optionally typed positional and keyword arguments The key is constructed in a way that is flat as possible rather than as a nested structure that would take more memory. If there is only a single argument and its data type is known to cache its hash value, then that argument is returned without a wrapper. This saves space and improves lookup speed. c3s|]}|VqdSr@r$rBrrrwr$r%rnsz_make_key..c3s|]}|VqdSr@r$rrr$r%rnsrr)ryvaluesr) rartypedkwd_mark fasttypesrrwrkeyitemr$rr% _make_keys   rFcsnttrdkr\dnDtrLttrLd}t|t}t||Sdk r\tdfdd}|S)aLeast-recently-used cache decorator. If *maxsize* is set to None, the LRU features are disabled and the cache can grow without bound. If *typed* is True, arguments of different types will be cached separately. For example, f(3.0) and f(3) will be treated as distinct calls with distinct results. Arguments to the cached function must be hashable. View the cache statistics named tuple (hits, misses, maxsize, currsize) with f.cache_info(). Clear the cache and statistics with f.cache_clear(). Access the underlying function with f.__wrapped__. See: http://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU) rrNz=Expected first argument to be an integer, a callable, or Nonecst|t}t||Sr@)_lru_cache_wrapper _CacheInfor) user_functionrrrr$r%decorating_function sz&lru_cache..decorating_function)rintrdboolrrrr])rrrrrr$rr%rs   cstt d\id djjt gddgdd< dkrh fdd}nN dkr fdd}n* fdd} fdd } fd d }||_||_|S) N)rrrrFcsd7||}|SNrr$)rarr)rrr$r%r$s z#_lru_cache_wrapper..wrappercsH||}|}|k r*d7|Sd7||}||<|Srr$)rarrr)cache cache_getrmake_keyrsentinelrrr$r%r-s   c s> ||} z|}|dk r~|\}}}}||<||< }||< <||< |<d7|W5QRS d7 W5QRX||} |krnr } || <|| <|  } } d < <| =| |<n6 }| ||g}||< <|< kW5QRX|Srr$) rarrlinkZ link_prevZ link_nextZ_keyrZlastZoldrootZoldkeyZ oldresult)KEYNEXTPREVRESULTrr cache_lenfullrlockrrrrKrrr$r%r<sB     c s,W5QRSQRXdS)zReport cache statisticsNr$r$)rrrrrrr$r% cache_infousz&_lru_cache_wrapper..cache_infoc s<.ddgdd<ddW5QRXdS)z$Clear the cache and cache statisticsNrF)clearr$)rrrrrrKr$r% cache_clearzs z'_lru_cache_wrapper..cache_clear)rArr__len__rrr)rrrrrrrr$)rrrrrrrrrrrrrrrKrrrr%rs* *9 r)rcCsg}dd|D}|s|S|D]2}|d}|D]}||ddkr.d}qq.qRq|dkrbtd|||D]}|d|krp|d=qpqdS)zMerges MROs in *sequences* to a single MRO using the C3 algorithm. Adapted from http://www.python.org/download/releases/2.3/mro/. cSsg|] }|r|qSr$r$rBsr$r$r% sz_c3_merge..rrNzInconsistent hierarchy) RuntimeErrorappend) sequencesrs1 candidates2seqr$r$r% _c3_merges"  rNc stt|jD]$\}tdrt|j|}q8qd}rDtngt|jd|}g}t|j|d}D]0t|rttfdd|jDst|qt|D] qfdd|D}fdd|D}fd d|D} t |gg||| |g|g|gS) aComputes the method resolution order using extended C3 linearization. If no *abcs* are given, the algorithm works exactly like the built-in C3 linearization used for method resolution. If given, *abcs* is a list of abstract base classes that should be inserted into the resulting MRO. Unrelated ABCs are ignored and don't end up in the result. The algorithm inserts ABCs where their functionality is introduced, i.e. issubclass(cls, abc) returns True for the class itself but returns False for all its direct base classes. Implicit ABCs for a given class (either registered or inferred from the presence of a special method like __len__) are inserted directly after the last ABC explicitly listed in the MRO of said class. If two implicit ABCs end up next to each other in the resulting MRO, their ordering depends on the order of types in *abcs*. __abstractmethods__rNc3s|]}t|VqdSr@) issubclass)rBb)baser$r%rnsz_c3_mro..csg|]}t|dqSabcs_c3_mrorBrrr$r%rsz_c3_mro..csg|]}t|dqSrrrrr$r%rscsg|]}t|dqSrrrrr$r%rs) enumeratereversed __bases__rerlistranyrremover) rEriboundaryexplicit_basesabstract_bases other_basesexplicit_c3_mrosabstract_c3_mros other_c3_mrosr$)rrr%rsD   rcstjfddfddDfddfddDtg}D]}g}|D]0}|krht|rh|fdd|jDqh|s||qX|jtd d |D] }|D]}||kr||qqqXt|d S) zCalculates the method resolution order for a given class *cls*. Includes relevant abstract base classes (with their respective bases) from the *types* iterable. Uses a modified C3 linearization algorithm. cs|kot|dot|S)N__mro__)rer)typ)basesrEr$r% is_relatedsz _compose_mro..is_relatedcsg|]}|r|qSr$r$rBn)rr$r%rsz _compose_mro..cs&D]}||kr||jkrdSqdS)NTF)r)rr+)typesr$r%is_strict_basesz$_compose_mro..is_strict_basecsg|]}|s|qSr$r$r)rr$r%rscsg|]}|kr|qSr$r$r)type_setr$r%rsT)rreverser)setr__subclasses__rrsortrr)rErmrorfoundsubsubclsr$)rrErrrrr% _compose_mros*    rcCstt||}d}|D]R}|dk r\||krX||jkrX||jkrXt||sXtd||qj||kr|}q||S)a^Returns the best matching implementation from *registry* for type *cls*. Where there is no registered implementation for a specific type, its method resolution order is used to find a more generic implementation. Note: if *registry* does not contain an implementation for the base *object* type, this function may return None. NzAmbiguous dispatch: {} or {})rkeysrrrrr)rEregistryrmatchtr$r$r% _find_impls" r csddl}ddl}i|dfddd fdd fdd}t|d d |t<|_|_||_j |_ t |||S) akSingle-dispatch generic function decorator. Transforms a function into a generic function, which can have different behaviours depending upon the type of its first argument. The decorated function acts as the default implementation, and additional implementations can be registered using the register() attribute of the generic function. rNc s|dk r"t}|kr"|z |}WnHtk rvz |}Wntk rht|}YnX||<YnX|S)zgeneric_func.dispatch(cls) -> Runs the dispatch algorithm to return the best available implementation for the given *cls* registered on *generic_func*. N)rrKeyErrorr )rE current_tokenimpl) cache_tokendispatch_cacherr$r%dispatch.s  z singledispatch..dispatchcs|dkrttr fddStdi}|s@tdd}ddlm}tt||\}ttstd |d d |<dkrt d rt  |S) zgeneric_func.register(cls, func) -> func Registers a new implementation for the given *cls* on a *generic_func*. Ncs |Sr@r$)f)rEregisterr$r%Nz2singledispatch..register..rz(Invalid first argument to `register()`: zS. Use either `@register(some_class)` or plain `@register` on an annotated function.r)get_type_hintszInvalid annotation for z. z is not a class.r) rrwrr]typingrr[rYryrerr)rEr`annrargname)rrrrrDr%rEs(     z singledispatch..registercs&|std|dj||S)Nz( requires at least 1 positional argumentr)r]ri)rakw)rfuncnamer$r%rfszsingledispatch..wrapperrzsingledispatch function)N) rweakrefWeakKeyDictionaryrrArrMappingProxyTyperr _clear_cacher)r`rrrr$)rrrrrrr%r s !   c@s8eZdZdZddZd ddZd ddZed d ZdS) r zSingle-dispatch generic method descriptor. Supports wrapping existing descriptors and handles non-descriptor callables as instance methods. cCs4t|s t|ds t|dt||_||_dS)Nrz is not callable or a descriptor)rdrer]r dispatcherr`r*r`r$r$r%rPs zsingledispatchmethod.__init__NcCs|jj||dS)zgeneric_method.register(cls, func) -> func Registers a new implementation for the given *cls* on a *generic_method*. r)rr)r*rEmethodr$r$r%rszsingledispatchmethod.registercs0fdd}j|_j|_t|j|S)Ncs$j|dj}|||SrQ)rrrir)rakwargsr!rErNr*r$r%rsz-singledispatchmethod.__get__.._method)rrrr`)r*rNrErr$r#r%rs  zsingledispatchmethod.__get__cCst|jddSrrr}r$r$r%rsz)singledispatchmethod.__isabstractmethod__)N)N) rrrrrPrrrrr$r$r$r%r xs   c@s&eZdZddZddZdddZdS) r cCs ||_d|_|j|_t|_dSr@)r`attrnamerrrr r$r$r%rPszcached_property.__init__cCs8|jdkr||_n"||jkr4td|jd|ddS)Nz?Cannot assign the same cached_property to two different names (z and z).)r$r])r*ownernamer$r$r% __set_name__s   zcached_property.__set_name__Nc Cs|dkr |S|jdkrtdz |j}Wn8tk r`dt|jd|jd}t|dYnX||jt}|tkr|jn||jt}|tkr| |}z|||j<Wn8tk rdt|jd|jd}t|dYnXW5QRX|S)NzGCannot use cached_property instance without calling __set_name__ on it.zNo '__dict__' attribute on z instance to cache z property.zThe '__dict__' attribute on z7 instance does not support item assignment for caching ) r$r]rrrwrr _NOT_FOUNDrr`)r*instancer%rmsgvalr$r$r%rs2   zcached_property.__get__)N)rrrrPr'rr$r$r$r%r s )rF)N)9r__all__abcr collectionsrreprlibr_threadrrrrrr,r.r/r0r3r4r5r8r9r:r=r>r?rGrr _functools ImportErrorrArZrr r rrrrrstrrrwrrrrrrrr r r r(r r$r$r$r%s                    AX   ,t -)\(