Tim Peters | a814db5 | 2001-05-14 07:05:58 +0000 | [diff] [blame] | 1 | import pprint |
Fred Drake | 43913dd | 2001-05-14 17:41:20 +0000 | [diff] [blame^] | 2 | import unittest |
Tim Peters | a814db5 | 2001-05-14 07:05:58 +0000 | [diff] [blame] | 3 | |
Fred Drake | 43913dd | 2001-05-14 17:41:20 +0000 | [diff] [blame^] | 4 | import test_support |
Tim Peters | a814db5 | 2001-05-14 07:05:58 +0000 | [diff] [blame] | 5 | |
Tim Peters | a814db5 | 2001-05-14 07:05:58 +0000 | [diff] [blame] | 6 | |
Fred Drake | 43913dd | 2001-05-14 17:41:20 +0000 | [diff] [blame^] | 7 | class QueryTestCase(unittest.TestCase): |
Tim Peters | a814db5 | 2001-05-14 07:05:58 +0000 | [diff] [blame] | 8 | |
Fred Drake | 43913dd | 2001-05-14 17:41:20 +0000 | [diff] [blame^] | 9 | def setUp(self): |
| 10 | self.a = range(100) |
| 11 | self.b = range(200) |
| 12 | self.a[-12] = self.b |
Tim Peters | a814db5 | 2001-05-14 07:05:58 +0000 | [diff] [blame] | 13 | |
Fred Drake | 43913dd | 2001-05-14 17:41:20 +0000 | [diff] [blame^] | 14 | def test_basic(self): |
| 15 | # Verify that .isrecursive() and .isreadable() work. |
| 16 | verify = self.assert_ |
| 17 | for safe in (2, 2.0, 2j, "abc", [3], (2,2), {3: 3}, u"yaddayadda", |
| 18 | self.a, self.b): |
| 19 | verify(not pprint.isrecursive(safe), |
| 20 | "expected not isrecursive for " + `safe`) |
| 21 | verify(pprint.isreadable(safe), |
| 22 | "expected isreadable for " + `safe`) |
Tim Peters | a814db5 | 2001-05-14 07:05:58 +0000 | [diff] [blame] | 23 | |
Fred Drake | 43913dd | 2001-05-14 17:41:20 +0000 | [diff] [blame^] | 24 | def test_knotted(self): |
| 25 | # Tie a knot. |
| 26 | self.b[67] = self.a |
| 27 | # Messy dict. |
| 28 | self.d = {} |
| 29 | self.d[0] = self.d[1] = self.d[2] = self.d |
Tim Peters | a814db5 | 2001-05-14 07:05:58 +0000 | [diff] [blame] | 30 | |
Fred Drake | 43913dd | 2001-05-14 17:41:20 +0000 | [diff] [blame^] | 31 | verify = self.assert_ |
Tim Peters | a814db5 | 2001-05-14 07:05:58 +0000 | [diff] [blame] | 32 | |
Fred Drake | 43913dd | 2001-05-14 17:41:20 +0000 | [diff] [blame^] | 33 | for icky in self.a, self.b, self.d, (self.d, self.d): |
| 34 | verify(pprint.isrecursive(icky), "expected isrecursive") |
| 35 | verify(not pprint.isreadable(icky), "expected not isreadable") |
| 36 | |
| 37 | # Break the cycles. |
| 38 | self.d.clear() |
| 39 | del self.a[:] |
| 40 | del self.b[:] |
| 41 | |
| 42 | for safe in self.a, self.b, self.d, (self.d, self.d): |
| 43 | verify(not pprint.isrecursive(safe), |
| 44 | "expected not isrecursive for " + `safe`) |
| 45 | verify(pprint.isreadable(safe), |
| 46 | "expected isreadable for " + `safe`) |
| 47 | |
| 48 | def test_unreadable(self): |
| 49 | """Not recursive but not readable anyway.""" |
| 50 | verify = self.assert_ |
| 51 | for unreadable in type(3), pprint, pprint.isrecursive: |
| 52 | verify(not pprint.isrecursive(unreadable), |
| 53 | "expected not isrecursive for " + `unreadable`) |
| 54 | verify(not pprint.isreadable(unreadable), |
| 55 | "expected not isreadable for " + `unreadable`) |
| 56 | |
| 57 | |
| 58 | test_support.run_unittest(QueryTestCase) |