Operation   : Linux premium131.web-hosting.com 4.18.0-553.44.1.lve.el8.x86_64 #1 SMP Thu Mar 13 14:29:12 UTC 2025 x86_64
Software     : Apache
Server IP    : 162.0.232.56 | Your IP: 216.73.216.111
Domains      : 1034 Domain(s)
Permission   : [ 0755 ]

3

� frz�+@s�dZd
dddddddd	d
dgZ
ydd
lmZ
Wnek
rB


YnXddlmZ
ddlmZ
ddl	m
Z

ddlmZ
ddl
mZ
yddlmZ
Wn"ek
r�


Gdd�d�ZYnXdZZd[Zeefdd
�
Zeefdd�
Zef
dd�
Zef
d d!�
Zef
d"d#�
Zef
d$d%�
Zef
d&d'�
Zef
d(d)�
Zef
d*d+�
Zef
d,d-�
Zef
d.d/�
Zef
d0d1�
Zef
d2d3�
Z ef
d4d5�
Z!d6efd7efd8efgd8efd9efd6efgd9efd8efd7efgd7efd6e fd9e!fgd:�Z"d;d�Z#d<d�Z$ydd=lm$Z$
Wnek
�
r�


YnXGd>d	�d	�Z%ydd?lm%Z%
Wnek
�r*


YnXGd@d
�d
e&�Z'edAdBdCdDdEg�Z(GdFdG�dGe)�Z*e&�f
e+e,e-e.dH�
he/e.e0fdIdJ�
Z1d\dMd�
Z2dNdO�Z3yddPlm3Z3
Wnek
�r�


YnXdQdR�Z4d]dSdT�
Z5dUdV�Z6dWdX�Z7dYd�Z8dHS)^zEfunctools.py - Tools for working with functions and callable objects
�update_wrapper�wraps�WRAPPER_ASSIGNMENTS�WRAPPER_UPDATES�total_ordering�
cmp_to_key�	lru_cache�reduce�partial�
partialmethod�singledispatch�)
r)
�get_cache_token)
�
namedtuple)
�MappingProxyType)
�WeakKeyDictionary)
�recursive_repr)
�RLockc@s eZ
dZd
Zdd�Zdd�ZdS)rz/Dummy reentrant lock for builds without threadsc


CsdS)
N�)
�selfrr�./opt/alt/python36/lib64/python3.6/functools.py�	__enter__szRLock.__enter__c
CsdS)
Nr)r�exctype�excinst�exctbrrr�__exit__szRLock.__exit__N)�__name__�
__module__�__qualname__�__doc__rrrrrrrs


rrrrr�__annotations__�__dict__c
Csnx<|D]4}yt|
|�}Wnt
k
r,


YqXt|||�
qWx$|D]}t||�jt|
|i��

qDW|
|_|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)
    )�getattr�AttributeError�setattr�update�__wrapped__)�wrapper�wrapped�assigned�updated�attr�valuerrrr
,s







cCstt
||
|d
�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'r(r)rrrrJs
cCs$|j|
�
}||kr|S|o"||
kS)
zIReturn a > b.  Computed by @total_ordering from (not a < b) and (a != b).)
�__lt__)r�other�NotImplemented�	op_resultrrr�_gt_from_ltbs



r0cCs|j|
�
}|p||
kS)
zEReturn a <= b.  Computed by @total_ordering from (a < b) or (a == b).)
r,)rr-r.r/rrr�_le_from_ltis

r1cCs|j|
�
}||kr|S|S)
z=Return a >= b.  Computed by @total_ordering from (not a < b).)
r,)rr-r.r/rrr�_ge_from_ltns



r2cCs$|j|
�
}||kr|S|p"||
kS)
zJReturn a >= b.  Computed by @total_ordering from (not a <= b) or (a == b).)
�__le__)rr-r.r/rrr�_ge_from_leus



r4cCs"|j|
�
}||kr|S|o ||
kS)
zFReturn a < b.  Computed by @total_ordering from (a <= b) and (a != b).)
r3)rr-r.r/rrr�_lt_from_le|s



r5cCs|j|
�
}||kr|S|S)
z=Return a > b.  Computed by @total_ordering from (not a <= b).)
r3)rr-r.r/rrr�_gt_from_le�s



