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 ]

U

i�f�S�
@s�dZd
dl
mZmZmZmZmZmZmZm	Z	
d
dl
mZmZ
d
dl
Z
d
dlZd
dlZeefZddddd	d
ddd
ddddg
ZGdd�de�ZGdd�de
j�ZGdd�de�ZGdd	�d	e
j�ZGdd�d�ZdS)z{Weak reference support for Python.

This module is an implementation of PEP 205:

http://www.python.org/dev/peps/pep-0205/
�)�getweakrefcount�getweakrefs�ref�proxy�CallableProxyType�	ProxyType�
ReferenceType�_remove_dead_weakref)�WeakSet�_IterationGuardNrrrr�WeakKeyDictionaryrrr�
ProxyTypes�WeakValueDictionaryr
�
WeakMethod�finalizecsDeZ
dZd
ZdZddd�
Z�f
dd�Zdd	�Zd
d�Ze	j
Z
�ZS)
rz�
    A custom `weakref.ref` subclass which simulates a weak reference to
    a bound method, working around the lifetime problem of bound methods.
    )�	_func_ref�
_meth_type�_alive�__weakref__Ncs~z|
j}|
j
}Wn(tk
r8


td
�t|
�
�
�
d�YnX��
fdd�}t�|||�}t||�|_t|
�
|_	d|_
t|�
�
|S)Nz)argument should be a bound method, not {}c
s&�
�}
|
jr"d
|
_�dk	r"�|
�

dS�NF)
r)�arg�self��callbackZself_wr��,/opt/alt/python38/lib64/python3.8/weakref.py�_cb3s




zWeakMethod.__new__.<locals>._cbT)�__self__�__func__�AttributeError�	TypeError�format�typer�__new__rrr)�clsZmethr�obj�funcrrrrrr#,s 






�
�





zWeakMethod.__new__c
s2t��
�}
|��}|
dks"|dkr&dS|�||
�S�
N)�super�__call__rr)rr%r&�
�	__class__rrr)Bs






zWeakMethod.__call__cCs:t|
t
�r6|jr|
js||
kSt�||
�o4|j|
jkSd
Sr)�
isinstancerrr�__eq__r�r�otherrrrr-Is






zWeakMethod.__eq__cCs:t|
t
�r6|jr|
js||
k	St�||
�p4|j|
jkSd
S�NT)r,rrr�__ne__rr.rrrr1Ps






zWeakMethod.__ne__)
N)�__name__�
__module__�__qualname__�__doc__�	__slots__r#r)r-r1r�__hash__�
__classcell__rrr*rr$s

c@s�eZ
dZd
Zd,dd�
Zdd�Zdd�Zd	d
�Zdd�Zd
d�Z	dd�Z
dd�Zdd�ZeZ
dd�Zd-dd�
Zdd�Zdd�ZeZdd�Zd d!�Zd"d#�Zd$d%�Zd.d&d'�
Zd/d(d)�
Zd*d+�ZdS)0rz�Mapping class that references values weakly.

    Entries in the dictionary will be discarded when no strong
    reference to the value exists anymore
    rcKs>t|�
t
fd
d�
}||_g|_t�|_i|_|j|
f
|�

dS)NcSs6|
�}|dk	r2|jr$|j
�|j�

n||j|j�
dSr')�
_iterating�_pending_removals�append�key�data)�wr�selfrefZ_atomic_removalrrrr�removegs




z,WeakValueDictionary.__init__.<locals>.remove)rr	�_remover:�setr9r=�update)rr/�kwr@rrr�__init__fs
	


zWeakValueDictionary.__init__c
Cs(|j}
|j
}|
r$|
��}t||�
qdSr')r:r=�popr	)r�
l�
dr<rrr�_commit_removalsws




z$WeakValueDictionary._commit_removalscCs4|jr|�
�
|j|
�}|dkr,t|
�
�
n|SdSr'�r:rIr=�KeyError�rr<�
orrr�__getitem__�s





zWeakValueDictionary.__getitem__cCs|jr|�
�
|j|
=dSr')r:rIr=�rr<rrr�__delitem__�s


zWeakValueDictionary.__delitem__c

Cs|jr|�
�
t|j�
Sr')r:rI�lenr=�
rrrr�__len__�s


zWeakValueDictionary.__len__cCs>|jr|�
�
z|j|
�}Wntk
r4


Yd
SX|dk	SrrJrLrrr�__contains__�s






z WeakValueDictionary.__contains__c

Csd
|jj
t|�
fS�Nz<%s at %#x>�r+r2�idrRrrr�__repr__�s
zWeakValueDictionary.__repr__cCs&|jr|�
�
t||j|
�|j|
<dSr')r:rI�KeyedRefrAr=�rr<�valuerrr�__setitem__�s


zWeakValueDictionary.__setitem__c
	CsV|jr|�
