⚝
One Hat Cyber Team
⚝
Your IP:
216.73.216.177
Server IP:
50.6.168.112
Server:
Linux server-617809.webnetzimbabwe.com 5.14.0-570.25.1.el9_6.x86_64 #1 SMP PREEMPT_DYNAMIC Wed Jul 9 04:57:09 EDT 2025 x86_64
Server Software:
Apache
PHP Version:
8.4.10
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
opt
/
alt
/
python311
/
lib64
/
python3.11
/
__pycache__
/
View File Name :
functools.cpython-311.pyc
Yw3 d Z g dZddlmZ ddlmZ ddlmZ ddlm Z ddl m Z dZ d Z e e fd Ze e fd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zdefdefdefgdefdefdefgdefdefdefgdefdefdefgd Z d Z d Z dd l m Z n # e $ r Y nw xY w e! Z"e"fd Z# dd!l m#Z# n # e $ r Y nw xY w G d" d# Z$ dd$l m$Z$ n # e $ r Y nw xY w G d% d&e! Z%d' Z& ed(g d) Z' G d* d+e( Z) e! fe*e+he,e-e.fd,Z/d=d/Z0d0 Z1 dd1l m1Z1 n # e $ r Y nw xY wd2 Z2d3 Z3d>d5Z4d6 Z5d7 Z6d8 Z7 G d9 d: Z8 e! Z9 G d; d< Z:d4S )?zEfunctools.py - Tools for working with functions and callable objects )update_wrapperwrapsWRAPPER_ASSIGNMENTSWRAPPER_UPDATEStotal_orderingcache cmp_to_key lru_cachereducepartial partialmethodsingledispatchsingledispatchmethodcached_property )get_cache_token) namedtuple)recursive_repr)RLock) GenericAlias) __module____name__ __qualname____doc____annotations__)__dict__c |D ]4} t || }t | || %# t $ r Y 1w xY w|D ]4}t | | t ||i 5|| _ | S )a Update 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) )getattrsetattrAttributeErrorupdate __wrapped__)wrapperwrappedassignedupdatedattrvalues 0/opt/alt/python311/lib64/python3.11/functools.pyr r # s * * *GT**E GT5 ) ) ) ) D B B %%ggtR&@&@AAAA "G Ns ( 55c 2 t t | || S )a Decorator 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(). r# r$ r% )r r r* s r( r r A s$ >7 $g 7 7 7 7 c p t | | | }|t u r|S | o| |k S )zIReturn a > b. Computed by @total_ordering from (not a < b) and (a != b).type__lt__NotImplementedselfother op_results r( _gt_from_ltr5 Y ? T !!$..IN""= *TU]*r+ c n t | | | }|t u r|S |p| |k S )zEReturn a <= b. Computed by @total_ordering from (a < b) or (a == b).r- r1 s r( _le_from_ltr8 ` = T !!$..IN"" % %r+ c d t | | | }|t u r|S | S )z=Return a >= b. Computed by @total_ordering from (not a < b).r- r1 s r( _ge_from_ltr; g 6 T !!$..IN""=r+ c p t | | | }|t u r|S | p| |k S )zJReturn a >= b. Computed by @total_ordering from (not a <= b) or (a == b).r. __le__r0 r1 s r( _ge_from_ler@ n ? T !!$..IN""= )DEM)r+ c n t | | | }|t u r|S |o| |k S )zFReturn a < b. Computed by @total_ordering from (a <= b) and (a != b).r> r1 s r( _lt_from_lerC u = T !!$..IN"" & &r+ c d t | | | }|t u r|S | S )z=Return a > b. Computed by @total_ordering from (not a <= b).r> r1 s r( _gt_from_lerF | r< r+ c p t | | | }|t u r|S | o| |k S )zIReturn a < b. Computed by @total_ordering from (not a > b) and (a != b).r. __gt__r0 r1 s r( _lt_from_gtrJ r6 r+ c n t | | | }|t u r|S |p| |k S )zEReturn a >= b. Computed by @total_ordering from (a > b) or (a == b).rH r1 s r( _ge_from_gtrL r9 r+ c d t | | | }|t u r|S | S )z=Return a <= b. Computed by @total_ordering from (not a > b).rH r1 s r( _le_from_gtrN r< r+ c p t | | | }|t u r|S | p| |k S )zJReturn a <= b. Computed by @total_ordering from (not a >= b) or (a == b).r. __ge__r0 r1 s r( _le_from_gerR rA r+ c n t | | | }|t u r|S |o| |k S )zFReturn a > b. Computed by @total_ordering from (a >= b) and (a != b).rP r1 s r( _gt_from_gerT rD r+ c d t | | | }|t u r|S | S )z=Return a < b. Computed by @total_ordering from (not a >= b).rP r1 s r( _lt_from_gerV r< r+ rI r? rQ r/ )r/ r? rI rQ c fdt D }|st d t | }t | D ]!\ }}||vr||_ t || " S )z6Class decorator that fills in missing ordering methodsc b h | ]+}t |d t t |d u)|,S N)r object).0opclss r( <setcomp>z!total_ordering.<locals>.<setcomp> s= ^ ^ ^Bgc2t&<&<GFTVX\D]D]&]&]R&]&]&]r+ z6must define at least one ordering operation: < > <= >=)_convert ValueErrormaxr r )r] rootsrootopnameopfuncs ` r( r r s _ ^ ^ ^( ^ ^ ^E SQRRR u::D"4. ) ) $FO C ( ( ( Jr+ c 2 G fddt }|S )z,Convert a cmp= function into a key= functionc R e Zd ZdgZd Z fdZ fdZ fdZ fdZ fdZ dZ dS ) cmp_to_key.<locals>.Kobjc || _ d S rY ri )r2 ri s r( __init__z cmp_to_key.<locals>.K.__init__ s DHHHr+ c 8 | j |j dk S Nr rk r2 r3 mycmps r( r/ z cmp_to_key.<locals>.K.__lt__ 559--1 1r+ c 8 | j |j dk S rn rk ro s r( rI z cmp_to_key.<locals>.K.__gt__ rq r+ c 8 | j |j dk S rn rk ro s r( __eq__z cmp_to_key.<locals>.K.__eq__ 559--2 2r+ c 8 | j |j dk S rn rk ro s r( r? z cmp_to_key.<locals>.K.__le__ ru r+ c 8 | j |j dk S rn rk ro s r( rQ z cmp_to_key.<locals>.K.__ge__ ru r+ N) r r r __slots__rl r/ rI rt r? rQ __hash__)rp s r( Krh s G 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3r+ rz )rZ )rp rz s ` r( r r s> F Hr+ )r c t | }|t u r/ t | }n # t $ r t d dw xY w|}|D ]} | || }|S )a reduce(function, iterable[, initial]) -> value Apply a function of two arguments cumulatively to the items of a sequence or iterable, from left to right, so as to reduce the iterable 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 iterable in the calculation, and serves as a default when the iterable is empty. z0reduce() of empty iterable with no initial valueN)iter_initial_missingnext StopIteration TypeError)functionsequenceinitialitr' elements r( r r s h B""" NHHEE N N NBD DIM N N ) )(( Ls * A)r c ^ e Zd ZdZdZ fdZd Z e d Zd Z d Z xZ S )r zSNew function with partial application of the given arguments and keywords. )funcargskeywordsr __weakref__c t | st d t |d r |j |z }i |j |}|j }t t | | }||_ ||_ ||_ |S )Nz#the first argument must be callabler ) callabler hasattrr r r superr __new__)r] r r r r2 __class__s r( r zpartial.__new__ s ~~ C ABB B 4 9t#D4$-484H9DWc""**3// r+ c F i | j |} | j g | j |R i |S rY r r r )r2 r r s r( __call__zpartial.__call__+ s: 0dm0x0ty7$)7d777h777r+ c t | j }t | j g}| d | j D | d | j D t | j dk r d| dd | dS | dd | dS )Nc 3 4 K | ]}t | V d S rY )repr)r[ xs r( <genexpr>z#partial.__repr__.<locals>.<genexpr>3 s( //DGG//////r+ c 3 * K | ]\ }}| d |V dS )=N r[ kvs r( r z#partial.__repr__.<locals>.<genexpr>4 s0 EEVaqLL1LLEEEEEEr+ functoolsz functools.(, )) r. r r r extendr r itemsr join)r2 qualnamer s r( __repr__zpartial.__repr__/ s ::*TY //TY////// EEt}/B/B/D/DEEEEEE :: K / /===499T??=== =//TYYt__////r+ c j t | | j f| j | j | j pd | j pd ffS rY )r. r r r r r2 s r( __reduce__zpartial.__reduce__9 s; DzzDI<$)TY}$dm&;t*= = =r+ c 4 t |t st d t | dk r t dt | |\ }}}}t | rCt |t r.|t |t r|$t |t st d t | }|i }n%t | t urt | }|i }|| _ || _ || _ || _ d S )Nz(argument to __setstate__ must be a tuple z expected 4 items in state, got zinvalid partial state) isinstancetupler lenr dictr. r r r r )r2 stater r kwds namespaces r( __setstate__zpartial.__setstate__= s %'' H FGG G u::?? Jc%jj J JKK K&+#dD) 5ju&=&= 5 Zd%;%; !*Y*E*E ! 344 4T{{ <DD $ZZt # #::D I! r+ ) r r r r rx r r r r r r __classcell__)r s @r( r r s FI 8 8 8 ^0 0 0= = = r+ r )r c X e Zd ZdZd Zd Zd ZddZed Z e e Z dS ) r zMethod descriptor with partial application of the given arguments and keywords. Supports wrapping existing descriptors and handles non-descriptor callables as instance methods. c 6 t | s2t |d s"t d | t |t r-|j | _ |j |z | _ i |j || _ d S || _ || _ || _ d S )N__get__z${!r} is not callable or a descriptor) r r r formatr r r r r )r2 r r r s r( rl zpartialmethod.__init__c s ~~ 0gdI&>&> 0 B"(&,,0 0 0 dM * * % DI D(DI 9t} 9 9DMMM DI DI $DMMMr+ c 2 d t t | j }d d | j D }d}| | j j | j j | j || S )Nr c 3 H K | ] \ }}d || V dS )z{}={!r}N)r r s r( r z)partialmethod.__repr__.<locals>.<genexpr>x sR D D%)Q ' - -a 3 3 D D D D D Dr+ z*{module}.{cls}({func}, {args}, {keywords}))moduler] r r r ) r mapr r r r r r r r r )r2 r r format_strings r( r zpartialmethod.__repr__v s yyT49--..99 D D-1]-@-@-B-B D D D D DD ##4>+D(,(C)-)--5 $ 7 7 7r+ c 8 fd} j |_ |_ |S )Nc J i j |} j | gj |R i |S rY r ) cls_or_selfr r r2 s r( _methodz3partialmethod._make_unbound_method.<locals>._method s= 4$-484H 49[H49HtHHHxHH Hr+ )__isabstractmethod___partialmethod)r2 r s ` r( _make_unbound_methodz"partialmethod._make_unbound_method s; I I I I I (,'@$!% r+ Nc ( t | j dd }d }|M ||| }|| j ur8t |g| j R i | j } |j |_ n# t $ r Y nw xY w|(| || }|S )Nr ) r r r r r __self__r r r )r2 ri r] getresultnew_funcs r( r zpartialmethod.__get__ s diD11 ?s3}}Hty(( !GDIGGG GG&.&7FOO% D > ..0088cBBF s A A%$A%c . t | j dd S Nr Fr r r s r( r z"partialmethod.__isabstractmethod__ ty"8%@@@r+ rY ) r r r r rl r r r propertyr classmethodr __class_getitem__r r+ r( r r [ s % % %& 7 7 7 & A A XA $ L11r+ r c h t | t r | j } t | t | S rY )r r r r s r( _unwrap_partialr s4 T7 # # y T7 # # Kr+ CacheInfo)hitsmissesmaxsizecurrsizec & e Zd ZdZdZefdZd ZdS ) _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. hashvaluec 4 || d d < || | _ d S rY r )r2 tuphashs r( rl z_HashedSeq.__init__ s" QQQ cr+ c | j S rY r r s r( ry z_HashedSeq.__hash__ s ~ r+ N)r r r r rx r rl ry r r+ r( r r sK I!% # # # # r+ r c V | }|r!||z }| D ]} || z }|rI| |fd| D z }|r,| |fd| D z }n* || dk r |d |v r|d S t | S )a Make 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. c 3 . K | ]} | V d S rY r r[ r r. s r( r z _make_key.<locals>.<genexpr> s+ ++TT!WW++++++r+ c 3 . K | ]} | V d S rY r r s r( r z _make_key.<locals>.<genexpr> s+ 88Qa888888r+ r )r valuesr ) r r typedkwd_mark fasttypesr r. r keyitems ` r( _make_keyr s $ C xJJLL D 4KCC uu++++d++++++ 9 558888$++--88888 8C SQ 44A<<9441v c??r+ Fc * t t r dk rd nlt rLt t r7 dc} t | t } fd|_ t || S t d fd}|S )a Least-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: https://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU) r r c dS Nr r r r s r( <lambda>zlru_cache.<locals>.<lambda> %,P,P r+ Nz=Expected first argument to be an integer, a callable, or Nonec h t | t }fd|_ t || S )Nc dS r r r s r( r z8lru_cache.<locals>.decorating_function.<locals>.<lambda> r r+ )_lru_cache_wrapper _CacheInfocache_parametersr ) user_functionr" r r s r( decorating_functionz&lru_cache.<locals>.decorating_function s: $]GUJOO#P#P#P#P#P g}555r+ ) r intr boolr r r r r )r r r r" r s `` r( r r s 2 '3 M Q;;G ' Mz% 6 6 M!(# w$]GUJOO#P#P#P#P#P g}555 KM M M6 6 6 6 6 6 r+ c h t t d\ i dxd j j t g d d gd d < dk r fd}n# fd}n fd} fd} fd}||_ ||_ |S ) N)r r r Fc " dz | i |}|S Nr r )r r r r r s r( r" z#_lru_cache_wrapper.<locals>.wrapper s' aKF"]D1D11FMr+ c t | | } | }| urdz |S dz | i |}||< |S r r ) r r r r r cache_getr make_keyr sentinelr r s r( r" z#_lru_cache_wrapper.<locals>.wrapper' sm (4u--C YsH--FX%% aKF"]D1D11F E#JMr+ c | | }5 | }|@|\ }}}}|| < ||< }|x| < < ||< | < dz |cd d d S dz d d d n # 1 swxY w Y | i |}5 |v rndr7} || < || < | } } d x < < | = | |< n+ }|||g}|x| < x< |< k d d d n # 1 swxY w Y |S r r ) r r r link link_prev link_next_keyr lastoldrootoldkey oldresultKEYNEXTPREVRESULTr r cache_lenfullr lockr r r rc r r s r( r" z#_lru_cache_wrapper.<locals>.wrapper6 sB (4u--C y~~#9=6Iy$&/IdO&/IdO :D.22DJd!%DJ!%DJAID! ! #]D1D11F # 4 # 4%<< 4 "G#&GCL&,GFO #4=D !#YF $V I/33DIV f ")E#JJ :D $V4D;??DJ?deCj &IKK7 2DG# 4 # 4 # 4 # 4 # 4 # 4 # 4 # 4 # 4 # 4 # 4 # 4 # 4 # 4 # 4H Ms+ AA0 A00A47A4A*C;;C?C?c h 5 cddd S # 1 swxY w Y dS )zReport cache statisticsNr )r r r r r r s r( cache_infoz&_lru_cache_wrapper.<locals>.cache_infoo s B B :dFGYY[[AA B B B B B B B B B B B B B B B B B Bs '++c 5 ddgdd< dxdddd dS # 1 swxY w Y dS )z$Clear the cache and cache statisticsNr F)clear)r r r r r rc s r( cache_clearz'_lru_cache_wrapper.<locals>.cache_cleart s KKMMMT4.DG D6D s &7;;)rZ r r __len__r r r )r r r r r" r r r r r r r r r r r r r r rc r s ```` @@@@@@@@@@@@@@r( r r s xxHH (D$V ED6 D I I 77D DT4&DG!|| 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 rB B B B B B B B B B $G%G Nr+ )r c 4 t d | S )z@Simple lightweight unbounded cache. Sometimes called "memoize".N)r )r )r s r( r r s "9T " " "= 1 11r+ c g } d | D } | s|S | D ]!}|d }| D ]}||dd v rd} n n"|t d | | | D ]}|d |k r|d= o)zMerges MROs in *sequences* to a single MRO using the C3 algorithm. Adapted from https://www.python.org/download/releases/2.3/mro/. Tc g | ]}||S r r )r[ ss r( <listcomp>z _c3_merge.<locals>.<listcomp> s ///1Q/Q///r+ r r NzInconsistent hierarchy) RuntimeErrorappend) sequencesr s1 candidates2seqs r( _c3_merger) s F// /// M B1I 122&& $IE ' 788 8 i C1v""F%r+ Nc t t | j D ].\ } t d rt | j |z } n/d}rt ng t | j d| }g }t | j |d }D ]G t | r5t fd| j D s| H|D ] fd|D }fd|D }fd|D } t | gg|z |z | z |gz |gz |gz S )a Computes 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__r Nc 3 8 K | ]}t | V d S rY ) issubclass)r[ bbases r( r z_c3_mro.<locals>.<genexpr> s> - -() 1d##- - - - - -r+ c 2 g | ]}t | S abcs_c3_mror[ r/ r3 s r( r! z_c3_mro.<locals>.<listcomp> & LLLT4000LLLr+ c 2 g | ]}t | S r1 r4 r6 s r( r! z_c3_mro.<locals>.<listcomp> r7 r+ c 2 g | ]}t | S r1 r4 r6 s r( r! z_c3_mro.<locals>.<listcomp> s& FFF$WT---FFFr+ ) enumeratereversed __bases__r r listr- anyr# remover) ) r] r3 iboundaryexplicit_basesabstract_bases other_basesexplicit_c3_mrosabstract_c3_mros other_c3_mrosr/ s ` @r( r5 r5 s " Xcm 4 455 4 4. / / 3=))A-H E %4:::2D#- 233NNs}XYY/00K ( ( c4 ( - - - --0]- - - * * ( ! !$ ' ' ' DLLLL^LLLLLLL^LLLFFFF+FFFM + ,.; < *+ ,/:m < r+ c & t j fdfdD fd fdD t g }D ]}g }| D ]<}|vr6t | r&| fd|j D =|s| | m| t d |D ] }|D ]}||vr| | !t | 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. c x | vo5t | d o%t | t ot | S )N__mro__)r r r r- )typbasesr] s r( is_relatedz _compose_mro.<locals>.is_related sH 5 :WS)%<%< :)3C )F)F%F:%/S%9%9 ;r+ c * g | ]} | |S r r )r[ nrM s r( r! z _compose_mro.<locals>.<listcomp> s& / / /1A /Q / / /r+ c 6 D ]}| |k r | |j v r dS dS )NTF)rJ )rK r3 typess r( is_strict_basez$_compose_mro.<locals>.is_strict_base s4 Ee||u} 4 4ttur+ c * g | ]} | |S r r )r[ rO rR s r( r! z _compose_mro.<locals>.<listcomp> s( 7 7 71^^A%6%6 7Q 7 7 7r+ c g | ]}|v | S r r )r[ r type_sets r( r! z _compose_mro.<locals>.<listcomp> s F F FAX a r+ T)r reverser2 )setrJ __subclasses__r- r# sortr r5 ) r] rQ mrorK foundsubsubclsrL rM rR rU s `` @@@@r( _compose_mror^ s E; ; ; ; ; ; 0 / / / / / /E 8 7 7 7 7 7 7E 5zzH C ' '%%'' H HC% JsC$8$8 F F F F F F FGGG JJsOOO sD ))) ' 'C ' '$$JJv&&& ' ' 3S ! ! !!r+ c $ t | | }d}|D ]U}|K||v rE|| j vr<|| j vr3t || s#t d || n||v r|}V| | 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. Nz Ambiguous dispatch: {} or {})r^ keysrJ r- r" r r )r] registryrZ matchts r( _find_implrd s sHMMOO , ,C E X !3;"6"6"'s{":":&0&:&: #;"#A#H#H1$ $ E ==E << r+ c Z ddl ddl}i | d fd fdfdd fd fd}t | dd | t < |_ |_ |_ j |_ t || |S ) ak Single-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. r Nc *t }|k r | | }n?# t $ r2 | }n # t $ r t | }Y nw xY w|| < Y nw xY w|S )zgeneric_func.dispatch(cls) -> <function implementation> Runs the dispatch algorithm to return the best available implementation for the given *cls* registered on *generic_func*. )r r KeyErrorrd )r] current_tokenimpl cache_tokendispatch_cachera s r( dispatchz singledispatch.<locals>.dispatch2 s " + - -Mm++ $$&&& + '!#&DD ' ' ' 1 } 1 1 1!#x00 1"&N3 ' s3 8 A4A A4 A)&A4(A))A43A4c < ddl m}m} || |j hv S )Nr ) get_originUnion)typingrn ro UnionType)r] rn ro rQ s r( _is_union_typez&singledispatch.<locals>._is_union_typeI s5 ,,,,,,,,z#5%/":::r+ c t | t rdS ddlm} | o!t d || D S )NTr get_argsc 3 @ K | ]}t |t V d S rY )r r. )r[ args r( r zBsingledispatch.<locals>._is_valid_dispatch_type.<locals>.<genexpr>R s, CCcJsD))CCCCCCr+ )r r. rp ru all)r] ru rr s r( _is_valid_dispatch_typez/singledispatch.<locals>._is_valid_dispatch_typeM sg c4 4###### s## DCCXXc]]CCCCC Er+ c l r | fdS n|t d d t di }|st d d }dd lm} t t || \ } s7 rt d |d d t d |d d rddlm} | D ]}| |< n| < t d rt |S )zgeneric_func.register(cls, func) -> func Registers a new implementation for the given *cls* on a *generic_func*. Nc | S rY r )fr] registers r( r z2singledispatch.<locals>.register.<locals>.<lambda>] s #q!1!1 r+ z(Invalid first argument to `register()`. z is not a class or union type.r z(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 not all arguments are classes.z is not a class.rt r+ ) r r rp r~ r~ r| r ru r r r ) r] r annr~ argnameru rw rr ry rj rk r} ra s ` r( r} z singledispatch.<locals>.registerT s # "3 ' ' |111111 == = = # 0"55C 1s 1 1 1 D . - - - - - ^^D%9%9%?%?%A%A B BCCLGS**3// !>#&& #B' B B B B B $3' 3 3 3 3 3 ># ! ' ' ' ' ' ' x}} % % $ % !HSM 730E#F#F )++K r+ c d | st d | d j | i |S )Nz( requires at least 1 positional argumentr )r r )r kwrl funcnames r( r" z singledispatch.<locals>.wrapper sV 5x 4 4 4 5 5 5 +xxQ)**D7B777r+ r zsingledispatch functionrY ) rQ weakrefWeakKeyDictionaryr rZ r} rl MappingProxyTypera r _clear_cacher ) r r r" rr ry rj rl rk r r} ra rQ s @@@@@@@@@r( r r sT H ..00NK .; ; ; ; ;E E E E E2 2 2 2 2 2 2 2 2 2 2h8 8 8 8 8 8 tZ)BCCHHV G G --h77G)/G7D!!! Nr+ c > e Zd ZdZd ZddZddZed ZdS )r zSingle-dispatch generic method descriptor. Supports wrapping existing descriptors and handles non-descriptor callables as instance methods. c t | s"t |d st |d t | | _ || _ d S )Nr z is not callable or a descriptor)r r r r dispatcherr r2 r s r( rl z singledispatchmethod.__init__ sT ~~ IgdI&>&> It G G GHH H(.. r+ Nc : | j || S )zgeneric_method.register(cls, func) -> func Registers a new implementation for the given *cls* on a *generic_method*. r )r r} )r2 r] methods r( r} z singledispatchmethod.register s ''&'999r+ c t fd} j |_ j |_ t | j |S )Nc j | d j } | | i |S rn )r rl r r )r kwargsr r] ri r2 s r( r z-singledispatchmethod.__get__.<locals>._method sB _--d1g.?@@F+6>>#s++T<V<< <r+ )r r} r r )r2 ri r] r s ``` r( r z singledispatchmethod.__get__ sV = = = = = = = (,'@$ =w ***r+ c . t | j dd S r r r s r( r z)singledispatchmethod.__isabstractmethod__ r r+ rY ) r r r r rl r} r r r r r+ r( r r su : : : : A A XA A Ar+ r c 8 e Zd Zd Zd ZddZ ee ZdS )r c ` || _ d | _ |j | _ t | _ d S rY )r attrnamer r r r s r( rl zcached_property.__init__ s( | GG r+ c r | j || _ d S || j k rt d| j d|d d S )Nz?Cannot assign the same cached_property to two different names (z and z).)r r )r2 ownernames r( __set_name__z cached_property.__set_name__ sb = DMMM T] " "5M5 5*.5 5 5 # "r+ Nc h || S | j t d |j }n># t $ r1 dt | j d| j d}t | d w xY w| | j t }|t u r| j 5 | | j t }|t u r_| | } ||| j < n># t $ r1 dt | j d| j d}t | d w xY wd d d n # 1 swxY w Y |S )NzGCannot use cached_property instance without calling __set_name__ on it.zNo '__dict__' attribute on z instance to cache z property.z The '__dict__' attribute on z7 instance does not support item assignment for caching ) r r r r r. r r _NOT_FOUNDr r )r2 instancer r msgvals r( r zcached_property.__get__ s K = Y[ [ [ + %EE + + +Ad8nn.E A A%)]A A A C..d * + ii z22 * 7 7ii z::*$$ ))H--C7/2dm,,$ 7 7 7 h4>>;R h hLPM h h h (nn$6 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 s3 $ ;A ?D' C D' ;DD''D+.D+rY ) r r r rl r r r r r r r+ r( r r sT > $ L11r+ r )r FrY );r __all__abcr collectionsr reprlibr _threadr rQ r r r r r r5 r8 r; r@ rC rF rJ rL rN rR rT rV r_ r r _functools ImportErrorrZ r} r r r r r r= r r strr r. r r r r r r) r5 r^ rd r r r r r r+ r( <module>r s " " " " " " " " " " " " * 2 , > )# 7 7 7 70+ + +& & & * * *' ' ' + + +& & & * * *' ' ' +&+&+&( +&+&+&( +&+&+&( +&+&+&( $ & %%%%%%% D 688 '7 8 !!!!!!! D ? ? ? ? ? ? ? ? B """"""" D E2 E2 E2 E2 E2F E2 E2 E2T Z %N%N%N O O " st >, , , , \r r rh ------- D 2 2 2 6+ + + +Z(" (" ("T 4v v vt!A !A !A !A !A !A !A !AP VXX /2 /2 /2 /2 /2 /2 /2 /2 /2 /2sH B BB-B4 4B<;B< C C C (D/ /D76D7