⚝
One Hat Cyber Team
⚝
Your IP:
216.73.216.30
Server IP:
45.79.8.107
Server:
Linux localhost 5.15.0-140-generic #150-Ubuntu SMP Sat Apr 12 06:00:09 UTC 2025 x86_64
Server Software:
nginx/1.18.0
PHP Version:
8.1.2-1ubuntu2.21
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
lib
/
python3.10
/
__pycache__
/
View File Name :
functools.cpython-310.pyc
o }5h @ s d Z g dZddlmZ ddlmZ ddlmZ ddlm Z ddl m Z dZ d Z e e fd d Ze e fd d ZefddZefddZefddZefddZefddZefddZefddZefd d Zefd d Zefd d!Zefd"d#Zefd$d%Z d&efd'efd(efgd(efd)efd&efgd)efd(efd'efgd'efd&efd)e fgd*Z d+d, Z d-d. Z zdd/l m Z W n e!y Y nw e" Z#e#fd0d1Z$zdd2l m$Z$ W n e!y Y nw G d3d4 d4Z%zdd5l m%Z% W n e!y Y nw G d6d7 d7e"Z&d8d9 Z'ed:g d;Z(G d<d= d=e)Z*e" fe+e,he-e.e/fd>d?Z0dXdBdCZ1dDdE Z2zddFl m2Z2 W n e!y; Y nw dGdH Z3dIdJ Z4dYdLdMZ5dNdO Z6dPdQ Z7dRdS Z8G dTdU dUZ9e" Z:G dVdW dWZ;dKS )ZzEfunctools.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 C sd |D ]}zt ||}W n ty Y qw t| || q|D ]}t | |t ||i q || _| 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) )getattrAttributeErrorsetattrupdate __wrapped__)wrapperwrappedassignedupdatedattrvalue r& /usr/lib/python3.10/functools.pyr # s r c C s t t| ||dS )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( r& r& r' r A s r c C * t | | |}||u r|S | o| |kS )zIReturn a > b. Computed by @total_ordering from (not a < b) and (a != b).type__lt__selfotherNotImplemented op_resultr& r& r' _gt_from_ltY r2 c C ( t | | |}||u r|S |p| |kS )zEReturn a <= b. Computed by @total_ordering from (a < b) or (a == b).r* r- r& r& r' _le_from_lt` r5 c C " t | | |}||u r|S | S )z=Return a >= b. Computed by @total_ordering from (not a < b).r* r- r& r& r' _ge_from_ltg r8 c C * t | | |}||u r|S | p| |kS )zJReturn a >= b. Computed by @total_ordering from (not a <= b) or (a == b).r+ __le__r- r& r& r' _ge_from_len r3 r= c C ( t | | |}||u r|S |o| |kS )zFReturn a < b. Computed by @total_ordering from (a <= b) and (a != b).r; r- r& r& r' _lt_from_leu r6 r? c C r7 )z=Return a > b. Computed by @total_ordering from (not a <= b).r; r- r& r& r' _gt_from_le| r9 r@ c C r) )zIReturn a < b. Computed by @total_ordering from (not a > b) and (a != b).r+ __gt__r- r& r& r' _lt_from_gt r3 rC c C r4 )zEReturn a >= b. Computed by @total_ordering from (a > b) or (a == b).rA r- r& r& r' _ge_from_gt r6 rD c C r7 )z=Return a <= b. Computed by @total_ordering from (not a > b).rA r- r& r& r' _le_from_gt r9 rE c C r: )zJReturn a <= b. Computed by @total_ordering from (not a >= b) or (a == b).r+ __ge__r- r& r& r' _le_from_ge r3 rH c C r> )zFReturn a > b. Computed by @total_ordering from (a >= b) and (a != b).rF r- r& r& r' _gt_from_ge r6 rI c C r7 )z=Return a < b. Computed by @total_ordering from (not a >= b).rF r- r& r& r' _lt_from_ge r9 rJ rB r< rG r, )r, r< rB rG c sV fddt D }|stdt|}t | D ]\}}||vr(||_t || q S )z6Class decorator that fills in missing ordering methodsc s( h | ]}t |d t t|d ur|qS N)r object).0opclsr& r' <setcomp> s ( z!total_ordering.<locals>.<setcomp>z6must define at least one ordering operation: < > <= >=)_convert ValueErrormaxr r )rP rootsrootopnameopfuncr& rO r' r s r c s G fdddt }|S )z,Convert a cmp= function into a key= functionc sZ e Zd ZdgZdd Z fddZ fddZ fdd Z fd d Z fd d Z dZ dS )zcmp_to_key.<locals>.Kobjc S s || _ d S rK rY )r. rY r& r& r' __init__ s z cmp_to_key.<locals>.K.__init__c s | j |j dk S Nr rZ r. r/ mycmpr& r' r, z cmp_to_key.<locals>.K.__lt__c s | j |j dkS r\ rZ r] r^ r& r' rB r` z cmp_to_key.<locals>.K.__gt__c s | j |j dkS r\ rZ r] r^ r& r' __eq__ r` z cmp_to_key.<locals>.K.__eq__c s | j |j dkS r\ rZ r] r^ r& r' r< r` z cmp_to_key.<locals>.K.__le__c s | j |j dkS r\ rZ r] r^ r& r' rG r` z cmp_to_key.<locals>.K.__ge__N) r r r __slots__r[ r, rB ra r< rG __hash__r& r^ r& r' K s rd )rL )r_ rd r& r^ r' r s r )r c C sR t |}|tu rzt|}W n ty tddw |}|D ]}| ||}q |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% elementr& r& r' r s r )r c sJ e Zd ZdZdZ fddZdd Ze dd Zd d Z d d Z Z S ) r zSNew function with partial application of the given arguments and keywords. )funcargskeywordsr __weakref__c s^ t |stdt|dr |j| }i |j|}|j}tt| | }||_||_||_|S )Nz#the first argument must be callablero ) callableri hasattrrp rq ro superr __new__)rP ro rp rq r. __class__r& r' rv s zpartial.__new__c O s* i | j |}| jg | j|R i |S rK rq ro rp )r. rp rq r& r& r' __call__+ s zpartial.__call__c C s t | j}t| jg}|dd | jD |dd | j D t | jdkr6d| dd | dS | dd | dS ) Nc s s | ]}t |V qd S rK )repr)rM xr& r& r' <genexpr>3 z#partial.__repr__.<locals>.<genexpr>c s s" | ] \}}| d |V qdS )=Nr& rM kvr& r& r' r} 4 s functoolsz functools.(, )) r+ r r{ ro extendrp rq itemsr join)r. qualnamerp r& r& r' __repr__/ s zpartial.__repr__c C s* t | | jf| j| j| jpd | jpd ffS rK )r+ ro rp rq r r. r& r& r' __reduce__9 s zpartial.__reduce__c C s t |ts tdt|dkrtdt| |\}}}}t|r9t |tr9|d ur0t |tr9|d ur=t |ts=tdt|}|d u rHi }n t|turRt|}|d u rXi }|| _|| _|| _ || _ d S )Nz(argument to __setstate__ must be a tuple z expected 4 items in state, got zinvalid partial state) isinstancetupleri lenrs dictr+ r ro rp rq )r. statero rp kwds namespacer& r& r' __setstate__= s( zpartial.__setstate__) r r r r rb rv rz r r r r __classcell__r& r& rw r' r s r )r c @ sF e Zd ZdZdd Zdd Zdd Zd d d Zed d 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 O sh t |st|dstd|t|tr)|j| _|j| | _i |j|| _d S || _|| _|| _d S )N__get__z${!r} is not callable or a descriptor) rs rt ri formatr r ro rp rq )r. ro rp rq r& r& r' r[ c s zpartialmethod.__init__c C sN d tt| j}d dd | j D }d}|j| jj| jj | j ||dS )Nr c s s | ] \}}d ||V qdS )z{}={!r}N)r r r& r& r' r} x s z)partialmethod.__repr__.<locals>.<genexpr>z*{module}.{cls}({func}, {args}, {keywords}))modulerP ro rp rq ) r mapr{ rp rq r r rx r r ro )r. rp rq format_stringr& r& r' r v s zpartialmethod.__repr__c s fdd} j |_ |_|S )Nc s, i j |} j| g j|R i |S rK ry ) cls_or_selfrp rq r r& r' _method s z3partialmethod._make_unbound_method.<locals>._method)__isabstractmethod___partialmethod)r. r r& r r' _make_unbound_method s z"partialmethod._make_unbound_methodNc C s t | jdd }d }|d ur4|||}|| jur4t|g| jR i | j}z|j|_W n ty3 Y nw |d u r@| ||}|S )Nr ) r ro r rp rq __self__r r r )r. rY rP getresultnew_funcr& r& r' r s zpartialmethod.__get__c C t | jddS Nr Fr ro r r& r& r' r z"partialmethod.__isabstractmethod__rK ) r r r r r[ r r r propertyr classmethodr __class_getitem__r& r& r& r' r [ s r c C s t | tr | j} t | ts| S rK )r r ro ro r& r& r' _unwrap_partial s r CacheInfo)hitsmissesmaxsizecurrsizec @ s( e Zd ZdZdZefddZdd 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 C s || d d < ||| _ d S rK r )r. tuphashr& r& r' r[ s z_HashedSeq.__init__c C s | j S rK r r r& r& r' rc s z_HashedSeq.__hash__N)r r r r rb r r[ rc r& r& r& r' r s r c s | }|r||7 }| D ]} || 7 }q |r7|| fdd| D 7 }|r3|| fdd| D 7 }t|S ||dkrI |d |v rI|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 | ]} |V qd S rK r& rM r r+ r& r' r} r~ z _make_key.<locals>.<genexpr>c 3 r rK r& r r r& r' r} r~ r )r valuesr ) rp r typedkwd_mark fasttypesr r+ r keyitemr& r r' _make_key s r Fc s~ t tr dk r d n*t r.t tr. d} t| t} fdd|_t||S dur6td fdd}|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& r r& r' <lambda> zlru_cache.<locals>.<lambda>Nz=Expected first argument to be an integer, a callable, or Nonec s( t | t} fdd|_t|| S )Nc r r r& r& r r& r' r r z8lru_cache.<locals>.decorating_function.<locals>.<lambda>)_lru_cache_wrapper _CacheInfocache_parametersr ) user_functionr r r& r' decorating_function s z&lru_cache.<locals>.decorating_function) r intrs boolr r r r ri )r r r r r r& r r' r s r c s t t d\ i d djjt g d d gd d < dkr4 fdd}n' d u rF fdd}n fdd} fdd } fd d }||_||_|S ) N)r r r Fc s d7 | i |}|S Nr r& )rp r r )r r r& r' r s z#_lru_cache_wrapper.<locals>.wrapperc sL | |}|}|urd7 |S d7 | i |}| |< |S r r& )rp r r r )r cache_getr make_keyr sentinelr r r& r' r ' s c s | |} C |}|d ur@|\}}}}||< ||< }| |< < ||< |< d7 |W d S d7 W d n1 sNw Y | i |} a |v rbnKr } || < || < | } } d < < | = | |< n+ }| ||g}| |< < |< kW d |S W d |S W d |S 1 sw Y |S r r& ) rp r r link link_prev link_next_keyr lastoldrootoldkey oldresult)KEYNEXTPREVRESULTr r cache_lenfullr lockr r r rV r r r& r' r 6 sX $ $ $$c s8 W d S 1 sw Y dS )zReport cache statisticsNr& r& )r r r r r r r& r' cache_infoo s $z&_lru_cache_wrapper.<locals>.cache_infoc sR ddgdd< d dW d dS 1 s"w Y dS )z$Clear the cache and cache statisticsNr F)clearr& )r r r r r rV r& r' cache_cleart s "z'_lru_cache_wrapper.<locals>.cache_clear)rL 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 r r r rV r r r r' r s* *9 r )r c C s t dd| S )z@Simple lightweight unbounded cache. Sometimes called "memoize".N)r )r )r r& r& r' r r r c C s g } dd | D } | s|S | D ]}|d }| D ]}||dd v r&d} nq nq|du r2t d|| | D ] }|d |krD|d= q9q)zMerges MROs in *sequences* to a single MRO using the C3 algorithm. Adapted from https://www.python.org/download/releases/2.3/mro/. Tc S s g | ]}|r|qS r& r& rM sr& r& r' <listcomp> s z _c3_merge.<locals>.<listcomp>r r NzInconsistent hierarchy) RuntimeErrorappend) sequencesr s1 candidates2seqr& r& r' _c3_merge s, r Nc s t t| jD ]\}tdrt| j| } nqd} r"t ng t| jd| }g }t| j|d } D ]t| rRtfdd| jD sR| q:|D ] qU fdd|D } fdd|D } fd d|D } t | gg| | | |g |g |g 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 s | ]}t | V qd S rK ) issubclass)rM b)baser& r' r} s z_c3_mro.<locals>.<genexpr>c g | ]}t | d qS abcs_c3_mrorM r r r& r' r z_c3_mro.<locals>.<listcomp>c r r r r r r& r' r r c r r r r r r& r' r r ) enumeratereversed __bases__rt r listr anyr remover ) rP r iboundaryexplicit_basesabstract_bases other_basesexplicit_c3_mrosabstract_c3_mros other_c3_mrosr& )r r r' r sH r c s t j fddfddD fddfddD t g }D ]C}g }| D ]}| vrLt|rL|fdd|jD q4|sU|| q,|jtd d |D ]}|D ] }||vrm|| qbq^q,t|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. c s( | vot | dot| t ot| S )N__mro__)rt r r r )typ)basesrP r& r' is_related s z _compose_mro.<locals>.is_relatedc s g | ]} |r|qS r& r& rM n)r r& r' r r z _compose_mro.<locals>.<listcomp>c s& D ]}| |kr| |j v r dS qdS )NTF)r )r r/ )typesr& r' is_strict_base s z$_compose_mro.<locals>.is_strict_basec s g | ]} |s|qS r& r& r )r r& r' r r c s g | ]}| v r|qS r& r& r )type_setr& r' r r T)r reverser )setr __subclasses__r r sortr r )rP r mror foundsubsubclsr& )r rP r r r r r' _compose_mro s2 r c C st t | | }d}|D ])}|dur.||v r,|| jvr,|| jvr,t||s,td|| n||v r4|}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. Nz Ambiguous dispatch: {} or {})r keysr r r r r )rP registryr matchtr& r& r' _find_impl s r% c s ddl }ddl}i | dfdddd d fdd fd d }t| d d | 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 sx durt } |kr | z| }W |S ty; z| }W n ty3 t| }Y nw || < Y |S w )zgeneric_func.dispatch(cls) -> <function implementation> Runs the dispatch algorithm to return the best available implementation for the given *cls* registered on *generic_func*. N)r r KeyErrorr% )rP current_tokenimpl) cache_tokendispatch_cacher" r& r' dispatch2 s" z singledispatch.<locals>.dispatchc S s t | to t | t S rK )r r+ r rO r& r& r' _is_valid_dispatch_typeI s z/singledispatch.<locals>._is_valid_dispatch_typec s r|du r fddS n?|dur t d dt di }|s,t d d }d d lm} tt|| \} sOt d |d d| < du r_t d r_t |S )zgeneric_func.register(cls, func) -> func Registers a new implementation for the given *cls* on a *generic_func*. Nc s | S rK r& )f)rP registerr& r' r U r z2singledispatch.<locals>.register.<locals>.<lambda>z(Invalid first argument to `register()`. z is not a class.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. r ) ri r typingr/ rg re r rt r r )rP ro annr/ argname)r, r) r* r. r" rO r' r. L s: z singledispatch.<locals>.registerc s* | s t d | d j| i |S )Nz( requires at least 1 positional argumentr )ri rx )rp kw)r+ funcnamer& r' r t s z singledispatch.<locals>.wrapperr zsingledispatch functionrK ) r weakrefWeakKeyDictionaryr rL r. r+ MappingProxyTyper" r _clear_cacher )ro r r5 r r& )r, r) r+ r* r4 r. r" r' r s ( r c @ s8 e Zd ZdZdd Zd ddZd ddZed d ZdS ) r zSingle-dispatch generic method descriptor. Supports wrapping existing descriptors and handles non-descriptor callables as instance methods. c C s4 t |st|dst|dt|| _|| _d S )Nr z is not callable or a descriptor)rs rt ri r dispatcherro r. ro r& r& r' r[ s z singledispatchmethod.__init__Nc C s | j j||dS )zgeneric_method.register(cls, func) -> func Registers a new implementation for the given *cls* on a *generic_method*. r )r9 r. )r. rP methodr& r& r' r. s z singledispatchmethod.registerc s0 fdd}j |_ j|_t|j |S )Nc s( j | d j}| | i |S r\ )r9 r+ rx r )rp kwargsr; rP rY r. r& r' r s z-singledispatchmethod.__get__.<locals>._method)r r. r ro )r. rY rP r r& r= r' r s z singledispatchmethod.__get__c C r r r r r& r& r' r r z)singledispatchmethod.__isabstractmethod__rK ) r r r r r[ r. r r r r& r& r& r' r s r c @ s. e Zd Zdd Zdd ZdddZeeZdS ) r c C s || _ d | _|j| _t | _d S rK )ro attrnamer r r r: r& r& r' r[ s zcached_property.__init__c C s: | j d u r || _ d S || j krtd| j d|dd S )Nz?Cannot assign the same cached_property to two different names (z and z).)r> ri )r. ownernamer& r& r' __set_name__ s z cached_property.__set_name__Nc C s |d u r| S | j d u rtdz|j}W n ty- dt|jd| j d}t|d w || j t}|tu r| jB || j t}|tu rn| |}z||| j < W n! tym dt|jd| j d}t|d w W d |S W d |S 1 sw 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> ri r r r+ r r _NOT_FOUNDr ro )r. instancer? r msgvalr& r& r' r sL zcached_property.__get__rK ) r r r r[ rA r r r r r& r& r& r' r s r )r FrK )<r __all__abcr collectionsr reprlibr _threadr r r r r r r r0 r2 r5 r8 r= r? r@ rC rD rE rH rI rJ rR r r _functools ImportErrorrL rf r r r r r r r r strr r+ r r r r r r r r r% r r rB r r& r& r& r' <module> s A J .t -*f(