r6cCs$|j|
�
}||kr|S|o"||
kS)
zIReturn a < b.  Computed by @total_ordering from (not a > b) and (a != b).)
�__gt__)rr-r.r/rrr�_lt_from_gt�s



r8cCs|j|
�
}|p||
kS)
zEReturn a >= b.  Computed by @total_ordering from (a > b) or (a == b).)
r7)rr-r.r/rrr�_ge_from_gt�s

r9cCs|j|
�
}||kr|S|S)
z=Return a <= b.  Computed by @total_ordering from (not a > b).)
r7)rr-r.r/rrr�_le_from_gt�s



r:cCs$|j|
�
}||kr|S|p"||
kS)
zJReturn a <= b.  Computed by @total_ordering from (not a >= b) or (a == b).)
�__ge__)rr-r.r/rrr�_le_from_ge�s



r<cCs"|j|
�
}||kr|S|o ||
kS)
zFReturn a > b.  Computed by @total_ordering from (a >= b) and (a != b).)
r;)rr-r.r/rrr�_gt_from_ge�s



r=cCs|j|
�
}||kr|S|S)
z=Return a < b.  Computed by @total_ordering from (not a >= b).)
r;)rr-r.r/rrr�_lt_from_ge�s



r>r7r3r;r,)r,r3r7r;c
sZ�f
d
d�tD�
}
|
st
d�
�
t|
�
}x.t|D]"\}}||
kr0||_t�||�
q0W�S)z6Class decorator that fills in missing ordering methodsc
s(g|] }
t�|
d�tt
|
d�k	r|
�qS)
N)r!�object)�.0�op)
�clsrr�
<listcomp>�sz"total_ordering.<locals>.<listcomp>z6must define at least one ordering operation: < > <= >=)�_convert�
ValueError�maxrr#)rB�roots�root�opname�opfuncr)
rBrr�s







c
sG�f
d
d�dt�}
|
S)z,Convert a cmp= function into a key= functioncsZeZ
dZd
g
Zdd�Z�f
dd�Z�f
dd�Z�f
dd	�Z�f
d
d�Z�f
dd
�Z	dZ
dS)zcmp_to_key.<locals>.K�objcSs
|
|_dS)
N)
rK)rrKrrr�__init__�s
zcmp_to_key.<locals>.K.__init__cs�|j|
j�d
kS)Nr)
rK)rr-)
�mycmprrr,�s
zcmp_to_key.<locals>.K.__lt__cs�|j|
j�d
kS)Nr)
rK)rr-)
rMrrr7�s
zcmp_to_key.<locals>.K.__gt__cs�|j|
j�d
kS)Nr)
rK)rr-)
rMrr�__eq__�s
zcmp_to_key.<locals>.K.__eq__cs�|j|
j�d
k
S)Nr)
rK)rr-)
rMrrr3�s
zcmp_to_key.<locals>.K.__le__cs�|j|
j�d
kS)Nr)
rK)rr-)
rMrrr;�s
zcmp_to_key.<locals>.K.__ge__N)rrr�	__slots__rLr,r7rNr3r;�__hash__r)
rMrr�
K�s

rQ)
r?)rMrQr)
rMrr�s)
rcsJeZ
dZd
ZdZ�f
dd�Zd	d
�Ze�dd��
Zd
d�Z	dd�Z
�ZS)r	zSNew function with partial application of the given arguments
    and keywords.
    �func�args�keywordsr �__weakref__cs�|std
�
�
t
|�
dkr td�
�
|^}}}t|�
s:td�
�
t|�
}t|d�rv|j|}|jj�}|j|
�

|}
~|j	}t
t|�j|�
}||_	||_|
|_|S)Nz1descriptor '__new__' of partial needs an argument�z*type 'partial' takes at least one argumentz#the first argument must be callablerR)
�	TypeError�len�callable�tuple�hasattrrSrT�copyr$rR�superr	�__new__)rSrTrBrRZtmpkwr)
�	__class__rrr^�s(





















zpartial.__new__cOs:|std
�
�
|^
}}|j
j�}|j|
�

|j|j|�|�
S)Nz2descriptor '__call__' of partial needs an argument)rWrTr\r$rRrS)rSrTrZnewkeywordsrrr�__call__
s







