← Back
Editing: weakref.cpython-35.pyc
��Yf�O � @ s( d Z d d l m Z m Z m Z m Z m Z m Z m Z m Z d d l m Z m Z d d l Z d d l Z d d l Z e e f Z d d d d d d d d d d d d d g Z Gd d � d e � Z Gd d � d e j � Z Gd d � d e � Z Gd d � d e j � Z Gd d � d � Z d S)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�_IterationGuardNr r r r �WeakKeyDictionaryr r r � ProxyTypes�WeakValueDictionaryr � WeakMethod�finalizec s^ e Z d Z d Z d Z d d d � Z � f d d � Z d d � Z d d � Z e j 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� y | j } | j } Wn0 t k rH t d j t | � � � d � Yn X� � f d d � } t j | | | � } t | | � | _ t | � | _ d | _ t | � � | S)Nz)argument should be a bound method, not {}c s5 � � } | j r1 d | _ � d k r1 � | � d S)NF)r )�arg�self)�callback�self_wr� �,/opt/alt/python35/lib64/python3.5/weakref.py�_cb3 s z WeakMethod.__new__.<locals>._cbT) �__self__�__func__�AttributeError� TypeError�format�typer �__new__r r r )�cls�methr �obj�funcr r r )r r r r" , s zWeakMethod.__new__c sG t � j � } | j � } | d k s3 | d k r7 d S| j | | � S)N)�super�__call__r r )r r% r& )� __class__r r r( B s zWeakMethod.__call__c C sS t | t � rO | j s# | j r- | | k St j | | � oN | j | j k Sd S)NF)� isinstancer r r �__eq__r )r �otherr r r r+ I s "zWeakMethod.__eq__c C sS t | t � rO | j s# | j r- | | k St j | | � pN | j | j k Sd S)NT)r* r r r �__ne__r )r r, r r r r- P s "zWeakMethod.__ne__)r r r r ) �__name__� __module__� __qualname__�__doc__� __slots__r" r( r+ r- r �__hash__r r )r) r r $ s c @ s e Z d Z d Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z e Z d d � Z d d d � Z d d � Z d d � Z e Z d d � Z d d � Z d! d" � Z d# d$ � Z d d% d& � Z d' d( � Z d) d* � Z d S)+r z�Mapping class that references values weakly. Entries in the dictionary will be discarded when no strong reference to the value exists anymore c s� | s t d � � | ^ } } t | � d k rF t d t | � � � t | � t � f d d � } | | _ g | _ t � | _ i | _ � | j | | � d S)NzGdescriptor '__init__' of 'WeakValueDictionary' object needs an argument� z$expected at most 1 arguments, got %dc sH | � } | d k rD | j r4 | j j | j � n | � | j � d S)N)� _iterating�_pending_removals�append�key)�wr�selfref�_atomic_removalr )�dr r �removem s z,WeakValueDictionary.__init__.<locals>.remove) r �lenr r �_remover6 �setr5 �data�update)�args�kwr r= r )r< r �__init__f s z WeakValueDictionary.__init__c C s< | j } | j } x# | r7 | j � } t | | � q Wd S)N)r6 rA �popr )r �lr< r8 r r r �_commit_removals} s z$WeakValueDictionary._commit_removalsc C sF | j r | j � | j | � } | d k r> t | � � n | Sd S)N)r6 rH rA �KeyError)r r8 �or r r � __getitem__� s z WeakValueDictionary.__getitem__c C s! | j r | j � | j | =d S)N)r6 rH rA )r r8 r r r � __delitem__� s z WeakValueDictionary.__delitem__c C s | j r | j � t | j � S)N)r6 rH r> rA )r r r r �__len__� s zWeakValueDictionary.__len__c C sJ | j r | j � y | j | � } Wn t k r? d SYn X| d k S)NF)r6 rH rA rI )r r8 rJ r r r � __contains__� s z WeakValueDictionary.__contains__c C s d | j j t | � f S)Nz <%s at %#x>)r) r. �id)r r r r �__repr__� s z WeakValueDictionary.__repr__c C s3 | j r | j � t | | j | � | j | <d S)N)r6 rH �KeyedRefr? rA )r r8 �valuer r r � __setitem__� s z WeakValueDictionary.__setitem__c C s_ | j r | j � t � } x< | j j � D]+ \ } } | � } | d k r, | | | <q, W| S)N)r6 rH r rA �items)r �newr8 r9 rJ r r r �copy� s zWeakValueDictionary.copyc C s{ d d l m } | j r# | j � | j � } xE | j j � D]4 \ } } | � } | d k r? | | | | | � <q? W| S)Nr )�deepcopy)rV rW r6 rH r) rA rT )r �memorW rU r8 r9 rJ r r r � __deepcopy__� s z WeakValueDictionary.__deepcopy__Nc C s^ | j r | j � y | j | } Wn t k r< | SYn X| � } | d k rV | S| Sd S)N)r6 rH rA rI )r r8 �defaultr9 rJ r r r �get� s zWeakValueDictionary.getc c sk | j r | j � t | � �E x= | j j � D], \ } } | � } | d k r0 | | f Vq0 WWd QRXd S)N)r6 rH r rA rT )r �kr9 �vr r r rT � s zWeakValueDictionary.itemsc c s_ | j r | j � t | � �9 x1 | j j � D] \ } } | � d k r0 | Vq0 WWd QRXd S)N)r6 rH r rA rT )r r\ r9 r r r �keys� s zWeakValueDictionary.keysc c s= | j r | j � t | � � | j j � Ed HWd QRXd 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)r6 rH r rA �values)r r r r � itervaluerefs� s z!WeakValueDictionary.itervaluerefsc c s_ | j r | j � t | � �9 x1 | j j � D] } | � } | d k r0 | Vq0 WWd QRXd S)N)r6 rH r rA r_ )r r9 r% r r r r_ � s zWeakValueDictionary.valuesc C sR | j r | j � x8 | j j � \ } } | � } | d k r | | f Sq Wd S)N)r6 rH rA �popitem)r r8 r9 rJ r r r ra � s zWeakValueDictionary.popitemc G sx | j r | j � y | j j | � � } Wn t k rF d } Yn X| d k rp | ra | d St | � � n | Sd S)Nr )r6 rH rA rF rI )r r8 rC rJ r r r rF s zWeakValueDictionary.popc C sv y | j | � } Wn t k r. d } Yn X| d k rn | j rN | j � t | | j | � | j | <| S| Sd S)N)rA rI r6 rH rQ r? )r r8 rZ rJ r r r � setdefault s z WeakValueDictionary.setdefaultc O s� | s t d � � | ^ } } t | � d k rF t d t | � � � | rV | d n d } | j ro | j � | j } | d k r� t | d � s� t i � | � } x3 | j � D]% \ } } t | | j | � | | <q� Wt | � r� | j | � d S)NzEdescriptor 'update' of 'WeakValueDictionary' object needs an argumentr4 z$expected at most 1 arguments, got %dr rT ) r r> r6 rH rA �hasattrr! rT rQ r? rB )rC �kwargsr �dictr< r8 rJ r r r rB s zWeakValueDictionary.updatec C s& | j r | j � t | j 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. )r6 rH �listrA r_ )r r r r � valuerefs3 s z WeakValueDictionary.valuerefs)r. r/ r0 r1 rE rH rK rL rM rN rP rS rV �__copy__rY r[ rT r^ �__iter__r` r_ ra rF rb rB rg r r r r r Z s. c s: e Z d Z d Z d Z d d � Z � f d d � Z � S)rQ 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. r8 c C s" t j | | | � } | | _ | S)N)r r" r8 )r! �obr r8 r r r r r" N s zKeyedRef.__new__c s t � j | | � d S)N)r' rE )r rj r r8 )r) r r rE S s zKeyedRef.__init__)r8 )r. r/ r0 r1 r2 r" rE r r )r) r rQ B s rQ c @ s e Z d Z d Z d d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z e Z d d � Z d d d � Z d d � Z d d � Z d d � Z e Z d d � Z d! d" � Z d# d$ � Z d% d& � Z d d' d( � Z d d) d* � Z d S)+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 sb i | _ t | � d d � } | | _ g | _ t � | _ d | _ | d k r^ | j | � d S)Nc S s? | � } | d k r; | j r1 | j j | � n | j | =d S)N)r5 r6 r7 rA )r\ r: r r r r r= d s z*WeakKeyDictionary.__init__.<locals>.removeF)rA r r? r6 r@ r5 � _dirty_lenrB )r re r= r r r rE b s zWeakKeyDictionary.__init__c C sI | j } | j } x0 | rD y | | j � =Wq t k r@ Yq Xq Wd S)N)r6 rA rF rI )r rG r< r r r rH s s z"WeakKeyDictionary._commit_removalsc s5 | j � � f d d � | j D� | _ d | _ d S)Nc s" g | ] } | � k r | � q Sr r )�.0r\ )r< r r � <listcomp>� s z5WeakKeyDictionary._scrub_removals.<locals>.<listcomp>F)rA r6 rk )r r )r< r �_scrub_removals� s z!WeakKeyDictionary._scrub_removalsc C s d | _ | j t | � =d S)NT)rk rA r )r r8 r r r rL � s z WeakKeyDictionary.__delitem__c C s | j t | � S)N)rA r )r r8 r r r rK � s z WeakKeyDictionary.__getitem__c C s6 | j r | j r | j � t | j � t | j � S)N)rk r6 rn r> rA )r r r r rM � s zWeakKeyDictionary.__len__c C s d | j j t | � f S)Nz <%s at %#x>)r) r. rO )r r r r rP � s zWeakKeyDictionary.__repr__c C s | | j t | | j � <d S)N)rA r r? )r r8 rR r r r rS � s z WeakKeyDictionary.__setitem__c C sL t � } x< | j j � D]+ \ } } | � } | d k r | | | <q W| S)N)r rA rT )r rU r8 rR rJ r r r rV � s zWeakKeyDictionary.copyc C sh d d l m } | j � } xE | j j � D]4 \ } } | � } | d k r, | | | � | | <q, W| S)Nr )rW )rV rW r) rA rT )r rX rW rU r8 rR rJ r r r rY � s z WeakKeyDictionary.__deepcopy__c C s | j j t | � | � S)N)rA r[ r )r r8 rZ r r r r[ � s zWeakKeyDictionary.getc C s6 y t | � } Wn t k r( d SYn X| | j k S)NF)r r rA )r r8 r9 r r r rN � s z WeakKeyDictionary.__contains__c c sX t | � �E x= | j j � D], \ } } | � } | d k r | | f Vq WWd QRXd S)N)r rA rT )r r9 rR r8 r r r rT � s zWeakKeyDictionary.itemsc c sF t | � �3 x+ | j D] } | � } | d k r | Vq WWd QRXd S)N)r rA )r r9 r% r r r r^ � s zWeakKeyDictionary.keysc c sL t | � �9 x1 | j j � D] \ } } | � d k r | Vq WWd QRXd S)N)r rA rT )r r9 rR r r r r_ � 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. )rf rA )r r r r �keyrefs� s zWeakKeyDictionary.keyrefsc C sH d | _ x8 | j j � \ } } | � } | d k r | | f Sq Wd S)NT)rk rA ra )r r8 rR rJ r r r ra � s zWeakKeyDictionary.popitemc G s" d | _ | j j t | � | � S)NT)rk rA rF r )r r8 rC r r r rF � s zWeakKeyDictionary.popc C s | j j t | | j � | � S)N)rA rb r r? )r r8 rZ r r r rb � s z WeakKeyDictionary.setdefaultc K s� | j } | d k ri t | d � s6 t i � | � } x0 | j � D]" \ } } | | t | | j � <qC Wt | � r� | j | � d S)NrT )rA rc r! rT r r? r> rB )r re rd r< r8 rR r r r rB � s zWeakKeyDictionary.update)r. r/ r0 r1 rE rH rn rL rK rM rP rS rV rh rY r[ rN rT r^ ri r_ ro ra rF rb rB r r r r r W s. c @ s� e Z d Z d Z f Z i Z d Z e j � Z d Z d Z Gd d � d � Z d d � Z d d d � Z d d � Z d d � Z e d d � � Z e d d � � Z e j d d � � Z d d � Z e d d � � Z e d d � � Z d 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. Fc @ s e Z d Z d Z d S) zfinalize._Info�weakrefr& rC rd �atexit�indexN)rp r& rC rd rq rr )r. r/ r0 r2 r r r r �_Info s rs c O s� | j s. d d l } | j | j � d t _ | j � } t | | � | _ | | _ | | _ | pg d | _ d | _ t | j � | _ | | j | <d t _ d S)Nr T)�_registered_with_atexitrq �register� _exitfuncr rs r rp r& rC rd �next� _index_iterrr � _registry�_dirty)r r% r& rC rd rq �infor r r rE s zfinalize.__init__Nc C sE | j j | d � } | rA | j rA | j | j | j p= i � Sd S)zZIf alive then mark as dead and return func(*args, **kwargs); otherwise return NoneN)ry rF � _shutdownr& rC rd )r �_r{ r r r r( s zfinalize.__call__c C sh | j j | � } | o! | j � } | d k rd | j j | d � rd | | j | j | j p` i f Sd S)z^If alive then mark as dead and return (obj, func, args, kwargs); otherwise return NoneN)ry r[ rp rF r& rC rd )r r{ r% r r r �detach& s !zfinalize.detachc C sS | j j | � } | o! | j � } | d k rO | | j | j | j pK i f Sd S)zMIf alive then return (obj, func, args, kwargs); otherwise return NoneN)ry r[ rp r& rC rd )r r{ r% r r r �peek. s z finalize.peekc C s | | j k S)zWhether finalizer is alive)ry )r r r r �alive6 s zfinalize.alivec C s% | j j | � } t | � o$ | j S)z*Whether finalizer should be called at exit)ry r[ �boolrq )r r{ r r r rq ; s zfinalize.atexitc C s+ | j j | � } | r' t | � | _ d S)N)ry r[ r� rq )r rR r{ r r r rq A s c C s� | j j | � } | o! | j � } | d k rM d t | � j t | � f Sd t | � j t | � t | � j t | � f Sd S)Nz<%s object at %#x; dead>z!<%s object at %#x; for %r at %#x>)ry r[ rp r! r. rO )r r{ r% r r r rP G s zfinalize.__repr__c C sC d d � | j j � D� } | j d d d � � d d � | D� S)Nc S s+ g | ]! \ } } | j r | | f � q Sr )rq )rl �f�ir r r rm S s z-finalize._select_for_exit.<locals>.<listcomp>r8 c S s | d j S)Nr4 )rr )�itemr r r �<lambda>T s z+finalize._select_for_exit.<locals>.<lambda>c S s g | ] \ } } | � q Sr r )rl r� r� r r r rm U s )ry rT �sort)r# �Lr r r �_select_for_exitP s zfinalize._select_for_exitc C s� d } z� | j r� d d l } | j � r: d } | j � d } x� | d k sX t j rm | j � } d t _ | st P| j � } y | � Wn% t k r� t j t j � � Yn X| | j k sC t � qC WWd d t _ | r� | j � Xd S)NFr T)ry �gc� isenabled�disabler rz r� rF � Exception�sys� excepthook�exc_info�AssertionErrorr| �enable)r# � reenable_gcr� �pendingr� r r r rv W s. zfinalize._exitfunc)r. r/ r0 r1 r2 ry r| � itertools�countrx rz rt rs rE r( r~ r �propertyr� rq �setterrP � classmethodr� rv r r r r r � s$ )r1 �_weakrefr r r r r r r r � _weakrefsetr r � collectionsr� r� r �__all__r �MutableMappingr rQ r r r r r r �<module> s : 6��
Save File
Cancel