Current File : //usr/local/lib/python3.8/__pycache__/weakref.cpython-38.pyc
U
naS
@ s d Z ddlmZmZmZmZmZmZmZm Z ddl
m Z m Z ddl
Z
ddlZddlZeefZddddd d
d d d
ddddg
ZG dd deZG dd de
jZG dd deZG dd d e
jZG dd dZdS )z{Weak reference support for Python.
This module is an implementation of PEP 205:
http://www.python.org/dev/peps/pep-0205/
)getweakrefcount getweakrefsrefproxyCallableProxyType ProxyType
ReferenceType_remove_dead_weakref)WeakSet_IterationGuardNr r r r WeakKeyDictionaryr r r
ProxyTypesWeakValueDictionaryr
WeakMethodfinalizec sD e Zd ZdZdZd ddZ fddZdd 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( tk
r8 tdt|d Y nX fdd}t| ||}t|||_t||_ d|_
t||S )Nz)argument should be a bound method, not {}c s& }|j r"d|_ d k r" | d S NF)r )argselfcallbackself_wr #/usr/local/lib/python3.8/weakref.py_cb3 s
z WeakMethod.__new__.<locals>._cbT) __self____func__AttributeError TypeErrorformattyper __new__r r r )clsmethr objfuncr r r r r r$ , s
zWeakMethod.__new__c s2 t }| }|d ks"|d kr&d S | ||S N)super__call__r r )r r' r( __class__r r r+ B s
zWeakMethod.__call__c C s: t |tr6| jr|js | |kS t| |o4| j|jkS dS r )
isinstancer r r __eq__r r otherr r r r/ I s
zWeakMethod.__eq__c C s: t |tr6| jr|js | |k S t| |p4| j|jkS dS NT)r. r r r __ne__r r0 r r r r3 P s
zWeakMethod.__ne__)N) __name__
__module__ __qualname____doc__ __slots__r$ r+ r/ r3 r __hash__
__classcell__r r r, r r $ s
c @ s e Zd ZdZd,ddZdd Zdd Zd d
Zd d Zd
d Z dd Z
dd Z dd Z e Z
dd Zd-ddZdd Zd d ZeZd d Zd d! Zd"d# Zd$d% Zd.d&d'Zd/d(d)Zd*d+ ZdS )0r zMapping class that references values weakly.
Entries in the dictionary will be discarded when no strong
reference to the value exists anymore
r c K s> t | tfdd}|| _g | _t | _i | _| j|f| d S )Nc S s6 | }|d k r2|j r$|j| j n||j| j d S r) )
_iterating_pending_removalsappendkeydata)wrselfref_atomic_removalr r r r removeg s
z,WeakValueDictionary.__init__.<locals>.remove)r r _remover< setr; r? update)r r1 kwrC r r r __init__f s z WeakValueDictionary.__init__c C s( | j }| j}|r$| }t|| q d S r) )r< r? popr )r ldr> r r r _commit_removalsw s
z$WeakValueDictionary._commit_removalsc C s4 | j r| | j| }|d kr,t|n|S d S r) r< rL r? KeyErrorr r> or r r __getitem__ s
z WeakValueDictionary.__getitem__c C s | j r| | j|= d S r) )r< rL r? r r> r r r __delitem__ s z WeakValueDictionary.__delitem__c C s | j r| t| jS r) )r< rL lenr? r r r r __len__ s zWeakValueDictionary.__len__c C s> | j r| z| j| }W n tk
r4 Y dS X |d k S r rM rO r r r __contains__ s z WeakValueDictionary.__contains__c C s d| j jt| f S Nz <%s at %#x>r- r4 idrU r r r __repr__ s z WeakValueDictionary.__repr__c C s& | j r| t|| j|| j|< d S r) )r< rL KeyedRefrD r? r r> valuer r r __setitem__ s z WeakValueDictionary.__setitem__c C sV | j r| t }t| 0 | j D ] \}}| }|d k r(|||< q(W 5 Q R X |S r) )r< rL r r r? items)r newr> r@ rP r r r copy s
zWeakValueDictionary.copyc C sj ddl m} | jr| | }t| 6 | j D ]$\}}| }|d k r6|||||< q6W 5 Q R X |S Nr )deepcopy)rb rd r< rL r- r r? r` )r memord ra r> r@ rP r r r __deepcopy__ s
z WeakValueDictionary.__deepcopy__Nc C sP | j r| z| j| }W n tk
r4 | Y S X | }|d krH|S |S d S r) rM )r r> defaultr@ rP r r r get s
zWeakValueDictionary.getc c sR | j r| t| 2 | j D ] \}}| }|d k r"||fV q"W 5 Q R X d S r) r< rL r r? r` )r kr@ vr r r r` s
zWeakValueDictionary.itemsc c sJ | j r| t| * | j D ]\}}| d k r"|V q"W 5 Q R X d S r) ri )r rj r@ r r r keys s
zWeakValueDictionary.keysc c s6 | j r| t| | j E dH W 5 Q R X 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.
Nr< rL r r? valuesrU r r r
itervaluerefs s
z!WeakValueDictionary.itervaluerefsc c sJ | j r| t| * | j D ]}| }|d k r"|V q"W 5 Q R X d S r) rm r r@ r' r r r rn s
zWeakValueDictionary.valuesc C s8 | j r| | j \}}| }|d k r||fS qd S r) )r< rL r? popitem)r r> r@ rP r r r rq s zWeakValueDictionary.popitemc G s` | j r| z| j| }W n tk
r8 d }Y nX |d krX|rN|d S t|n|S d S )Nr )r< rL r? rI rN )r r> argsrP r r r rI s
zWeakValueDictionary.popc C s` z| j | }W n tk
r( d }Y nX |d krX| jr@| t|| j|| j |< |S |S d S r) )r? rN r< rL r\ rD )r r> rg rP r r r
setdefault s
z WeakValueDictionary.setdefaultc K sz | j r| | j}|d k rRt|ds.t|}| D ]\}}t|| j|||< q6| D ]\}}t|| j|||< qZd S Nr` )r< rL r? hasattrdictr` r\ rD )r r1 kwargsrK r> rP r r r rF 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< rL listr? rn rU r r r valuerefs( s
z WeakValueDictionary.valuerefs)r )N)N)N)r4 r5 r6 r7 rH rL rQ rS rV rW r[ r_ rb __copy__rf rh r` rl __iter__ro rn rq rI rs rF ry r r r r r Z s.
c s, e Zd ZdZdZdd Z fddZ ZS )r\ 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$ C s zKeyedRef.__new__c s t || d S r) )r* rH )r r} r r> r, r r rH H s zKeyedRef.__init__)r4 r5 r6 r7 r8 r$ rH r: r r r, r r\ 7 s r\ c @ s e Zd ZdZd+ddZdd Zdd Zd d
Zd d Zd
d Z dd Z
dd Z dd Z e Z
dd Zd,ddZdd Zdd Zd d ZeZd d 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.
Nc C sF i | _ t| fdd}|| _g | _t | _d| _|d k rB| | d S )Nc S s. | }|d k r*|j r"|j| n|j| = d S r) )r; r< r= r? )rj rA r r r r rC Y s
z*WeakKeyDictionary.__init__.<locals>.removeF)r? r rD r< rE r;
_dirty_lenrF )r rv rC r r r rH W s zWeakKeyDictionary.__init__c C s: | j }| j}|r6z|| = W q tk
r2 Y q X q d S r) )r< r? rI rN )r rJ rK r r r rL h s z"WeakKeyDictionary._commit_removalsc s& | j fdd| jD | _d| _d S )Nc s g | ]}| kr|qS r r ).0rj rK r r
<listcomp>w s z5WeakKeyDictionary._scrub_removals.<locals>.<listcomp>F)r? r< r~ rU r r r _scrub_removalsu s z!WeakKeyDictionary._scrub_removalsc C s d| _ | jt|= d S r2 )r~ r? r rR r r r rS z s z WeakKeyDictionary.__delitem__c C s | j t| S r) )r? r rR r r r rQ ~ s z WeakKeyDictionary.__getitem__c C s( | j r| jr| t| jt| j S r) )r~ r< r rT r? rU r r r rV s zWeakKeyDictionary.__len__c C s d| j jt| f S rX rY rU r r r r[ s zWeakKeyDictionary.__repr__c C s || j t|| j< d S r) )r? r rD r] r r r r_ s z WeakKeyDictionary.__setitem__c C sH t }t| 0 | j D ] \}}| }|d k r|||< qW 5 Q R X |S r) )r r r? r` )r ra r> r^ rP r r r rb s
zWeakKeyDictionary.copyc C s\ ddl m} | }t| 6 | j D ]$\}}| }|d k r(|||||< q(W 5 Q R X |S rc )rb rd r- r r? r` )r re rd ra r> r^ rP r r r rf s
z WeakKeyDictionary.__deepcopy__c C s | j t||S r) )r? rh r r r> rg r r r rh s zWeakKeyDictionary.getc C s. z t |}W n tk
r" Y dS X || jkS r )r r! r? )r r> r@ r r r rW s
z WeakKeyDictionary.__contains__c c sD t | 2 | j D ] \}}| }|d k r||fV qW 5 Q R X d S r) r r? r` )r r@ r^ r> r r r r` s
zWeakKeyDictionary.itemsc c s8 t | & | jD ]}| }|d k r|V qW 5 Q R X d S r) )r r? rp r r r rl s
zWeakKeyDictionary.keysc c s< t | * | j D ]\}}| d k r|V qW 5 Q R X d S r) r )r r@ r^ r r r rn s
zWeakKeyDictionary.valuesc C s
t | jS )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.
)rx r? rU r r r keyrefs s
zWeakKeyDictionary.keyrefsc C s0 d| _ | j \}}| }|d k r||fS qd S r2 )r~ r? rq )r r> r^ rP r r r rq s
zWeakKeyDictionary.popitemc G s d| _ | jjt|f| S r2 )r~ r? rI r )r r> rr r r r rI s zWeakKeyDictionary.popc C s | j t|| j|S r) )r? rs r rD r r r r rs s z WeakKeyDictionary.setdefaultc K s\ | j }|d k rFt|ds$ti |}| D ]\}}||t|| j< q,t|rX| | d S rt )r? ru r# r` r rD rT rF )r rv rw rK r> r^ r r r rF s
zWeakKeyDictionary.update)N)N)N)N)r4 r5 r6 r7 rH rL r rS rQ rV r[ r_ rb rz rf rh rW r` rl r{ rn r rq rI rs rF r r r r r L s.
c @ s e Zd ZdZdZi ZdZe Z dZ
dZ G dd dZ dd Z
de
_dd
d Zd d
Zdd Zedd Zedd Zejdd Zdd Zedd Zedd Zd S ) 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( rr rw atexitindexN)r4 r5 r6 r8 r r r r _Info s r c O s> t | dkr| ^}}}} n| s(tdnd|krDtdt | d |d}t | dkr~| ^}}} dd l}|jdtdd nFd
|krtdt | d |d
}| ^}} dd l}|jd tdd t| } |jsdd l}| |j
d t _| }t
|||_||_| |_|pd |_d |_t|j|_||j|< d t _d S )
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)rT r! rI warningswarnDeprecationWarningtuple_registered_with_atexitr register _exitfuncr r r r r( rr rw next _index_iterr _registry_dirty)rr rw r r' r( r r infor r r rH sR
zfinalize.__init__z&($self, obj, func, /, *args, **kwargs)Nc C s0 | j | d}|r,| js,|j|j|jp(i S dS )zZIf alive then mark as dead and return func(*args, **kwargs);
otherwise return NoneN)r rI _shutdownr( rr rw )r _r r r r r+ 1 s
zfinalize.__call__c C sH | j | }|o| }|dk rD| j | drD||j|j|jp@i fS dS )z^If alive then mark as dead and return (obj, func, args, kwargs);
otherwise return NoneN)r rh r rI r( rr rw r r r' r r r detach8 s zfinalize.detachc C s: | j | }|o| }|dk r6||j|j|jp2i fS dS )zMIf alive then return (obj, func, args, kwargs);
otherwise return NoneN)r rh r r( rr rw r r r r peek@ s z
finalize.peekc C s
| | j kS )zWhether finalizer is alive)r rU r r r aliveH s zfinalize.alivec C s | j | }t|o|jS )z*Whether finalizer should be called at exitr rh boolr )r r r r r r M s zfinalize.atexitc C s | j | }|rt||_d S r) r )r r^ r r r r r S s c C s^ | j | }|o| }|d kr6dt| 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 rh r r# r4 rZ r r r r r[ Y s zfinalize.__repr__c C s2 dd | j D }|jdd d dd |D S )Nc S s g | ]\}}|j r||fqS r )r r fir r r r e s z-finalize._select_for_exit.<locals>.<listcomp>c S s
| d j S )Nr )r )itemr r r <lambda>f z+finalize._select_for_exit.<locals>.<lambda>r| c S s g | ] \}}|qS r r r r r r r g s )r r` sort)r% Lr r r _select_for_exitb s zfinalize._select_for_exitc C s d}z| jrdd l}| r(d}| d }|d ks:t jrH| }dt _|sNq| }z
| W n" t
k
r t j t
Y nX || jks,tq,W 5 dt _|r| X d S )NFTr )r r enabler gc isenableddisabler r rI Exceptionsys
excepthookexc_infoAssertionError)r% reenable_gcr pendingr r r r r i s,
zfinalize._exitfunc)N)r4 r5 r6 r7 r8 r r itertoolscountr r r r rH __text_signature__r+ r r propertyr r setterr[ classmethodr r r r r r r s0 *
)r7 _weakrefr r r r r r r r _weakrefsetr
r _collections_abcr r r
__all__r MutableMappingr r\ r r r r r r <module> s0 (
6 ^
Mini Shell