�
t�}
t|�
�0
|j��D]\}}|�}|dk	r(||
|<q(W5QRX|
Sr')r:rIrrr=�items)r�newr<r>rMrrr�copy�s









zWeakValueDictionary.copyc	Csjd
dlm
}
|jr|��
|��}t|�
�6
|j��D]$\}}|�}|dk	r6|||||
�<q6W5QRX|S�Nr
)
�deepcopy)r_rar:rIr+rr=r])r�memorar^r<r>rMrrr�__deepcopy__�s










z WeakValueDictionary.__deepcopy__NcCsP|jr|�
�
z|j|
}Wntk
r4


|YSX|�}|dkrH|S|SdSr'rJ)rr<�defaultr>rMrrr�get�s







zWeakValueDictionary.getc
	csR|jr|�
�
t|�
�2
|j��D] \}
}|�}|dk	r"|
|fV
q"W5QRXdSr'�r:rIrr=r])r�
kr>�
vrrrr]�s







zWeakValueDictionary.itemsc
	csJ|jr|�
�
t|�
�*
|j��D]\}
}|�dk	r"|
V
q"W5QRXdSr'rf)rrgr>rrr�keys�s







zWeakValueDictionary.keysc

	cs6|jr|�
�
t|�
�
|j��Ed
H
W5QRXd
S)a�
Return an iterator that yields the weak references to the values.

        The references are not guaranteed to be 'live' at the time
        they are used, so the result of calling the references needs
        to be checked before being used.  This can be used to avoid
        creating references that will cause the garbage collector to
        keep the values around longer than needed.

        N�r:rIrr=�valuesrRrrr�
itervaluerefs�s




z!WeakValueDictionary.itervaluerefsc
	csJ|jr|�
�
t|�
�*
|j��D]}
|
�}|dk	r"|V
q"W5QRXdSr'rj�rr>r%rrrrk�s







zWeakValueDictionary.valuesc
Cs8|jr|�
�
|j��\}
}|�}|dk	r|
|fSqdSr')r:rIr=�popitem)rr<r>rMrrrrn�s




zWeakValueDictionary.popitemcGs`|jr|�
�
z|j�|
�
�}Wntk
r8


d}YnX|dkrX|rN|d
St|
�
�
n|SdS)Nr
)r:rIr=rFrK)rr<�argsrMrrrrF
s










zWeakValueDictionary.popcCs`z|j|
�}Wnt
k
r(


d}YnX|dkrX|jr@|��
t||j|
�|j|
<|S|SdSr')r=rKr:rIrYrA)rr<rdrMrrr�
setdefault
s









zWeakValueDictionary.setdefaultcKsz|jr|�
�
|j}|
dk	rRt|
d
�s.t|
�
}
|
��D]\}}t||j|�||<q6|��D]\}}t||j|�||<qZdS�Nr])r:rIr=�hasattr�dictr]rYrA)rr/�kwargsrHr<rMrrrrC
s










zWeakValueDictionary.updatec

Cs|jr|�
�
t|j���
S)
a~
Return a list of weak references to the values.

        The references are not guaranteed to be 'live' at the time
        they are used, so the result of calling the references needs
        to be checked before being used.  This can be used to avoid
        creating references that will cause the garbage collector to
        keep the values around longer than needed.

        )r:rI�listr=rkrRrrr�	valuerefs(
s


zWeakValueDictionary.valuerefs)
r)
N)
N)
N)r2r3r4r5rErIrNrPrSrTrXr\r_�__copy__rcrer]ri�__iter__rlrkrnrFrprCrvrrrrrZs.

			
			

cs,eZ
dZd
ZdZdd�Z�f
dd�Z�ZS)rYa[
Specialized reference that includes a key corresponding to the value.

    This is used in the WeakValueDictionary to avoid having to create
    a function object for each key stored in the mapping.  A shared
    callback object can use the 'key' attribute of a KeyedRef instead
    of getting a reference to the key from an enclosing scope.

    �
r<cCst�
||
|�}||_|Sr')rr#r<)r"�obrr<rrrrr#C
s


zKeyedRef.__new__cst��
|
|�
dSr')r(rE)rrzrr<r*rrrEH
s
zKeyedRef.__init__)r2r3r4r5r6r#rEr8rrr*rrY7
s
	rYc@s�eZ
dZd
Zd+dd�
Zdd�Zdd�Zd	d
�Zdd�Zd
d�Z	dd�Z
dd�Zdd�ZeZ
dd�Zd,dd�
Zdd�Zdd�Zdd�ZeZdd �Zd!d"�Zd#d$�Zd%d&�Zd-d'd(�
Zd.d)d*�
ZdS)/ra�
 Mapping class that references keys weakly.

    Entries in the dictionary will be discarded when there is no
    longer a strong reference to the key. This can be used to
    associate additional data with an object owned by other parts of
    an application without adding attributes to those objects. This
    can be especially useful with objects that override attribute
    accesses.
    NcCsFi|_t
