diff options
author | Miss Islington (bot) <31488909+miss-islington@users.noreply.github.com> | 2018-02-26 14:42:00 (GMT) |
---|---|---|
committer | GitHub <noreply@github.com> | 2018-02-26 14:42:00 (GMT) |
commit | fbf7aac36bd1017bc87964b5d17dce0e101ff2d6 (patch) | |
tree | 0b0cf881f870040087cb51cbbf4e614058912394 /Lib | |
parent | 5a07608d0855e4104e4070328155b52010dec4e7 (diff) | |
download | cpython-fbf7aac36bd1017bc87964b5d17dce0e101ff2d6.zip cpython-fbf7aac36bd1017bc87964b5d17dce0e101ff2d6.tar.gz cpython-fbf7aac36bd1017bc87964b5d17dce0e101ff2d6.tar.bz2 |
bpo-18533: Avoid RecursionError from repr() of recursive dictview (GH-4823)
dictview_repr(): Use a Py_ReprEnter() / Py_ReprLeave() pair to check
for recursion, and produce "..." if so.
test_recursive_repr(): Check for the string rather than a
RecursionError. (Test cannot be any tighter as contents are
implementation-dependent.)
test_deeply_nested_repr(): Add new test, replacing the original
test_recursive_repr(). It checks that a RecursionError is raised in
the case of a non-recursive but deeply nested structure. (Very
similar to what test_repr_deep() in test/test_dict.py does for a
normal dict.)
OrderedDictTests: Add new test case, to test behavior on OrderedDict
instances containing their own values() or items().
(cherry picked from commit d7773d92bd11640a8c950d6c36a9cef1cee36f96)
Diffstat (limited to 'Lib')
-rw-r--r-- | Lib/test/test_dictviews.py | 15 | ||||
-rw-r--r-- | Lib/test/test_ordered_dict.py | 14 |
2 files changed, 29 insertions, 0 deletions
diff --git a/Lib/test/test_dictviews.py b/Lib/test/test_dictviews.py index 49a9e9c..0807476 100644 --- a/Lib/test/test_dictviews.py +++ b/Lib/test/test_dictviews.py @@ -1,6 +1,7 @@ import collections import copy import pickle +import sys import unittest class DictSetTest(unittest.TestCase): @@ -202,6 +203,20 @@ class DictSetTest(unittest.TestCase): def test_recursive_repr(self): d = {} d[42] = d.values() + r = repr(d) + # Cannot perform a stronger test, as the contents of the repr + # are implementation-dependent. All we can say is that we + # want a str result, not an exception of any sort. + self.assertIsInstance(r, str) + d[42] = d.items() + r = repr(d) + # Again. + self.assertIsInstance(r, str) + + def test_deeply_nested_repr(self): + d = {} + for i in range(sys.getrecursionlimit() + 100): + d = {42: d.values()} self.assertRaises(RecursionError, repr, d) def test_copy(self): diff --git a/Lib/test/test_ordered_dict.py b/Lib/test/test_ordered_dict.py index 93f812a..b396426 100644 --- a/Lib/test/test_ordered_dict.py +++ b/Lib/test/test_ordered_dict.py @@ -355,6 +355,20 @@ class OrderedDictTests: self.assertEqual(repr(od), "OrderedDict([('a', None), ('b', None), ('c', None), ('x', ...)])") + def test_repr_recursive_values(self): + OrderedDict = self.OrderedDict + od = OrderedDict() + od[42] = od.values() + r = repr(od) + # Cannot perform a stronger test, as the contents of the repr + # are implementation-dependent. All we can say is that we + # want a str result, not an exception of any sort. + self.assertIsInstance(r, str) + od[42] = od.items() + r = repr(od) + # Again. + self.assertIsInstance(r, str) + def test_setdefault(self): OrderedDict = self.OrderedDict pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |