U
if
@ s d Z ddddddddd d
d d d
g
ZddlmZ ddlmZ ddlmZ ddlm Z dZ
dZ e
e fddZ e
e fddZ
efddZefddZefdd Zefd d Zefd d Zefd!d"Zefd#d$Zefd%d&Zefd'd(Zefd)d*Zefd+d,Zefd-d.Zd/efd0efd1efgd1efd2efd/efgd2efd1efd0efgd0efd/efd2efgd3Zd4d Z d5d Z zdd6l m Z W n e k
r Y nX e Z!e!fd7dZ"zdd8l m"Z" W n e k
r Y nX G d9d d Z#zdd:l m#Z# W n e k
r Y nX G d;d
d
e Z$dd?d@dAdBgZ&G dCdD dDe'Z(e fe)e*he+e,e-fdEdFZ.dYdIdZ/dJdK Z0zddLl m0Z0 W n e k
r Y nX dMdN Z1dZdPdQZ2dRdS Z3dTdU Z4dVd Z5G dWd d Z6e Z7G dXd
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 C sf |D ]4}zt ||}W n tk
r* Y qX 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$ ./opt/alt/python38/lib64/python3.8/functools.pyr " s 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 @ s c C s$ | |}||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_ltX s
r. c C s | |}|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/ c C s | |}||kr|S | S )z=Return a >= b. Computed by @total_ordering from (not a < b).r' r) r$ r$ r% _ge_from_ltd s
r0 c C s$ | |}||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_lek s
r3 c C s" | |}||kr|S |o | |kS )zFReturn a < b. Computed by @total_ordering from (a <= b) and (a != b).r1 r) r$ r$ r% _lt_from_ler s
r4 c C s | |}||kr|S | S )z=Return a > b. Computed by @total_ordering from (not a <= b).r1 r) r$ r$ r% _gt_from_ley s
r5 c C s$ | |}||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_gt s
r8 c C s | |}|p| |kS )zEReturn a >= b. Computed by @total_ordering from (a > b) or (a == b).r6 r) r$ r$ r% _ge_from_gt s
r9 c C s | |}||kr|S | S )z=Return a <= b. Computed by @total_ordering from (not a > b).r6 r) r$ r$ r% _le_from_gt s
r: c C s$ | |}||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_ge s
r= c C s" | |}||kr|S |o | |kS )zFReturn a > b. Computed by @total_ordering from (a >= b) and (a != b).r; r) r$ r$ r% _gt_from_ge s
r> c C s | |}||kr|S | S )z=Return a < b. Computed by @total_ordering from (not a >= b).r; r) r$ r$ r% _lt_from_ge s
r? r7 r2 r< r( )r( r2 r7 r< c sV fddt D }|s tdt|}t | D ]"\}}||kr.||_t || q. S )z6Class decorator that fills in missing ordering methodsc s( h | ] }t |d t t|d k r|qS N)r object).0opclsr$ r% s z!total_ordering..z6must define at least one ordering operation: < > <= >=)_convert
ValueErrormaxr r )rE rootsrootopnameopfuncr$ rD r% r s 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..Kobjc S s
|| _ d S r@ rN )r* rN r$ r$ r% __init__ s z cmp_to_key..K.__init__c s | j |j dk S Nr rO r* r+ mycmpr$ r% r( s z cmp_to_key..K.__lt__c s | j |j dkS rQ rO rR rS r$ r% r7 s z cmp_to_key..K.__gt__c s | j |j dkS rQ rO rR rS r$ r% __eq__ s z cmp_to_key..K.__eq__c s | j |j dkS rQ rO rR rS r$ r% r2 s z cmp_to_key..K.__le__c s | j |j dkS rQ rO rR rS r$ r% r< s z cmp_to_key..K.__ge__N) r r r __slots__rP r( r7 rU r2 r< __hash__r$ rS r$ r% K s rX )rA )rT rX r$ rS r% r s )r c C sZ t |}|tkr>z t|}W qB tk
r: tddY qBX n|}|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% r s )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 sZ t |stdt|dr4|j| }|j|}|j}tt| | }||_||_||_|S )Nz#the first argument must be callabler` ) callabler] hasattrra rb r` superr __new__)rE r` ra rb r* __class__r$ r% rg s
zpartial.__new__c O s | j |}| j| j||S r@ rb r` ra )r* ra rb r$ r$ r% __call__% s
zpartial.__call__c C s t | j}t| jg}|dd | jD |dd | j D t | jdkrld| dd | dS | dd | dS ) Nc s s | ]}t |V qd S r@ )repr)rB xr$ r$ r% - s z#partial.__repr__..c s s | ]\}}| d |V qdS )=Nr$ rB kvr$ r$ r% rn . s functoolsz
functools.(, ))
typer rl r` extendra rb itemsr join)r* qualnamera r$ r$ r% __repr__) s
zpartial.__repr__c C s* t | | jf| j| j| jp d | jp$d ffS r@ )rw r` ra rb r r* r$ r$ r%
__reduce__3 s zpartial.__reduce__c C s t |tstdt|dkr0tdt| |\}}}}t|rrt |trr|d k r`t |trr|d k rzt |tsztdt|}|d kri }nt|tk rt|}|d kri }|| _|| _|| _ || _
d S )Nz(argument to __setstate__ must be a tuple z expected 4 items in state, got zinvalid partial state)
isinstancetupler] lenrd dictrw r r` ra rb )r* stater` ra kwds namespacer$ r$ r% __setstate__7 s4
zpartial.__setstate__) r r r r rV rg rk r r| r~ r
__classcell__r$ r$ rh r% r s
)r c @ sD e Zd ZdZdd Zde_dd Zdd Zdd
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.
c O s t | dkr| ^}}} nV| s&tdnHd|krZ|d}| ^}} dd l}|jdtdd ntdt | d t| } t|st|d std
|t
|t r|j |_ |j
| |_
|j||_n||_ | |_
||_d S ) N z8descriptor '__init__' of partialmethod needs an argumentr` r z0Passing 'func' as keyword argument is deprecated)
stacklevelz8type 'partialmethod' takes at least one argument, got %d __get__z${!r} is not callable or a descriptor)r r] popwarningswarnDeprecationWarningr rd re formatr r
r` ra rb )ra rb r* r` r r$ r$ r% rP ] s6
zpartialmethod.__init__z#($self, func, /, *args, **keywords)c C sN d tt| j}d dd | j D }d}|j| jj| jj | j
||dS )Nru c s s | ]\}}d ||V qdS )z{}={!r}N)r rp r$ r$ r% rn s z)partialmethod.__repr__..z*{module}.{cls}({func}, {args}, {keywords}))modulerE r` ra rb ) rz maprl ra rb ry r ri r r r` )r* ra rb
format_stringr$ r$ r% r| s
zpartialmethod.__repr__c s fdd} j |_ |_|S )Nc s j |} j| f j||S r@ rj ) cls_or_selfra rb r} r$ r% _method s
z3partialmethod._make_unbound_method.._method)__isabstractmethod___partialmethod)r* r r$ r} r% _make_unbound_method s z"partialmethod._make_unbound_methodNc C s t | jdd }d }|d k rd|||}|| jk rdt|f| j| j}z |j|_W n tk
rb Y nX |d kr|| ||}|S )Nr ) r r` r ra rb __self__r r r )r* rN rE getresultnew_funcr$ r$ r% r s
zpartialmethod.__get__c C s t | jddS Nr Fr r` r} r$ r$ r% r s z"partialmethod.__isabstractmethod__)N) r r r r rP __text_signature__r| r r propertyr r$ r$ r$ r% r
U s "
c C s t | tr| j} q | S r@ )r r r` r` r$ r$ r% _unwrap_partial s
r CacheInfohitsmissesmaxsizecurrsizec @ 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 r@ r )r* tuphashr$ r$ r% rP s z_HashedSeq.__init__c C s | j S r@ r r} r$ r$ r% rW s z_HashedSeq.__hash__N)r r r r rV r rP rW r$ r$ r$ r% r s r c
s | }|r&||7 }| D ] } || 7 }q|rh|| fdd| D 7 }|r|| fdd| D 7 }n$||dkr |d |kr|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 s | ]} |V qd S r@ r$ rB rr rw r$ r% rn s z _make_key..c 3 s | ]} |V qd S r@ r$ r r r$ r% rn s r r )ry valuesr )
ra r typedkwd_mark fasttypesr rw r keyitemr$ r r% _make_key s
r Fc sn t tr dk r\d nDt rLt trL d } t| t}t||S dk r\td 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: http://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU)
r r Nz=Expected first argument to be an integer, a callable, or Nonec s t | t}t|| S r@ )_lru_cache_wrapper
_CacheInfor )
user_functionr r r r$ r% decorating_function
s z&lru_cache..decorating_function)r intrd boolr r r r] )r r r r r r$ r r% r s
c s t t d\ i d
djjt
g d d gd d < dkrh
fdd}nN d kr
fdd}n*
fdd}
fdd }
fd
d }||_||_|S ) N)r r r r Fc s d7 | |}|S Nr r$ )ra r r )r r r$ r% r $ s
z#_lru_cache_wrapper..wrapperc sH | |}|}|k r*d7 |S d7 | |}| |< |S r r$ )ra r r r )cache cache_getr make_keyr sentinelr r r$ r% r - s
c
s>
| |} z |}|d k r~|\}}}}||< ||<
}| |<
< ||<
|< d7 |W 5 Q R S d7 W 5 Q R X | |} |krnr
} || < || < |
}
} d
<
< |
= | |< n6
}|
||g}| |<
< |< kW 5 Q R X |S r r$ ) ra r r linkZ link_prevZ link_nextZ_keyr ZlastZoldrootZoldkeyZ oldresult)KEYNEXTPREVRESULTr r cache_lenfullr lockr r r rK r r r$ r% r < sB
c
s, W 5 Q R S Q R X dS )zReport cache statisticsNr$ r$ )r r r r r r r$ r%
cache_infou s z&_lru_cache_wrapper..cache_infoc s< . ddgdd< d dW 5 Q R X dS )z$Clear the cache and cache statisticsNr F)clearr$ )r r r r r rK r$ r% cache_clearz s
z'_lru_cache_wrapper..cache_clear)rA 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 rK r r r r% r s* *9 r )r c C s g }dd | D } | s|S | D ]2}|d }| D ] }||dd kr.d} q q. qRq |dkrbt d|| | 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/.
c S s g | ] }|r|qS r$ r$ rB sr$ r$ r%
s z _c3_merge..r r NzInconsistent hierarchy) RuntimeErrorappend) sequencesr s1 candidates2seqr$ r$ r% _c3_merge s"
r Nc
s t t| jD ]$\}tdrt| j| } q8qd} rDt ng t| jd| }g }t| j|d } D ]0t| rttfdd| jD st| qt|D ] q 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 r@ )
issubclass)rB b)baser$ r% rn s z_c3_mro..c s g | ]}t | d qS abcs_c3_mrorB r r r$ r% r s z_c3_mro..c s g | ]}t | d qS r r r r r$ r% r s c s g | ]}t | d qS r r r r r$ r% r s ) enumeratereversed __bases__re r listr anyr remover )
rE r iboundaryexplicit_basesabstract_bases other_basesexplicit_c3_mrosabstract_c3_mros
other_c3_mrosr$ )r r r% r sD
r c s t j fddfddD fddfddD t g }D ]}g }| D ]0}| krht|rh|fdd|jD qh|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.
c s | kot | dot| S )N__mro__)re r )typ)basesrE r$ r%
is_related s z _compose_mro..is_relatedc s g | ]} |r|qS r$ r$ rB n)r r$ r% r s z _compose_mro..c s& D ] }| |kr| |j kr dS qdS )NTF)r )r r+ )typesr$ r% is_strict_base s z$_compose_mro..is_strict_basec s g | ]} |s|qS r$ r$ r )r r$ r% r s c s g | ]}| kr|qS r$ r$ r )type_setr$ r% r s T)r reverser )setr __subclasses__r r sortr r )rE r mror foundsubsubclsr$ )r rE r r r r r% _compose_mro s*
r c C st t | | }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.
Nz Ambiguous dispatch: {} or {})r keysr r r r r )rE registryr matchtr$ r$ r%
_find_impl s"
r
c s ddl }ddl}i | d fddd fdd fdd}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 s| dk r"t } |kr" | z | }W nH tk
rv z | }W n tk
rh t| }Y nX || < Y nX |S )zgeneric_func.dispatch(cls) ->
Runs the dispatch algorithm to return the best available implementation
for the given *cls* registered on *generic_func*.
N)r r KeyErrorr
)rE
current_tokenimpl) cache_tokendispatch_cacher r$ r% dispatch. s z singledispatch..dispatchc s |dkrt tr fddS t di }|s@td d }ddlm} tt|| \} t tstd |d
d | < dkrt d rt
|S )
zgeneric_func.register(cls, func) -> func
Registers a new implementation for the given *cls* on a *generic_func*.
Nc s
| S r@ r$ )f)rE registerr$ r% N z2singledispatch..register..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 is not a class.r ) r rw r r] typingr r[ rY ry re r r )rE r` annr argname)r r r r rD r% r E s(
z singledispatch..registerc s& | st d | d j| |S )Nz( requires at least 1 positional argumentr )r] ri )ra kw)r funcnamer$ r% r f s z singledispatch..wrapperr zsingledispatch function)N) r weakrefWeakKeyDictionaryr rA r r MappingProxyTyper r _clear_cacher )r` r r r r$ )r r r r r r r% r s !
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 |s t|ds t|dt|| _|| _d S )Nr z is not callable or a descriptor)rd re r] r
dispatcherr` r* r` r$ r$ r% rP 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 )r r )r* rE methodr$ r$ r% r s z singledispatchmethod.registerc s0 fdd}j |_ j|_t|j |S )Nc s$ j | d j}| | |S rQ )r r ri r )ra kwargsr! rE rN r* r$ r% r s z-singledispatchmethod.__get__.._method)r r r r` )r* rN rE r r$ r# r% r s
z singledispatchmethod.__get__c C s t | jddS r r r} r$ r$ r% r s z)singledispatchmethod.__isabstractmethod__)N)N) r r r r rP r r r r r$ r$ r$ r% r x s
c @ s& e Zd Zdd Zdd ZdddZdS ) r
c C s || _ d | _|j| _t | _d S r@ )r` attrnamer r r r r$ r$ r% rP s zcached_property.__init__c C s8 | j d kr|| _ n"|| j kr4td| j d|dd S )Nz?Cannot assign the same cached_property to two different names (z and z).)r$ r] )r* ownernamer$ r$ r% __set_name__ s
z cached_property.__set_name__Nc C s |d kr | S | j d kr tdz
|j}W n8 tk
r` dt|jd| j d}t|d Y nX || j t}|tkr| jn || j t}|tkr| |}z||| j < W n8 tk
r dt|jd| j d}t|d Y nX W 5 Q R X |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 rw r r
_NOT_FOUNDr r` )r* instancer% r msgvalr$ r$ r% r s2
zcached_property.__get__)N)r r r rP r' r r$ r$ r$ r% r
s )r F)N)9r __all__abcr collectionsr reprlibr _threadr r r r r r, r. r/ r0 r3 r4 r5 r8 r9 r: r= r> r? rG r r
_functools ImportErrorrA rZ r r r
r r r r r strr rw r r r r r r r r
r r r( r
r$ r$ r$ r% s
AX
,t
-)\(