|�
f
d
d�
}||_g|_t�|_d|_|
dk	rB|�|
�

dS)NcSs.|
�}|dk	r*|jr"|j
�|�

n|j|=dSr')r9r:r;r=)rgr?rrrrr@Y
s




z*WeakKeyDictionary.__init__.<locals>.removeF)r=rrAr:rBr9�
_dirty_lenrC)rrsr@rrrrEW
s





zWeakKeyDictionary.__init__c
Cs:|j}
|j
}|
r6z||
��=Wqtk
r2


YqXqdSr')r:r=rFrK)rrGrHrrrrIh
s





z"WeakKeyDictionary._commit_removalsc

s&|j��f
d
d�|j
D�
|_
d|_dS)Nc
sg|]}
|
�kr|
�qSrr)�.0rg�
rHrr�
<listcomp>w
sz5WeakKeyDictionary._scrub_removals.<locals>.<listcomp>F)r=r:r{rRrr}r�_scrub_removalsu
s


z!WeakKeyDictionary._scrub_removalscCsd
|_|j
t|
�
=dSr0)r{r=rrOrrrrPz
s

zWeakKeyDictionary.__delitem__cCs|jt
|
�
Sr')r=rrOrrrrN~
s
zWeakKeyDictionary.__getitem__c

Cs(|jr|j
r|��
t|j�
t|j
�
Sr')r{r:rrQr=rRrrrrS�
s

zWeakKeyDictionary.__len__c

Csd
|jj
t|�
fSrUrVrRrrrrX�
s
zWeakKeyDictionary.__repr__cCs||jt
|
|j�<dSr')r=rrArZrrrr\�
s
zWeakKeyDictionary.__setitem__c
	CsHt�}
t
|�
�0
|j��D]\}}|�}|dk	r||
|<qW5QRX|
Sr')rrr=r])rr^r<r[rMrrrr_�
s







