diff options
author | Fred Drake <fdrake@acm.org> | 2004-07-02 18:57:45 (GMT) |
---|---|---|
committer | Fred Drake <fdrake@acm.org> | 2004-07-02 18:57:45 (GMT) |
commit | 0a4dd390bf653128de8bc2e99da64967c8cdf86e (patch) | |
tree | 9c3b3989bc85eda1277464459cda1eae87f5d7a5 /Lib/weakref.py | |
parent | 813914049de32303ce31cae11abe9c5a49a08a4e (diff) | |
download | cpython-0a4dd390bf653128de8bc2e99da64967c8cdf86e.zip cpython-0a4dd390bf653128de8bc2e99da64967c8cdf86e.tar.gz cpython-0a4dd390bf653128de8bc2e99da64967c8cdf86e.tar.bz2 |
Make weak references subclassable:
- weakref.ref and weakref.ReferenceType will become aliases for each
other
- weakref.ref will be a modern, new-style class with proper __new__
and __init__ methods
- weakref.WeakValueDictionary will have a lighter memory footprint,
using a new weakref.ref subclass to associate the key with the
value, allowing us to have only a single object of overhead for each
dictionary entry (currently, there are 3 objects of overhead per
entry: a weakref to the value, a weakref to the dictionary, and a
function object used as a weakref callback; the weakref to the
dictionary could be avoided without this change)
- a new macro, PyWeakref_CheckRefExact(), will be added
- PyWeakref_CheckRef() will check for subclasses of weakref.ref
This closes SF patch #983019.
Diffstat (limited to 'Lib/weakref.py')
-rw-r--r-- | Lib/weakref.py | 50 |
1 files changed, 34 insertions, 16 deletions
diff --git a/Lib/weakref.py b/Lib/weakref.py index 510cd7c..cfe9456 100644 --- a/Lib/weakref.py +++ b/Lib/weakref.py @@ -42,6 +42,14 @@ class WeakValueDictionary(UserDict.UserDict): # objects are unwrapped on the way out, and we always wrap on the # way in). + def __init__(self, *args, **kw): + UserDict.UserDict.__init__(self, *args, **kw) + def remove(wr, selfref=ref(self)): + self = selfref() + if self is not None: + del self.data[wr.key] + self._remove = remove + def __getitem__(self, key): o = self.data[key]() if o is None: @@ -53,7 +61,7 @@ class WeakValueDictionary(UserDict.UserDict): return "<WeakValueDictionary at %s>" % id(self) def __setitem__(self, key, value): - self.data[key] = ref(value, self.__makeremove(key)) + self.data[key] = KeyedRef(value, self._remove, key) def copy(self): new = WeakValueDictionary() @@ -117,7 +125,7 @@ class WeakValueDictionary(UserDict.UserDict): try: wr = self.data[key] except KeyError: - self.data[key] = ref(default, self.__makeremove(key)) + self.data[key] = KeyedRef(default, self._remove, key) return default else: return wr() @@ -128,7 +136,7 @@ class WeakValueDictionary(UserDict.UserDict): if not hasattr(dict, "items"): dict = type({})(dict) for key, o in dict.items(): - d[key] = ref(o, self.__makeremove(key)) + d[key] = KeyedRef(o, self._remove, key) if len(kwargs): self.update(kwargs) @@ -140,12 +148,26 @@ class WeakValueDictionary(UserDict.UserDict): L.append(o) return L - def __makeremove(self, key): - def remove(o, selfref=ref(self), key=key): - self = selfref() - if self is not None: - del self.data[key] - return remove + +class KeyedRef(ref): + """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. + + """ + + __slots__ = "key", + + def __new__(type, ob, callback, key): + self = ref.__new__(type, ob, callback) + self.key = key + return self + + def __init__(self, ob, callback, key): + super(KeyedRef, self).__init__(ob, callback) class WeakKeyDictionary(UserDict.UserDict): @@ -298,15 +320,11 @@ class WeakValuedValueIterator(BaseIter): class WeakValuedItemIterator(BaseIter): def __init__(self, weakdict): - self._next = weakdict.data.iteritems().next + self._next = weakdict.data.itervalues().next def next(self): while 1: - key, wr = self._next() + wr = self._next() value = wr() if value is not None: - return key, value - - -# no longer needed -del UserDict + return wr.key, value |