summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorRaymond Hettinger <python@rcn.com>2010-09-12 05:15:22 (GMT)
committerRaymond Hettinger <python@rcn.com>2010-09-12 05:15:22 (GMT)
commitdc08a143e00d60aa0ce6ee946ad343b9ec2f80da (patch)
treeb039885d5aa71db994cb69b350a74d1c6fa858ac
parentfa11db0a02f22f8141206102efc21b125989364d (diff)
downloadcpython-dc08a143e00d60aa0ce6ee946ad343b9ec2f80da.zip
cpython-dc08a143e00d60aa0ce6ee946ad343b9ec2f80da.tar.gz
cpython-dc08a143e00d60aa0ce6ee946ad343b9ec2f80da.tar.bz2
Issue #9826: Handle recursive repr in collections.OrderedDict.
-rw-r--r--Lib/collections.py16
-rw-r--r--Lib/test/test_collections.py7
-rw-r--r--Misc/NEWS3
3 files changed, 22 insertions, 4 deletions
diff --git a/Lib/collections.py b/Lib/collections.py
index 56ae2a3..1126fb1 100644
--- a/Lib/collections.py
+++ b/Lib/collections.py
@@ -41,6 +41,7 @@ class OrderedDict(dict, MutableMapping):
'''
if len(args) > 1:
raise TypeError('expected at most 1 arguments, got %d' % len(args))
+ self.__in_repr = False # detects recursive repr
try:
self.__root
except AttributeError:
@@ -95,10 +96,10 @@ class OrderedDict(dict, MutableMapping):
def __reduce__(self):
'Return state information for pickling'
items = [[k, self[k]] for k in self]
- tmp = self.__map, self.__root
- del self.__map, self.__root
+ tmp = self.__map, self.__root, self.__in_repr
+ del self.__map, self.__root, self.__in_repr
inst_dict = vars(self).copy()
- self.__map, self.__root = tmp
+ self.__map, self.__root, self.__in_repr = tmp
if inst_dict:
return (self.__class__, (items,), inst_dict)
return self.__class__, (items,)
@@ -167,9 +168,16 @@ class OrderedDict(dict, MutableMapping):
def __repr__(self):
'od.__repr__() <==> repr(od)'
+ if self.__in_repr:
+ return '...'
if not self:
return '%s()' % (self.__class__.__name__,)
- return '%s(%r)' % (self.__class__.__name__, list(self.items()))
+ self.__in_repr = True
+ try:
+ result = '%s(%r)' % (self.__class__.__name__, list(self.items()))
+ finally:
+ self.__in_repr = False
+ return result
def copy(self):
'od.copy() -> a shallow copy of od'
diff --git a/Lib/test/test_collections.py b/Lib/test/test_collections.py
index 7beb061..514dc39 100644
--- a/Lib/test/test_collections.py
+++ b/Lib/test/test_collections.py
@@ -951,6 +951,13 @@ class TestOrderedDict(unittest.TestCase):
self.assertEqual(eval(repr(od)), od)
self.assertEqual(repr(OrderedDict()), "OrderedDict()")
+ def test_repr_recursive(self):
+ # See issue #9826
+ od = OrderedDict.fromkeys('abc')
+ od['x'] = od
+ self.assertEqual(repr(od),
+ "OrderedDict([('a', None), ('b', None), ('c', None), ('x', ...)])")
+
def test_setdefault(self):
pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)]
shuffle(pairs)
diff --git a/Misc/NEWS b/Misc/NEWS
index ab4a06f..c49c96e 100644
--- a/Misc/NEWS
+++ b/Misc/NEWS
@@ -32,6 +32,9 @@ Core and Builtins
Library
-------
+- Issue #9826: OrderedDict.__repr__ can now handle self-referential
+ values: d['x'] = d.
+
- Issue #9825: Using __del__ in the definition of collections.OrderedDict made
it possible for the user to create self-referencing ordered dictionaries
which become permanently uncollectable GC garbage. Reinstated the Py3.1