zWeakKeyDictionary.copyc	Cs\d
dlm
}
|��}t|�
�6
|j��D]$\}}|�}|dk	r(|||
�||<q(W5QRX|Sr`)r_rar+rr=r])rrbrar^r<r[rMrrrrc�
s








zWeakKeyDictionary.__deepcopy__cCs|j�
t|
�
|�Sr')r=rer�rr<rdrrrre�
s
zWeakKeyDictionary.getcCs.zt|
�
}Wnt
k
r"


Yd
SX||jkSr)rr r=)rr<r>rrrrT�
s





zWeakKeyDictionary.__contains__c
	csDt|�
�2
|j
��D] \}
}|
�}|dk	r||fV
qW5QRXdSr'�rr=r])rr>r[r<rrrr]�
s






zWeakKeyDictionary.itemsc
	cs8t|�
�&
|j
D]}
|
�}|dk	r|V
qW5QRXdSr')rr=rmrrrri�
s







zWeakKeyDictionary.keysc
	cs<t|�
�*
|j
��D]\}
}|
�dk	r|V
qW5QRXdSr'r�)rr>r[rrrrk�
s





zWeakKeyDictionary.valuesc

Cs
t|j
�
S)
az
Return a list of weak references to the keys.

        The references are not guaranteed to be 'live' at the time
        they are used, so the result of calling the references needs
        to be checked before being used.  This can be used to avoid
        creating references that will cause the garbage collector to
        keep the keys around longer than needed.

        )rur=rRrrr�keyrefs�
s
zWeakKeyDictionary.keyrefsc
Cs0d
|_|j
��\}
}|
�}|dk	r||fSqdSr0)r{r=rn)rr<r[rMrrrrn�
s




zWeakKeyDictionary.popitemcGsd
|_|j
jt|
�
f
|��Sr0)r{r=rFr)rr<rorrrrF�
s

zWeakKeyDictionary.popcCs|j�
t|
|j�|�Sr')r=rprrAr�rrrrp�
s
zWeakKeyDictionary.setdefaultcKs\|j}|
dk	rFt
|
d
�s$ti�
|
�
}
|
��D]\}}||t||j�<q,t|�
rX|�|�

dSrq)r=rrr"r]rrArQrC)rrsrtrHr<r[rrrrC�
s








zWeakKeyDictionary.update)
N)
N)
N)
N)r2r3r4r5rErIrrPrNrSrXr\r_rwrcrerTr]rirxrkr�rnrFrprCrrrrrL
s.



	


c@s�eZ
dZd
ZdZiZdZe��Z	dZ
dZGdd�d�Zdd�Z
de
_dd
d�
Zdd
�Zdd�Zedd��
Zedd��
Zejdd��
Zdd�Zedd��
Zedd��
Zd	S)raClass for finalization of weakrefable objects

    finalize(obj, func, *args, **kwargs) returns a callable finalizer
    object which will be called when obj is garbage collected. The
    first time the finalizer is called it evaluates func(*arg, **kwargs)
    and returns the result. After this the finalizer is dead, and
    calling it just returns None.

    When the program exits any remaining finalizers for which the
    atexit attribute is true will be run in reverse order of creation.
    By default atexit is true.
    rFc
@seZ
dZd
ZdS)zfinalize._Info)�weakrefr&rort�atexit�indexN)r2r3r4r6rrrr�_Infos
r�cOs>
t|�
d
kr|^}}}}n�|s(t
d�
�
n�d|
krDt
dt|�
d�
�
|
�d�
}t|�
dkr~|^}}}ddl}|jdtdd	�
nFd
|
kr�t
dt|�
d�
�
|
�d
�
}|^
}}ddl}|jdtdd	�
t|�
}|js�ddl}|�	|j
�

dt_|��}t
||�|_||_||_|
�
pd|_d|_t|j�
|_||j|<dt_dS)
N�z<descriptor '__init__' of 'finalize' object needs an argumentr&z9finalize expected at least 2 positional arguments, got %d�
�r
z0Passing 'func' as keyword argument is deprecated)
�
stacklevelr%z/Passing 'obj' as keyword argument is deprecatedT)rQr rF�warnings�warn�DeprecationWarning�tuple�_registered_with_atexitr��register�	_exitfuncrr�rr�r&rort�next�_index_iterr��	_registry�_dirty)rortrr%r&r�r��inforrrrEsR







�






�


�




�











zfinalize.__init__z&($self, obj, func, /, *args, **kwargs)NcCs0|j�
|d
�}|r,|js,|j|j|jp(i�
Sd
S)zZIf alive then mark as dead and return func(*args, **kwargs);
        otherwise return NoneN)r�rF�	_shutdownr&rort)r�
_r�rrrr)1s


zfinalize.__call__c
CsH|j�
|�
}
|
o|
��}|d
k	rD|j�|d
�rD||
j|
j|
jp@ifSd
S)z^If alive then mark as dead and return (obj, func, args, kwargs);
        otherwise return NoneN)r�rer�rFr&rort�rr�r%rrr�detach8s


zfinalize.detachc
Cs:|j�
|�
}
|
o|
��}|d
k	r6||
j|
j|
jp2ifSd
S)zMIf alive then return (obj, func, args, kwargs);
        otherwise return NoneN)r�rer�r&rortr�rrr�peek@s


z
finalize.peekc

Cs
||jkS)
zWhether finalizer is alive)
r�rRrrr�aliveHszfinalize.alivec
Cs|j�
|�
}
t|
�
o|
jS)
z*Whether finalizer should be called at exit�r�re�boolr�)rr�rrrr�Ms
zfinalize.atexitcCs|j�
|�
}|rt|
�
|_dSr'r�)rr[r�rrrr�Ss

c
Cs^|j�
|�
}
|
o|
��}|dkr6d
t|�
jt|�
fSdt|�
jt|�
t|�
jt|�
fSdS)Nz<%s object at %#x; dead>z!<%s object at %#x; for %r at %#x>)r�rer�r"r2rWr�rrrrXYs




�zfinalize.__repr__c
Cs2d
d�|j�
�D�
}
|
jdd�d�

dd�|
D�
S)Nc
Ssg|]\}
}|jr|
|f�qSr)
r��r|�
f�
irrrr~esz-finalize._select_for_exit.<locals>.<listcomp>c

Ss
|d
jS)Nr�)
r�)
�itemrrr�<lambda>f�z+finalize._select_for_exit.<locals>.<lambda>ryc
Ssg|]\}
}|
�qSrrr�rrrr~gs)r�r]�sort)r$�
Lrrr�_select_for_exitbs

zfinalize._select_for_exitc
Cs�d
}
z�|jr�ddl}|��r(d}
|��
d}|dks:tjrH|��}d
t_|sNq�|�	�}z
|�
Wn"t
k
r�


tjt�
��
YnX||jks,t�
q,W5dt_
|
r�|��
XdS)NFTr
)rr�Zenabler��gcZ	isenabledZdisabler�r�rF�	Exception�sys�
excepthook�exc_info�AssertionError)r$Zreenable_gcr�Zpendingr�rrrr�is,


















zfinalize._exitfunc)
N)r2r3r4r5r6r�r��	itertools�countr�r�r�r�rE�__text_signature__r)r�r��propertyr�r��setterrX�classmethodr�r�rrrrr�
s0





*






	


)r5�_weakrefrrrrrrrr	Z_weakrefsetr
r�_collections_abcr�r�r
�__all__r�MutableMappingrrYrrrrrr�<module>
s0(





�6^