Walter Dörwald | 1dde95d | 2003-12-08 11:38:45 +0000 | [diff] [blame] | 1 | """ |
| 2 | Tests common to tuple, list and UserList.UserList |
| 3 | """ |
| 4 | |
| 5 | import unittest |
Raymond Hettinger | 5b07ebc | 2008-02-07 00:54:20 +0000 | [diff] [blame] | 6 | import sys |
Walter Dörwald | 1dde95d | 2003-12-08 11:38:45 +0000 | [diff] [blame] | 7 | |
Walter Dörwald | 09a3f2c | 2005-03-22 22:43:28 +0000 | [diff] [blame] | 8 | # Various iterables |
| 9 | # This is used for checking the constructor (here and in test_deque.py) |
| 10 | def iterfunc(seqn): |
| 11 | 'Regular generator' |
| 12 | for i in seqn: |
| 13 | yield i |
| 14 | |
| 15 | class Sequence: |
| 16 | 'Sequence using __getitem__' |
| 17 | def __init__(self, seqn): |
| 18 | self.seqn = seqn |
| 19 | def __getitem__(self, i): |
| 20 | return self.seqn[i] |
| 21 | |
| 22 | class IterFunc: |
| 23 | 'Sequence using iterator protocol' |
| 24 | def __init__(self, seqn): |
| 25 | self.seqn = seqn |
| 26 | self.i = 0 |
| 27 | def __iter__(self): |
| 28 | return self |
| 29 | def next(self): |
| 30 | if self.i >= len(self.seqn): raise StopIteration |
| 31 | v = self.seqn[self.i] |
| 32 | self.i += 1 |
| 33 | return v |
| 34 | |
| 35 | class IterGen: |
| 36 | 'Sequence using iterator protocol defined with a generator' |
| 37 | def __init__(self, seqn): |
| 38 | self.seqn = seqn |
| 39 | self.i = 0 |
| 40 | def __iter__(self): |
| 41 | for val in self.seqn: |
| 42 | yield val |
| 43 | |
| 44 | class IterNextOnly: |
| 45 | 'Missing __getitem__ and __iter__' |
| 46 | def __init__(self, seqn): |
| 47 | self.seqn = seqn |
| 48 | self.i = 0 |
| 49 | def next(self): |
| 50 | if self.i >= len(self.seqn): raise StopIteration |
| 51 | v = self.seqn[self.i] |
| 52 | self.i += 1 |
| 53 | return v |
| 54 | |
| 55 | class IterNoNext: |
| 56 | 'Iterator missing next()' |
| 57 | def __init__(self, seqn): |
| 58 | self.seqn = seqn |
| 59 | self.i = 0 |
| 60 | def __iter__(self): |
| 61 | return self |
| 62 | |
| 63 | class IterGenExc: |
| 64 | 'Test propagation of exceptions' |
| 65 | def __init__(self, seqn): |
| 66 | self.seqn = seqn |
| 67 | self.i = 0 |
| 68 | def __iter__(self): |
| 69 | return self |
| 70 | def next(self): |
| 71 | 3 // 0 |
| 72 | |
| 73 | class IterFuncStop: |
| 74 | 'Test immediate stop' |
| 75 | def __init__(self, seqn): |
| 76 | pass |
| 77 | def __iter__(self): |
| 78 | return self |
| 79 | def next(self): |
| 80 | raise StopIteration |
| 81 | |
| 82 | from itertools import chain, imap |
| 83 | def itermulti(seqn): |
| 84 | 'Test multiple tiers of iterators' |
| 85 | return chain(imap(lambda x:x, iterfunc(IterGen(Sequence(seqn))))) |
| 86 | |
Raymond Hettinger | 51dbc9a | 2015-05-17 14:37:39 -0700 | [diff] [blame^] | 87 | class LyingTuple(tuple): |
| 88 | def __iter__(self): |
| 89 | yield 1 |
| 90 | |
| 91 | class LyingList(list): |
| 92 | def __iter__(self): |
| 93 | yield 1 |
| 94 | |
Walter Dörwald | 1dde95d | 2003-12-08 11:38:45 +0000 | [diff] [blame] | 95 | class CommonTest(unittest.TestCase): |
| 96 | # The type to be tested |
| 97 | type2test = None |
| 98 | |
| 99 | def test_constructors(self): |
| 100 | l0 = [] |
| 101 | l1 = [0] |
| 102 | l2 = [0, 1] |
| 103 | |
| 104 | u = self.type2test() |
| 105 | u0 = self.type2test(l0) |
| 106 | u1 = self.type2test(l1) |
| 107 | u2 = self.type2test(l2) |
| 108 | |
| 109 | uu = self.type2test(u) |
| 110 | uu0 = self.type2test(u0) |
| 111 | uu1 = self.type2test(u1) |
| 112 | uu2 = self.type2test(u2) |
| 113 | |
| 114 | v = self.type2test(tuple(u)) |
| 115 | class OtherSeq: |
| 116 | def __init__(self, initseq): |
| 117 | self.__data = initseq |
| 118 | def __len__(self): |
| 119 | return len(self.__data) |
| 120 | def __getitem__(self, i): |
| 121 | return self.__data[i] |
| 122 | s = OtherSeq(u0) |
| 123 | v0 = self.type2test(s) |
| 124 | self.assertEqual(len(v0), len(s)) |
| 125 | |
| 126 | s = "this is also a sequence" |
| 127 | vv = self.type2test(s) |
| 128 | self.assertEqual(len(vv), len(s)) |
| 129 | |
Walter Dörwald | 09a3f2c | 2005-03-22 22:43:28 +0000 | [diff] [blame] | 130 | # Create from various iteratables |
| 131 | for s in ("123", "", range(1000), ('do', 1.2), xrange(2000,2200,5)): |
| 132 | for g in (Sequence, IterFunc, IterGen, |
| 133 | itermulti, iterfunc): |
| 134 | self.assertEqual(self.type2test(g(s)), self.type2test(s)) |
| 135 | self.assertEqual(self.type2test(IterFuncStop(s)), self.type2test()) |
| 136 | self.assertEqual(self.type2test(c for c in "123"), self.type2test("123")) |
| 137 | self.assertRaises(TypeError, self.type2test, IterNextOnly(s)) |
| 138 | self.assertRaises(TypeError, self.type2test, IterNoNext(s)) |
| 139 | self.assertRaises(ZeroDivisionError, self.type2test, IterGenExc(s)) |
| 140 | |
Raymond Hettinger | 51dbc9a | 2015-05-17 14:37:39 -0700 | [diff] [blame^] | 141 | # Issue #23757 |
| 142 | self.assertEqual(self.type2test(LyingTuple((2,))), self.type2test((1,))) |
| 143 | self.assertEqual(self.type2test(LyingList([2])), self.type2test([1])) |
| 144 | |
Walter Dörwald | 1dde95d | 2003-12-08 11:38:45 +0000 | [diff] [blame] | 145 | def test_truth(self): |
Ezio Melotti | 2623a37 | 2010-11-21 13:34:58 +0000 | [diff] [blame] | 146 | self.assertFalse(self.type2test()) |
| 147 | self.assertTrue(self.type2test([42])) |
Walter Dörwald | 1dde95d | 2003-12-08 11:38:45 +0000 | [diff] [blame] | 148 | |
| 149 | def test_getitem(self): |
| 150 | u = self.type2test([0, 1, 2, 3, 4]) |
| 151 | for i in xrange(len(u)): |
| 152 | self.assertEqual(u[i], i) |
Raymond Hettinger | 5ea7e31 | 2004-09-30 07:47:20 +0000 | [diff] [blame] | 153 | self.assertEqual(u[long(i)], i) |
Walter Dörwald | 1dde95d | 2003-12-08 11:38:45 +0000 | [diff] [blame] | 154 | for i in xrange(-len(u), -1): |
| 155 | self.assertEqual(u[i], len(u)+i) |
Raymond Hettinger | 5ea7e31 | 2004-09-30 07:47:20 +0000 | [diff] [blame] | 156 | self.assertEqual(u[long(i)], len(u)+i) |
Walter Dörwald | 1dde95d | 2003-12-08 11:38:45 +0000 | [diff] [blame] | 157 | self.assertRaises(IndexError, u.__getitem__, -len(u)-1) |
| 158 | self.assertRaises(IndexError, u.__getitem__, len(u)) |
Raymond Hettinger | 5ea7e31 | 2004-09-30 07:47:20 +0000 | [diff] [blame] | 159 | self.assertRaises(ValueError, u.__getitem__, slice(0,10,0)) |
Walter Dörwald | 1dde95d | 2003-12-08 11:38:45 +0000 | [diff] [blame] | 160 | |
| 161 | u = self.type2test() |
| 162 | self.assertRaises(IndexError, u.__getitem__, 0) |
| 163 | self.assertRaises(IndexError, u.__getitem__, -1) |
| 164 | |
| 165 | self.assertRaises(TypeError, u.__getitem__) |
| 166 | |
Raymond Hettinger | 5ea7e31 | 2004-09-30 07:47:20 +0000 | [diff] [blame] | 167 | a = self.type2test([10, 11]) |
| 168 | self.assertEqual(a[0], 10) |
| 169 | self.assertEqual(a[1], 11) |
| 170 | self.assertEqual(a[-2], 10) |
| 171 | self.assertEqual(a[-1], 11) |
| 172 | self.assertRaises(IndexError, a.__getitem__, -3) |
| 173 | self.assertRaises(IndexError, a.__getitem__, 3) |
| 174 | |
Walter Dörwald | 1dde95d | 2003-12-08 11:38:45 +0000 | [diff] [blame] | 175 | def test_getslice(self): |
| 176 | l = [0, 1, 2, 3, 4] |
| 177 | u = self.type2test(l) |
| 178 | |
| 179 | self.assertEqual(u[0:0], self.type2test()) |
| 180 | self.assertEqual(u[1:2], self.type2test([1])) |
| 181 | self.assertEqual(u[-2:-1], self.type2test([3])) |
| 182 | self.assertEqual(u[-1000:1000], u) |
| 183 | self.assertEqual(u[1000:-1000], self.type2test([])) |
| 184 | self.assertEqual(u[:], u) |
| 185 | self.assertEqual(u[1:None], self.type2test([1, 2, 3, 4])) |
| 186 | self.assertEqual(u[None:3], self.type2test([0, 1, 2])) |
| 187 | |
| 188 | # Extended slices |
| 189 | self.assertEqual(u[::], u) |
| 190 | self.assertEqual(u[::2], self.type2test([0, 2, 4])) |
| 191 | self.assertEqual(u[1::2], self.type2test([1, 3])) |
| 192 | self.assertEqual(u[::-1], self.type2test([4, 3, 2, 1, 0])) |
| 193 | self.assertEqual(u[::-2], self.type2test([4, 2, 0])) |
| 194 | self.assertEqual(u[3::-2], self.type2test([3, 1])) |
| 195 | self.assertEqual(u[3:3:-2], self.type2test([])) |
| 196 | self.assertEqual(u[3:2:-2], self.type2test([3])) |
| 197 | self.assertEqual(u[3:1:-2], self.type2test([3])) |
| 198 | self.assertEqual(u[3:0:-2], self.type2test([3, 1])) |
| 199 | self.assertEqual(u[::-100], self.type2test([4])) |
| 200 | self.assertEqual(u[100:-100:], self.type2test([])) |
| 201 | self.assertEqual(u[-100:100:], u) |
| 202 | self.assertEqual(u[100:-100:-1], u[::-1]) |
| 203 | self.assertEqual(u[-100:100:-1], self.type2test([])) |
| 204 | self.assertEqual(u[-100L:100L:2L], self.type2test([0, 2, 4])) |
| 205 | |
| 206 | # Test extreme cases with long ints |
| 207 | a = self.type2test([0,1,2,3,4]) |
| 208 | self.assertEqual(a[ -pow(2,128L): 3 ], self.type2test([0,1,2])) |
| 209 | self.assertEqual(a[ 3: pow(2,145L) ], self.type2test([3,4])) |
| 210 | |
Senthil Kumaran | ce8e33a | 2010-01-08 19:04:16 +0000 | [diff] [blame] | 211 | self.assertRaises(TypeError, u.__getslice__) |
Walter Dörwald | 1dde95d | 2003-12-08 11:38:45 +0000 | [diff] [blame] | 212 | |
| 213 | def test_contains(self): |
| 214 | u = self.type2test([0, 1, 2]) |
| 215 | for i in u: |
Ezio Melotti | aa98058 | 2010-01-23 23:04:36 +0000 | [diff] [blame] | 216 | self.assertIn(i, u) |
Walter Dörwald | 1dde95d | 2003-12-08 11:38:45 +0000 | [diff] [blame] | 217 | for i in min(u)-1, max(u)+1: |
Ezio Melotti | aa98058 | 2010-01-23 23:04:36 +0000 | [diff] [blame] | 218 | self.assertNotIn(i, u) |
Walter Dörwald | 1dde95d | 2003-12-08 11:38:45 +0000 | [diff] [blame] | 219 | |
| 220 | self.assertRaises(TypeError, u.__contains__) |
| 221 | |
Georg Brandl | be3856d | 2005-08-24 09:08:57 +0000 | [diff] [blame] | 222 | def test_contains_fake(self): |
| 223 | class AllEq: |
| 224 | # Sequences must use rich comparison against each item |
| 225 | # (unless "is" is true, or an earlier item answered) |
| 226 | # So instances of AllEq must be found in all non-empty sequences. |
| 227 | def __eq__(self, other): |
| 228 | return True |
Nick Coghlan | 53663a6 | 2008-07-15 14:27:37 +0000 | [diff] [blame] | 229 | __hash__ = None # Can't meet hash invariant requirements |
Ezio Melotti | aa98058 | 2010-01-23 23:04:36 +0000 | [diff] [blame] | 230 | self.assertNotIn(AllEq(), self.type2test([])) |
| 231 | self.assertIn(AllEq(), self.type2test([1])) |
Georg Brandl | be3856d | 2005-08-24 09:08:57 +0000 | [diff] [blame] | 232 | |
| 233 | def test_contains_order(self): |
| 234 | # Sequences must test in-order. If a rich comparison has side |
| 235 | # effects, these will be visible to tests against later members. |
| 236 | # In this test, the "side effect" is a short-circuiting raise. |
| 237 | class DoNotTestEq(Exception): |
| 238 | pass |
| 239 | class StopCompares: |
| 240 | def __eq__(self, other): |
| 241 | raise DoNotTestEq |
Tim Peters | 9e34c04 | 2005-08-26 15:20:46 +0000 | [diff] [blame] | 242 | |
Georg Brandl | be3856d | 2005-08-24 09:08:57 +0000 | [diff] [blame] | 243 | checkfirst = self.type2test([1, StopCompares()]) |
Ezio Melotti | aa98058 | 2010-01-23 23:04:36 +0000 | [diff] [blame] | 244 | self.assertIn(1, checkfirst) |
Georg Brandl | be3856d | 2005-08-24 09:08:57 +0000 | [diff] [blame] | 245 | checklast = self.type2test([StopCompares(), 1]) |
| 246 | self.assertRaises(DoNotTestEq, checklast.__contains__, 1) |
| 247 | |
Walter Dörwald | 1dde95d | 2003-12-08 11:38:45 +0000 | [diff] [blame] | 248 | def test_len(self): |
| 249 | self.assertEqual(len(self.type2test()), 0) |
| 250 | self.assertEqual(len(self.type2test([])), 0) |
| 251 | self.assertEqual(len(self.type2test([0])), 1) |
| 252 | self.assertEqual(len(self.type2test([0, 1, 2])), 3) |
| 253 | |
| 254 | def test_minmax(self): |
| 255 | u = self.type2test([0, 1, 2]) |
| 256 | self.assertEqual(min(u), 0) |
| 257 | self.assertEqual(max(u), 2) |
| 258 | |
| 259 | def test_addmul(self): |
| 260 | u1 = self.type2test([0]) |
| 261 | u2 = self.type2test([0, 1]) |
| 262 | self.assertEqual(u1, u1 + self.type2test()) |
| 263 | self.assertEqual(u1, self.type2test() + u1) |
| 264 | self.assertEqual(u1 + self.type2test([1]), u2) |
| 265 | self.assertEqual(self.type2test([-1]) + u1, self.type2test([-1, 0])) |
| 266 | self.assertEqual(self.type2test(), u2*0) |
| 267 | self.assertEqual(self.type2test(), 0*u2) |
| 268 | self.assertEqual(self.type2test(), u2*0L) |
| 269 | self.assertEqual(self.type2test(), 0L*u2) |
| 270 | self.assertEqual(u2, u2*1) |
| 271 | self.assertEqual(u2, 1*u2) |
| 272 | self.assertEqual(u2, u2*1L) |
| 273 | self.assertEqual(u2, 1L*u2) |
| 274 | self.assertEqual(u2+u2, u2*2) |
| 275 | self.assertEqual(u2+u2, 2*u2) |
| 276 | self.assertEqual(u2+u2, u2*2L) |
| 277 | self.assertEqual(u2+u2, 2L*u2) |
| 278 | self.assertEqual(u2+u2+u2, u2*3) |
| 279 | self.assertEqual(u2+u2+u2, 3*u2) |
| 280 | |
| 281 | class subclass(self.type2test): |
| 282 | pass |
| 283 | u3 = subclass([0, 1]) |
| 284 | self.assertEqual(u3, u3*1) |
Ezio Melotti | 2623a37 | 2010-11-21 13:34:58 +0000 | [diff] [blame] | 285 | self.assertIsNot(u3, u3*1) |
Walter Dörwald | 1dde95d | 2003-12-08 11:38:45 +0000 | [diff] [blame] | 286 | |
| 287 | def test_iadd(self): |
| 288 | u = self.type2test([0, 1]) |
| 289 | u += self.type2test() |
| 290 | self.assertEqual(u, self.type2test([0, 1])) |
| 291 | u += self.type2test([2, 3]) |
| 292 | self.assertEqual(u, self.type2test([0, 1, 2, 3])) |
| 293 | u += self.type2test([4, 5]) |
| 294 | self.assertEqual(u, self.type2test([0, 1, 2, 3, 4, 5])) |
| 295 | |
| 296 | u = self.type2test("spam") |
| 297 | u += self.type2test("eggs") |
| 298 | self.assertEqual(u, self.type2test("spameggs")) |
| 299 | |
| 300 | def test_imul(self): |
| 301 | u = self.type2test([0, 1]) |
| 302 | u *= 3 |
| 303 | self.assertEqual(u, self.type2test([0, 1, 0, 1, 0, 1])) |
| 304 | |
| 305 | def test_getitemoverwriteiter(self): |
| 306 | # Verify that __getitem__ overrides are not recognized by __iter__ |
| 307 | class T(self.type2test): |
| 308 | def __getitem__(self, key): |
| 309 | return str(key) + '!!!' |
| 310 | self.assertEqual(iter(T((1,2))).next(), 1) |
Raymond Hettinger | 5ea7e31 | 2004-09-30 07:47:20 +0000 | [diff] [blame] | 311 | |
| 312 | def test_repeat(self): |
| 313 | for m in xrange(4): |
| 314 | s = tuple(range(m)) |
| 315 | for n in xrange(-3, 5): |
| 316 | self.assertEqual(self.type2test(s*n), self.type2test(s)*n) |
| 317 | self.assertEqual(self.type2test(s)*(-4), self.type2test([])) |
| 318 | self.assertEqual(id(s), id(s*1)) |
| 319 | |
Guido van Rossum | 0288cb0 | 2007-11-12 20:06:40 +0000 | [diff] [blame] | 320 | def test_bigrepeat(self): |
Neal Norwitz | e7d8be8 | 2008-07-31 17:17:14 +0000 | [diff] [blame] | 321 | import sys |
| 322 | if sys.maxint <= 2147483647: |
| 323 | x = self.type2test([0]) |
| 324 | x *= 2**16 |
| 325 | self.assertRaises(MemoryError, x.__mul__, 2**16) |
| 326 | if hasattr(x, '__imul__'): |
| 327 | self.assertRaises(MemoryError, x.__imul__, 2**16) |
Guido van Rossum | 0288cb0 | 2007-11-12 20:06:40 +0000 | [diff] [blame] | 328 | |
Raymond Hettinger | 5ea7e31 | 2004-09-30 07:47:20 +0000 | [diff] [blame] | 329 | def test_subscript(self): |
| 330 | a = self.type2test([10, 11]) |
| 331 | self.assertEqual(a.__getitem__(0L), 10) |
| 332 | self.assertEqual(a.__getitem__(1L), 11) |
| 333 | self.assertEqual(a.__getitem__(-2L), 10) |
| 334 | self.assertEqual(a.__getitem__(-1L), 11) |
| 335 | self.assertRaises(IndexError, a.__getitem__, -3) |
| 336 | self.assertRaises(IndexError, a.__getitem__, 3) |
| 337 | self.assertEqual(a.__getitem__(slice(0,1)), self.type2test([10])) |
| 338 | self.assertEqual(a.__getitem__(slice(1,2)), self.type2test([11])) |
| 339 | self.assertEqual(a.__getitem__(slice(0,2)), self.type2test([10, 11])) |
| 340 | self.assertEqual(a.__getitem__(slice(0,3)), self.type2test([10, 11])) |
| 341 | self.assertEqual(a.__getitem__(slice(3,5)), self.type2test([])) |
| 342 | self.assertRaises(ValueError, a.__getitem__, slice(0, 10, 0)) |
| 343 | self.assertRaises(TypeError, a.__getitem__, 'x') |
Raymond Hettinger | 5b07ebc | 2008-02-07 00:54:20 +0000 | [diff] [blame] | 344 | |
| 345 | def test_count(self): |
| 346 | a = self.type2test([0, 1, 2])*3 |
| 347 | self.assertEqual(a.count(0), 3) |
| 348 | self.assertEqual(a.count(1), 3) |
| 349 | self.assertEqual(a.count(3), 0) |
| 350 | |
| 351 | self.assertRaises(TypeError, a.count) |
| 352 | |
| 353 | class BadExc(Exception): |
| 354 | pass |
| 355 | |
| 356 | class BadCmp: |
| 357 | def __eq__(self, other): |
| 358 | if other == 2: |
| 359 | raise BadExc() |
| 360 | return False |
| 361 | |
| 362 | self.assertRaises(BadExc, a.count, BadCmp()) |
| 363 | |
| 364 | def test_index(self): |
| 365 | u = self.type2test([0, 1]) |
| 366 | self.assertEqual(u.index(0), 0) |
| 367 | self.assertEqual(u.index(1), 1) |
| 368 | self.assertRaises(ValueError, u.index, 2) |
| 369 | |
| 370 | u = self.type2test([-2, -1, 0, 0, 1, 2]) |
| 371 | self.assertEqual(u.count(0), 2) |
| 372 | self.assertEqual(u.index(0), 2) |
| 373 | self.assertEqual(u.index(0, 2), 2) |
| 374 | self.assertEqual(u.index(-2, -10), 0) |
| 375 | self.assertEqual(u.index(0, 3), 3) |
| 376 | self.assertEqual(u.index(0, 3, 4), 3) |
| 377 | self.assertRaises(ValueError, u.index, 2, 0, -10) |
| 378 | |
| 379 | self.assertRaises(TypeError, u.index) |
| 380 | |
| 381 | class BadExc(Exception): |
| 382 | pass |
| 383 | |
| 384 | class BadCmp: |
| 385 | def __eq__(self, other): |
| 386 | if other == 2: |
| 387 | raise BadExc() |
| 388 | return False |
| 389 | |
| 390 | a = self.type2test([0, 1, 2, 3]) |
| 391 | self.assertRaises(BadExc, a.index, BadCmp()) |
| 392 | |
| 393 | a = self.type2test([-2, -1, 0, 0, 1, 2]) |
| 394 | self.assertEqual(a.index(0), 2) |
| 395 | self.assertEqual(a.index(0, 2), 2) |
| 396 | self.assertEqual(a.index(0, -4), 2) |
| 397 | self.assertEqual(a.index(-2, -10), 0) |
| 398 | self.assertEqual(a.index(0, 3), 3) |
| 399 | self.assertEqual(a.index(0, -3), 3) |
| 400 | self.assertEqual(a.index(0, 3, 4), 3) |
| 401 | self.assertEqual(a.index(0, -3, -2), 3) |
| 402 | self.assertEqual(a.index(0, -4*sys.maxint, 4*sys.maxint), 2) |
| 403 | self.assertRaises(ValueError, a.index, 0, 4*sys.maxint,-4*sys.maxint) |
| 404 | self.assertRaises(ValueError, a.index, 2, 0, -10) |