zpartial.__call__c
Cs�t|�
j
}
t|j�
g
}|jd
d�|jD�
�

|jdd�|jj�D�
�

t|�
jdkrld|
�ddj	|�
�d�S|
�ddj	|�
�d�S)	Nc
ss|]}
t|
�
V
qdS)
N)
�repr)r@�
xrrr�	<genexpr>
sz#partial.__repr__.<locals>.<genexpr>c
ss |]\}
}|
�d|��V
qd
S)�
=Nr)r@�
k�
vrrrrc
s�	functoolsz
functools.�
(z, �
))
�typerrarR�extendrSrT�itemsr�join)r�qualnamerSrrr�__repr__
s






zpartial.__repr__c

Cs*t|�
|j
f
|j
|j|jpd|jp$dffS)
N)rjrRrSrTr )
rrrr�
__reduce__#
s

zpartial.__reduce__cCs�t|
t
�std
�
�
t|
�
dkr0tdt|
�
���
�
|
\}}}}t|�
szt|t
�sz|dk	rft|t�sz|dk	r�t|t�r�td�
�
t
|�
}|dkr�i}nt|�
tk	r�t|�
}|dkr�i}||_||_||_	||_
dS)Nz(argument to __setstate__ must be a tuple�zexpected 4 items in state, got zinvalid partial state)�
isinstancerZrWrXrY�dictrjr rRrSrT)r�staterRrS�kwds�	namespacerrr�__setstate__'
s(


















zpartial.__setstate__)rRrSrTr rU)rrrrrOr^r`rrorprw�
__classcell__rr)
r_rr	�s
)
r	c@s<eZ
dZd
Zdd�Zdd�Zdd�Zdd	�Zed
d��
Z	dS)
r
z�Method descriptor with partial application of the given arguments
    and keywords.

    Supports wrapping existing descriptors and handles non-descriptor
    callables as instance methods.
    cOsrt|
�
r$t
|
d
�r$tdj|
�
�
�
t|
t�r\|
j|_|
j||_|
jj	�|_|jj
|�

n|
|_||_||_dS)N�__get__z${!r} is not callable or a descriptor)rYr[rW�formatrrr
rRrSrTr\r$)rrRrSrTrrrrLM
s








zpartialmethod.__init__c
CsNd
jt
t|j��
}
d
jdd�|jj�D�
�
}d}|j|jj|jj	|j
|
|d�S)Nz, c
ss|]\}
}dj|
|�V
qd
S)z{}={!r}N)
rz)r@rerfrrrrcc
s
z)partialmethod.__repr__.<locals>.<genexpr>z*{module}.{cls}({func}, {args}, {keywords}))�modulerBrRrSrT)rm�maprarSrTrlrzr_rrrR)rrSrT�
format_stringrrrroa
s










zpartialmethod.__repr__c
s�f
d
d�}
�j|
_�|
_
|
S)Ncs<�jj
�}|j|
�

|^
}}|f
�jt|�
}�j||�
S)
N)rTr\r$rSrZrR)rSrT�
call_keywords�cls_or_self�rest�	call_args)
rrr�_methodm
s







z3partialmethod._make_unbound_method.<locals>._method)�__isabstractmethod__�_partialmethod)rr�r)
rr�_make_unbound_methodl
s


z"partialmethod._make_unbound_methodcCs�t|j
d
d�}d}|dk	rd||
|�}||j
k	rdt|f
|j�|j�
}y|j|_Wntk
rb


YnX|dkr||j�j|
|�}|S)Nry)	r!rRr	rSrT�__self__r"r�ry)rrKrB�get�result�new_funcrrrryw
s












zpartialmethod.__get__c

Cst|j
d
d�S)Nr�F)r!rR)
rrrrr��
sz"partialmethod.__isabstractmethod__N)
rrrrrLror�ry�propertyr�rrrrr
E
s�	CacheInfo�hits�misses�maxsize�currsizec@s(eZ
dZd
ZdZef
dd�
Zdd�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.

    �	hashvaluecCs|
|dd�<||
�
|_dS)
N)
r�)r�tup�hashrrrrL�
s

z_HashedSeq.__init__c


Cs|jS)
N)
r�)
rrrrrP�
s
z_HashedSeq.__hash__N)rrrrrOr�rLrPrrrrr��
sr�Nc
s�|}|
r*||7}x|
j�D]}	||	7}qW|rl||�f
d
d�|D�
�
7}|
r�||�f
dd�|
j
�D�
�
7}n$||�
dkr��|d�
|kr�|dSt|�
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
3s|]}
�|
�
V
qdS)
Nr)r@rf)
rjrrrc�
sz_make_key.<locals>.<genexpr>c
3s|]}
�|
�
V
qdS)
Nr)r@rf)
rjrrrc�
s�
r)rl�valuesr�)
rSru�typed�kwd_mark�	fasttypesrZrjrX�key�itemr)
rjr�	_make_key�
s







 


r��Fcs.�d
k	rt�t
�rtd�
�
��
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_algorithms#Least_Recently_Used

    Nz)Expected maxsize to be an integer or Nonec
st|��
t
�}
t|
|�S)
N)�_lru_cache_wrapper�
_CacheInfor
)�
user_functionr&)r�r�rr�decorating_function�
s

z&lru_cache.<locals>.decorating_function)rr�intrW)r�r�r�r)r�r�rr�
s
cs�t��t
�d\��
��i�d
�	�
d��j��j�t��
g���ddg�dd�<�d
krh�
�fdd�}nN�dkr����	��
���fdd�}n*��
�������	�
���
���fd	d�}���	�
��
fd
d�}���	�
�
�fdd
�}||_||_|S)Nrr�rV�Fcs�
||
�
}�d
7�|S)Nr�r)rSrur�)r�r�rrr&�
s


z#_lru_cache_wrapper.<locals>.wrappercsH�||
��}�
|��}|�k	r*�d
7�|S�||
�
}|�|<�d
7�|S)Nr�r)rSrur�r�)�cache�	cache_getr��make_keyr��sentinelr�r�rrr&�
s









cs2
�
||
��}�	�f
�|�
}|dk	rr|\}}}}||�
<||�<�
�}||�
<�
�<||�<�
|�
<�d
7�|SWdQRX�||
�
}�	��
|�kr�n��r�
}	||	�<||	�<|	�
�
�
�}
�
�}d�
�<�
�<�|
=|	�|<n6�
�}|�
||g}||�
<�
�<�|<���k��d
7�WdQRX|S)Nr�r)rSrur��linkZ	link_prevZ	link_nextZ_keyr�ZlastZoldrootZoldkeyZ	oldresult)�KEY�NEXT�PREV�RESULTr�r��	cache_len�fullr��lockr�r�r�rHr�r�rrr&sB


























cs ��
�����
��SQRXd
S)zReport cache statisticsNrr)r�r�r�r�r�r�rr�
cache_infoGs
z&_lru_cache_wrapper.<locals>.cache_infocs<��.
�j�
��d
d
g�d
d
�<d��d�
Wd
QRXd
S)z$Clear the cache and cache statisticsNrF)
�clearr)r�r�r�r�r�rHrr�cache_clearLs




z'_lru_cache_wrapper.<locals>.cache_clear)rr�rVr�)r?r�r��__len__rr�r�)r�r�r�r�r&r�r�r)r�r�r�r�r�r�r�r�r�r�r�r�r�r�rHr�r�r�rr��
s*








*9	

r�)
r�c
Cs�g}
x�d
d�|D�
}|s|
Sx:|D]2}|d}x$|D]}||dd�kr4d}Pq4WPq"W|dkrhtd�
�
|
j
|�

x|D]}|d|krx|d=qxWqWdS)z�Merges MROs in *sequences* to a single MRO using the C3 algorithm.

    Adapted from http://www.python.org/download/releases/2.3/mro/.

    c
Ssg|]}
|
r|
�qSrr)r@�
srrrrCksz_c3_merge.<locals>.<listcomp>rr�NzInconsistent hierarchy)�RuntimeError�append)�	sequencesr��s1�	candidate�s2�seqrrr�	_c3_mergecs$


















r�c
s&
x8tt
|j�
�
D]"\}�
t�
d
�rt|j�
|}PqWd}�rFt��
ng�t|jd|��
}g}t|j|d��
}x:�D]2�
t|�
�rxt�
f
dd�|jD�
�
rx|j�
�

qxWx|D]�
�j	�
�

q�W�f
dd�|D�
}�f
dd�|D�
}�f
d	d�|D�
}	t
|g
g
|||	|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
3s|]}
t|
��V
qdS)
N)
�
issubclass)r@�
b)
�baserrrc�sz_c3_mro.<locals>.<genexpr>c
sg|]}
t|
�d��qS)
)
�abcs)
�_c3_mro)r@r�)
r�rrrC�sz_c3_mro.<locals>.<listcomp>c
sg|]}
t|
�d��qS)
)
r�)
r�)r@r�)
r�rrrC�sc
sg|]}
t|
�d��qS)
)
r�)
r�)r@r�)
r�rrrC�s)�	enumerate�reversed�	__bases__r[rX�listr��anyr��remover�)
rBr��
i�boundary�explicit_bases�abstract_bases�other_bases�explicit_c3_mros�abstract_c3_mros�
other_c3_mrosr)r�r�rr�~s(


















r�cs�t�
j
�
���
fd
d���f
dd��D�
��f
dd���f
dd��D�
�t��
�g}x��D]�}g}x<|j�D]0}|�krlt�
|�rl|j�f
dd�|j
D�
�

qlW|s�|j|�

qZ|jtd	d
�
x,|D]$}x|D]}||kr�|j|�

q�Wq�WqZWt�
|d�S)z�Calculates 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|d
�ot
�
|�S)N�__mro__)r[r�)
�typ)�basesrBrr�
is_related�s

z _compose_mro.<locals>.is_relatedc
sg|]}
�|
�
r|
�qSrr)r@�
n)
r�rrrC�sz _compose_mro.<locals>.<listcomp>c
s(x"�D]}
||
kr||
jkrd
SqWdS)NTF)
r�)r�r-)
�typesrr�is_strict_base�s




z$_compose_mro.<locals>.is_strict_basec
sg|]}
�|
�
s|
�qSrr)r@r�)
r�rrrC�sc
sg|]}
|
�kr|
�qSrr)r@r�)
�type_setrrrC�sT)r��reverse)
r�)�setr��__subclasses__r�r��sortrXr�)rBr��mror��found�sub�subclsr)r�rBr�r�r�r�r�_compose_mro�s*


















r�cCsxt||
j
��}d
}xZ|D]R}|d
k	r^||
kr\||jkr\||jkr\t||�r\tdj||��
�
P||
kr|}qW|
j|�
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 {})r��keysr�r�r�rzr�)rB�registryr��match�
trrr�
_find_impl�s














r�c
s�i�t��d
����fdd��
d
����fdd�	��
�fdd�}
t
|dd	��|�t<�|
_�
|
_t��
|
_�j|
_t	|
|�
|
S)al
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.

    Nc
s|�d
k	r"t�}
�|
kr"�
j
�
|
�y�
|}WnHtk
rv


y�|}Wntk
rh


t|��}YnX|�
|<YnX|S)z�generic_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�)rB�
current_token�impl)�cache_token�dispatch_cacher�rr�dispatch�s












z singledispatch.<locals>.dispatchcsB|
d
kr��fdd�S|
��<�
d
kr6t�d�r6t
��
�j�
|
S)z�generic_func.register(cls, func) -> func

        Registers a new implementation for the given *cls* on a *generic_func*.

        Nc

s
�
�|�S)
Nr)
�
f)rB�registerrr�<lambda>sz2singledispatch.<locals>.register.<locals>.<lambda>r�)r[r
r�)rBrR)r�r�r�r�)
rBrr�s





z singledispatch.<locals>.registercs&|st�
�d
��
�
�|dj
�
||
�
S)Nz( requires at least 1 positional argumentr)rWr_)rS�kw)r��funcnamerrr&"s

zsingledispatch.<locals>.wrapperrzsingledispatch function)
N)
rr!r?r�r�rr�r��_clear_cacher
)rRr&r)r�r�r�r�r�r�rr�s











)rrrrr)
r )r�F)
N)9r�__all__�
_functoolsr�ImportError�abcr
�collectionsrr�r�weakrefr�reprlibr�_threadrrrr
rr.r0r1r2r4r5r6r8r9r:r<r=r>rDrrr	r?r
r�r�r�r��str�	frozensetrjrZrXr�rr�r�r�r�r�rrrrr�<module>s�


































N


N


%t



-)