Your IP : 3.21.46.129
a
R�f8T � @ s� d Z ddlmZmZmZmZmZmZmZm Z ddl
m Z m Z ddl
Z
ddlZddlZeefZg d�Ze
j�e � e
j�e � G dd� de�ZG dd � d e
j�ZG d
d � d e�ZG d d
� d
e
j�ZG dd� d�ZdS )z|Weak reference support for Python.
This module is an implementation of PEP 205:
https://www.python.org/dev/peps/pep-0205/
� )�getweakrefcount� getweakrefs�ref�proxy�CallableProxyType� ProxyType�
ReferenceType�_remove_dead_weakref)�WeakSet�_IterationGuardN)
r r r r �WeakKeyDictionaryr r r �
ProxyTypes�WeakValueDictionaryr
�
WeakMethod�finalizec sD e Zd ZdZdZd dd�Z� fdd�Zdd � Zd
d � Ze j
Z
� Z S )
r z�
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__Nc s| z|j }|j}W n& ty6 td�t|���d �Y n0 � �fdd�}t�| ||�}t||�|_t|�|_ d|_
t|��|S )Nz)argument should be a bound method, not {}c s& �� }|j r"d|_ � d ur"� |� d S �NF)r )�arg�self��callbackZself_wr� �,/opt/alt/python39/lib64/python3.9/weakref.py�_cb6 s
z WeakMethod.__new__.<locals>._cbT) �__self__�__func__�AttributeError� TypeError�format�typer �__new__r r r )�clsZmethr �obj�funcr r r r r r# / s
��
zWeakMethod.__new__c s2 t � �� }| �� }|d u s"|d u r&d S | �||�S �N)�super�__call__r r )r r% r& �� __class__r r r) E s
zWeakMethod.__call__c C s: t |t�r6| jr|js | |u S t�| |�o4| j|jkS tS r' )�
isinstancer r r �__eq__r �NotImplemented�r �otherr r r r- L s
zWeakMethod.__eq__c C s: t |t�r6| jr|js | |uS t�| |�p4| j|jkS tS r' )r, r r r �__ne__r r. r/ r r r r1 S s
zWeakMethod.__ne__)N) �__name__�
__module__� __qualname__�__doc__� __slots__r# r) r- r1 r �__hash__�
__classcell__r r r* r r ' s
r c @ s� e Zd ZdZd2dd�Zefdd�Zdd� Zd d
� Zd d � Z d
d� Z
dd� Z dd� Z dd� Z
e
Zdd� Zd3dd�Zdd� Zd d � ZeZd d � Zd d!� Zd"d#� Zd$d%� Zd4d&d'�Zd5d(d)�Zd*d+� Zd,d-� Zd.d/� Z d0d1� Z dS )6r z�Mapping class that references values weakly.
Entries in the dictionary will be discarded when no strong
reference to the value exists anymore
r c K sB t | �tfdd�}|| _g | _t� | _i | _| j|fi |�� d S )Nc S s6 |� }|d ur2|j r$|j�| j� n||j| j� d S r' )�
_iterating�_pending_removals�append�key�data)�wr�selfref�_atomic_removalr r r r �removej s
z,WeakValueDictionary.__init__.<locals>.remove)r r �_remover: �setr9 r= �update)r r0 �kwrA r r r �__init__i s z WeakValueDictionary.__init__c C s> | j j}| j}z
|� }W n ty, Y d S 0 |||� qd S r' )r: �popr= �
IndexError)r r@ rG �dr< r r r �_commit_removalsz s
z$WeakValueDictionary._commit_removalsc C s4 | j r| �� | j| � }|d u r,t|��n|S d S r' �r: rJ r= �KeyError�r r< �or r r � __getitem__� s
z WeakValueDictionary.__getitem__c C s | j r| �� | j|= d S r' )r: rJ r= �r r< r r r � __delitem__� s z WeakValueDictionary.__delitem__c C s | j r| �� t| j�S r' )r: rJ �lenr= �r r r r �__len__� s zWeakValueDictionary.__len__c C s< | j r| �� z| j| � }W n ty2 Y dS 0 |d uS r rK rM r r r � __contains__� s z WeakValueDictionary.__contains__c C s d| j jt| �f S �Nz <%s at %#x>�r+ r2 �idrS r r r �__repr__� s z WeakValueDictionary.__repr__c C s& | j r| �� t|| j|�| j|< d S r' )r: rJ �KeyedRefrB r= �r r< �valuer r r � __setitem__� s z WeakValueDictionary.__setitem__c C sj | j r| �� t� }t| ��: | j�� D ] \}}|� }|d ur(|||< q(W d � n1 s\0 Y |S r' )r: rJ r r r= �items)r �newr< r> rN r r r �copy� s
(zWeakValueDictionary.copyc C s~ ddl m} | jr| �� | �� }t| ��@ | j�� D ]$\}}|� }|d ur6|||||�< q6W d � n1 sp0 Y |S �Nr )�deepcopy)r` rb r: rJ r+ r r= r^ )r �memorb r_ r< r> rN r r r � __deepcopy__� s
.z WeakValueDictionary.__deepcopy__Nc C sN | j r| �� z| j| }W n ty2 | Y S 0 |� }|d u rF|S |S d S r' rK )r r< �defaultr> rN r r r �get� s
zWeakValueDictionary.getc c sf | j r| �� t| ��< | j�� D ] \}}|� }|d ur"||fV q"W d � n1 sX0 Y d S r' �r: rJ r r= r^ )r �kr> �vr r r r^ � s
zWeakValueDictionary.itemsc c s^ | j r| �� t| ��4 | j�� D ]\}}|� d ur"|V q"W d � n1 sP0 Y d S r' rg )r rh r> r r r �keys� s
zWeakValueDictionary.keysc c sJ | j r| �� t| �� | j�� E dH W d � n1 s<0 Y dS )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: rJ r r= �valuesrS r r r �
itervaluerefs� s
z!WeakValueDictionary.itervaluerefsc c s^ | j r| �� t| ��4 | j�� D ]}|� }|d ur"|V q"W d � n1 sP0 Y d S r' rk �r r> r% r r r rl � s
zWeakValueDictionary.valuesc C s8 | j r| �� | j�� \}}|� }|d ur||fS qd S r' )r: rJ r= �popitem)r r< r> rN r r r ro � s zWeakValueDictionary.popitemc G s^ | j r| �� z| j�|�� }W n ty6 d }Y n0 |d u rV|rL|d S t|��n|S d S )Nr )r: rJ r= rG rL )r r< �argsrN r r r rG s
zWeakValueDictionary.popc C s^ z| j | � }W n ty& d }Y n0 |d u rV| jr>| �� t|| j|�| j |< |S |S d S r' )r= rL r: rJ rZ rB )r r< re rN r r r �
setdefault s
z WeakValueDictionary.setdefaultc K sz | j r| �� | j}|d urRt|d�s.t|�}|�� D ]\}}t|| j|�||< q6|�� D ]\}}t|| j|�||< qZd S �Nr^ )r: rJ r= �hasattr�dictr^ rZ rB )r r0 �kwargsrI r< rN r r r rD " s
zWeakValueDictionary.updatec C s | j r| �� 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: rJ �listr= rl rS r r r � valuerefs. s
z WeakValueDictionary.valuerefsc C s | � |� | S r' �rD r/ r r r �__ior__< s
zWeakValueDictionary.__ior__c C s& t |tj�r"| �� }|�|� |S tS r' �r, �_collections_abc�Mappingr` rD r. �r r0 �cr r r �__or__@ s
zWeakValueDictionary.__or__c C s0 t |tj�r,| �� }|�|� |�| � |S tS r' �r, r{ r| r+ rD r. r} r r r �__ror__G s
zWeakValueDictionary.__ror__)r )N)N)N) r2 r3 r4 r5 rF r rJ rO rQ rT rU rY r] r` �__copy__rd rf r^ rj �__iter__rm rl ro rG rq rD rw ry r r� r r r r r ] s4
r c s, e Zd ZdZdZdd� Z� fdd�Z� ZS )rZ a[ 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< c C s t �| ||�}||_|S r' )r r# r< )r" �obr r< r r r r r# \ s zKeyedRef.__new__c s t � �||� d S r' )r( rF )r r� r r< r* r r rF a s zKeyedRef.__init__)r2 r3 r4 r5 r6 r# rF r8 r r r* r rZ P s rZ c @ s� e Zd ZdZd1dd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z e Z
dd� Zd2dd�Zdd� Zdd � Zd d � ZeZd d � Zd!d"� Zd#d$� Zd%d&� Zd3d'd(�Zd4d)d*�Zd+d,� Zd-d.� Zd/d0� Z dS )5r 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.
Nc C sF i | _ t| �fdd�}|| _g | _t� | _d| _|d urB| �|� d S )Nc S sF |� }|d urB|j r"|j�| � n z |j| = W n ty@ Y n0 d S r' )r9 r: r; r= rL )rh r? r r r r rA r s z*WeakKeyDictionary.__init__.<locals>.removeF)r= r rB r: rC r9 �
_dirty_lenrD )r rt rA r r r rF p s
zWeakKeyDictionary.__init__c C sR | j j}| j}z
|� }W n ty, Y d S 0 z
||= W q tyJ Y q0 qd S r' )r: rG r= rH rL )r rG rI r< r r r rJ � s
z"WeakKeyDictionary._commit_removalsc s& | j � � fdd�| jD �| _d| _d S )Nc s g | ]}|� v r|�qS r r )�.0rh �rI r r �
<listcomp>� � z5WeakKeyDictionary._scrub_removals.<locals>.<listcomp>F)r= r: r� rS r r� r �_scrub_removals� s z!WeakKeyDictionary._scrub_removalsc C s d| _ | jt|�= d S �NT)r� r= r rP r r r rQ � s z WeakKeyDictionary.__delitem__c C s | j t|� S r' )r= r rP r r r rO � s z WeakKeyDictionary.__getitem__c C s( | j r| jr| �� t| j�t| j� S r' )r� r: r� rR r= rS r r r rT � s zWeakKeyDictionary.__len__c C s d| j jt| �f S rV rW rS r r r rY � s zWeakKeyDictionary.__repr__c C s || j t|| j�< d S r' )r= r rB r[ r r r r] � s z WeakKeyDictionary.__setitem__c C s\ t � }t| ��: | j�� D ] \}}|� }|d ur|||< qW d � n1 sN0 Y |S r' )r r r= r^ )r r_ r< r\ rN r r r r` � s
(zWeakKeyDictionary.copyc C sp ddl m} | �� }t| ��@ | j�� D ]$\}}|� }|d ur(|||�||< q(W d � n1 sb0 Y |S ra )r` rb r+ r r= r^ )r rc rb r_ r< r\ rN r r r rd � s
.z WeakKeyDictionary.__deepcopy__c C s | j �t|�|�S r' )r= rf r �r r< re r r r rf � s zWeakKeyDictionary.getc C s, z t |�}W n ty Y dS 0 || jv S r )r r r= )r r< r> r r r rU � s
z WeakKeyDictionary.__contains__c c sX t | ��< | j�� D ] \}}|� }|d ur||fV qW d � n1 sJ0 Y d S r' �r r= r^ )r r> r\ r< r r r r^ � s
zWeakKeyDictionary.itemsc c sL t | ��0 | jD ]}|� }|d ur|V qW d � n1 s>0 Y d S r' )r r= rn r r r rj � s
zWeakKeyDictionary.keysc c sP t | ��4 | j�� D ]\}}|� d ur|V qW d � n1 sB0 Y d S r' r� )r r> r\ r r r rl � s
zWeakKeyDictionary.valuesc C s
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.
)rv r= rS r r r �keyrefs� s
zWeakKeyDictionary.keyrefsc C s0 d| _ | j�� \}}|� }|d ur||fS qd S r� )r� r= ro )r r< r\ rN r r r ro � s
zWeakKeyDictionary.popitemc G s d| _ | jjt|�g|�R � S r� )r� r= rG r )r r< rp r r r rG � s zWeakKeyDictionary.popc C s | j �t|| j�|�S r' )r= rq r rB r� r r r rq � s z WeakKeyDictionary.setdefaultc K s\ | j }|d urFt|d�s$ti �|�}|�� D ]\}}||t|| j�< q,t|�rX| �|� d S rr )r= rs r" r^ r rB rR rD )r rt ru rI r< r\ r r r rD � s
zWeakKeyDictionary.updatec C s | � |� | S r' rx r/ r r r ry s
zWeakKeyDictionary.__ior__c C s& t |tj�r"| �� }|�|� |S tS r' rz r} r r r r
s
zWeakKeyDictionary.__or__c C s0 t |tj�r,| �� }|�|� |�| � |S tS r' r� r} r r r r� s
zWeakKeyDictionary.__ror__)N)N)N)N) r2 r3 r4 r5 rF rJ r� rQ rO rT rY r] r` r� rd rf rU r^ rj r� rl r� ro rG rq rD ry r r� r r r r r e s4
r c @ s� e Zd ZdZdZi ZdZe�� Z dZ
dZ G dd� d�Z dd� Z
dd d
�Zd d � Zd
d� Zedd� �Zedd� �Zejdd� �Zdd� Zedd� �Zedd� �ZdS )r a Class 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.
r Fc @ s e Zd ZdZdS )zfinalize._Info)�weakrefr& rp ru �atexit�indexN)r2 r3 r4 r6 r r r r �_Info6 s r� c O sp | j s dd l}|�| j� dt_ | �� }t|| �|_||_||_ |pFd |_
d|_t | j �|_
|| j| < dt_d S )Nr T)�_registered_with_atexitr� �register� _exitfuncr r� r r� r& rp ru �next� _index_iterr� � _registry�_dirty)r r% r& rp ru r� �infor r r rF 9 s
zfinalize.__init__Nc C s4 | j �| d�}|r0| js0|j|ji |jp*i ��S dS )zZIf alive then mark as dead and return func(*args, **kwargs);
otherwise return NoneN)r� rG � _shutdownr& rp ru )r �_r� r r r r) J s
zfinalize.__call__c C sH | j �| �}|o|�� }|durD| j �| d�rD||j|j|jp@i fS dS )z^If alive then mark as dead and return (obj, func, args, kwargs);
otherwise return NoneN)r� rf r� rG r& rp ru �r r� r% r r r �detachQ s zfinalize.detachc C s: | j �| �}|o|�� }|dur6||j|j|jp2i fS dS )zMIf alive then return (obj, func, args, kwargs);
otherwise return NoneN)r� rf r� r& rp ru r� r r r �peekY s z
finalize.peekc C s
| | j v S )zWhether finalizer is alive)r� rS r r r �alivea s zfinalize.alivec C s | j �| �}t|�o|jS )z*Whether finalizer should be called at exit�r� rf �boolr� )r r� r r r r� f s zfinalize.atexitc C s | j �| �}|rt|�|_d S r' r� )r r\ r� r r r r� l s c C s^ | j �| �}|o|�� }|d u r6dt| �jt| �f S dt| �jt| �t|�jt|�f S d S )Nz<%s object at %#x; dead>z!<%s object at %#x; for %r at %#x>)r� rf r� r" r2 rX r� r r r rY r s �zfinalize.__repr__c C s2 dd� | j �� D �}|jdd� d� dd� |D �S )Nc S s g | ]\}}|j r||f�qS r )r� �r� �f�ir r r r� ~ r� z-finalize._select_for_exit.<locals>.<listcomp>c S s
| d j S )N� )r� )�itemr r r �<lambda> r� z+finalize._select_for_exit.<locals>.<lambda>r� c S s g | ] \}}|�qS r r r� r r r r� � r� )r� r^ �sort)r$ �Lr r r �_select_for_exit{ s zfinalize._select_for_exitc C s� d}z�| j r�dd l}|�� r(d}|�� d }|d u s:tjrH| �� }dt_|sNq�|�� }z
|� W n ty� t j
t � � � Y n0 || j vs,J �q,W dt_ |r�|�
� ndt_ |r�|�
� 0 d S )NFr T)r� �gcZ isenabledZdisabler r� r� rG � Exception�sys�
excepthook�exc_infor� Zenable)r$ Z reenable_gcr� Zpendingr� r r r r� � s2
�zfinalize._exitfunc)N)r2 r3 r4 r5 r6 r� r� � itertools�countr� r� r� r� rF r) r� r� �propertyr� r� �setterrY � classmethodr� r� r r r r r s.
r )r5 �_weakrefr r r r r r r r Z _weakrefsetr
r r{ r� r� r
�__all__�Setr� �
MutableSetr �MutableMappingr rZ r r r r r r �<module> s (
6 t 9