Neal Norwitz | 1c0423a | 2004-07-08 01:59:55 +0000 | [diff] [blame] | 1 | # Python test set -- built-in functions |
| 2 | |
Benjamin Peterson | ee8712c | 2008-05-20 21:35:26 +0000 | [diff] [blame] | 3 | import test.support, unittest |
Neal Norwitz | 1c0423a | 2004-07-08 01:59:55 +0000 | [diff] [blame] | 4 | import sys |
Alexandre Vassalotti | 7505607 | 2008-06-10 04:03:04 +0000 | [diff] [blame] | 5 | import pickle |
Mark Dickinson | d550c9a | 2009-11-15 09:57:26 +0000 | [diff] [blame] | 6 | import itertools |
Neal Norwitz | 1c0423a | 2004-07-08 01:59:55 +0000 | [diff] [blame] | 7 | |
Mark Dickinson | d550c9a | 2009-11-15 09:57:26 +0000 | [diff] [blame] | 8 | # pure Python implementations (3 args only), for comparison |
| 9 | def pyrange(start, stop, step): |
| 10 | if (start - stop) // step < 0: |
| 11 | # replace stop with next element in the sequence of integers |
| 12 | # that are congruent to start modulo step. |
| 13 | stop += (start - stop) % step |
| 14 | while start != stop: |
| 15 | yield start |
| 16 | start += step |
| 17 | |
| 18 | def pyrange_reversed(start, stop, step): |
| 19 | stop += (start - stop) % step |
| 20 | return pyrange(stop - step, start - step, -step) |
| 21 | |
| 22 | |
Walter Dörwald | 4ad9421 | 2007-05-21 18:01:17 +0000 | [diff] [blame] | 23 | class RangeTest(unittest.TestCase): |
Mark Dickinson | d550c9a | 2009-11-15 09:57:26 +0000 | [diff] [blame] | 24 | def assert_iterators_equal(self, xs, ys, test_id, limit=None): |
| 25 | # check that an iterator xs matches the expected results ys, |
| 26 | # up to a given limit. |
| 27 | if limit is not None: |
| 28 | xs = itertools.islice(xs, limit) |
| 29 | ys = itertools.islice(ys, limit) |
| 30 | sentinel = object() |
| 31 | pairs = itertools.zip_longest(xs, ys, fillvalue=sentinel) |
| 32 | for i, (x, y) in enumerate(pairs): |
| 33 | if x == y: |
| 34 | continue |
| 35 | elif x == sentinel: |
| 36 | self.fail('{}: iterator ended unexpectedly ' |
| 37 | 'at position {}; expected {}'.format(test_id, i, y)) |
| 38 | elif y == sentinel: |
| 39 | self.fail('{}: unexpected excess element {} at ' |
| 40 | 'position {}'.format(test_id, x, i)) |
| 41 | else: |
| 42 | self.fail('{}: wrong element at position {};' |
| 43 | 'expected {}, got {}'.format(test_id, i, y, x)) |
| 44 | |
Walter Dörwald | 4ad9421 | 2007-05-21 18:01:17 +0000 | [diff] [blame] | 45 | def test_range(self): |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 46 | self.assertEqual(list(range(3)), [0, 1, 2]) |
| 47 | self.assertEqual(list(range(1, 5)), [1, 2, 3, 4]) |
| 48 | self.assertEqual(list(range(0)), []) |
| 49 | self.assertEqual(list(range(-3)), []) |
| 50 | self.assertEqual(list(range(1, 10, 3)), [1, 4, 7]) |
| 51 | self.assertEqual(list(range(5, -5, -3)), [5, 2, -1, -4]) |
Neal Norwitz | 1c0423a | 2004-07-08 01:59:55 +0000 | [diff] [blame] | 52 | |
| 53 | a = 10 |
| 54 | b = 100 |
| 55 | c = 50 |
| 56 | |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 57 | self.assertEqual(list(range(a, a+2)), [a, a+1]) |
| 58 | self.assertEqual(list(range(a+2, a, -1)), [a+2, a+1]) |
| 59 | self.assertEqual(list(range(a+4, a, -2)), [a+4, a+2]) |
Neal Norwitz | 1c0423a | 2004-07-08 01:59:55 +0000 | [diff] [blame] | 60 | |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 61 | seq = list(range(a, b, c)) |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 62 | self.assertIn(a, seq) |
| 63 | self.assertNotIn(b, seq) |
Neal Norwitz | 1c0423a | 2004-07-08 01:59:55 +0000 | [diff] [blame] | 64 | self.assertEqual(len(seq), 2) |
| 65 | |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 66 | seq = list(range(b, a, -c)) |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 67 | self.assertIn(b, seq) |
| 68 | self.assertNotIn(a, seq) |
Neal Norwitz | 1c0423a | 2004-07-08 01:59:55 +0000 | [diff] [blame] | 69 | self.assertEqual(len(seq), 2) |
| 70 | |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 71 | seq = list(range(-a, -b, -c)) |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 72 | self.assertIn(-a, seq) |
| 73 | self.assertNotIn(-b, seq) |
Neal Norwitz | 1c0423a | 2004-07-08 01:59:55 +0000 | [diff] [blame] | 74 | self.assertEqual(len(seq), 2) |
| 75 | |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 76 | self.assertRaises(TypeError, range) |
| 77 | self.assertRaises(TypeError, range, 1, 2, 3, 4) |
| 78 | self.assertRaises(ValueError, range, 1, 2, 0) |
Neal Norwitz | 1c0423a | 2004-07-08 01:59:55 +0000 | [diff] [blame] | 79 | |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 80 | self.assertRaises(TypeError, range, 0.0, 2, 1) |
| 81 | self.assertRaises(TypeError, range, 1, 2.0, 1) |
| 82 | self.assertRaises(TypeError, range, 1, 2, 1.0) |
| 83 | self.assertRaises(TypeError, range, 1e100, 1e101, 1e101) |
Neal Norwitz | 1c0423a | 2004-07-08 01:59:55 +0000 | [diff] [blame] | 84 | |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 85 | self.assertRaises(TypeError, range, 0, "spam") |
| 86 | self.assertRaises(TypeError, range, 0, 42, "spam") |
Neal Norwitz | 1c0423a | 2004-07-08 01:59:55 +0000 | [diff] [blame] | 87 | |
Christian Heimes | a37d4c6 | 2007-12-04 23:02:19 +0000 | [diff] [blame] | 88 | self.assertEqual(len(range(0, sys.maxsize, sys.maxsize-1)), 2) |
Tim Peters | feec453 | 2004-08-08 07:17:39 +0000 | [diff] [blame] | 89 | |
Christian Heimes | a37d4c6 | 2007-12-04 23:02:19 +0000 | [diff] [blame] | 90 | r = range(-sys.maxsize, sys.maxsize, 2) |
| 91 | self.assertEqual(len(r), sys.maxsize) |
Tim Peters | feec453 | 2004-08-08 07:17:39 +0000 | [diff] [blame] | 92 | |
Benjamin Peterson | 8d16ab3 | 2010-11-20 23:01:55 +0000 | [diff] [blame] | 93 | def test_large_operands(self): |
| 94 | x = range(10**20, 10**20+10, 3) |
| 95 | self.assertEqual(len(x), 4) |
| 96 | self.assertEqual(len(list(x)), 4) |
| 97 | |
| 98 | x = range(10**20+10, 10**20, 3) |
| 99 | self.assertEqual(len(x), 0) |
| 100 | self.assertEqual(len(list(x)), 0) |
| 101 | |
| 102 | x = range(10**20, 10**20+10, -3) |
| 103 | self.assertEqual(len(x), 0) |
| 104 | self.assertEqual(len(list(x)), 0) |
| 105 | |
| 106 | x = range(10**20+10, 10**20, -3) |
| 107 | self.assertEqual(len(x), 4) |
| 108 | self.assertEqual(len(list(x)), 4) |
| 109 | |
| 110 | # Now test range() with longs |
| 111 | self.assertEqual(list(range(-2**100)), []) |
| 112 | self.assertEqual(list(range(0, -2**100)), []) |
| 113 | self.assertEqual(list(range(0, 2**100, -1)), []) |
| 114 | self.assertEqual(list(range(0, 2**100, -1)), []) |
| 115 | |
| 116 | a = int(10 * sys.maxsize) |
| 117 | b = int(100 * sys.maxsize) |
| 118 | c = int(50 * sys.maxsize) |
| 119 | |
| 120 | self.assertEqual(list(range(a, a+2)), [a, a+1]) |
| 121 | self.assertEqual(list(range(a+2, a, -1)), [a+2, a+1]) |
| 122 | self.assertEqual(list(range(a+4, a, -2)), [a+4, a+2]) |
| 123 | |
| 124 | seq = list(range(a, b, c)) |
| 125 | self.assertIn(a, seq) |
| 126 | self.assertNotIn(b, seq) |
| 127 | self.assertEqual(len(seq), 2) |
Nick Coghlan | e993b10 | 2011-01-12 03:15:52 +0000 | [diff] [blame] | 128 | self.assertEqual(seq[0], a) |
| 129 | self.assertEqual(seq[-1], a+c) |
Benjamin Peterson | 8d16ab3 | 2010-11-20 23:01:55 +0000 | [diff] [blame] | 130 | |
| 131 | seq = list(range(b, a, -c)) |
| 132 | self.assertIn(b, seq) |
| 133 | self.assertNotIn(a, seq) |
| 134 | self.assertEqual(len(seq), 2) |
Nick Coghlan | e993b10 | 2011-01-12 03:15:52 +0000 | [diff] [blame] | 135 | self.assertEqual(seq[0], b) |
| 136 | self.assertEqual(seq[-1], b-c) |
Benjamin Peterson | 8d16ab3 | 2010-11-20 23:01:55 +0000 | [diff] [blame] | 137 | |
| 138 | seq = list(range(-a, -b, -c)) |
| 139 | self.assertIn(-a, seq) |
| 140 | self.assertNotIn(-b, seq) |
| 141 | self.assertEqual(len(seq), 2) |
Nick Coghlan | e993b10 | 2011-01-12 03:15:52 +0000 | [diff] [blame] | 142 | self.assertEqual(seq[0], -a) |
| 143 | self.assertEqual(seq[-1], -a-c) |
Benjamin Peterson | 8d16ab3 | 2010-11-20 23:01:55 +0000 | [diff] [blame] | 144 | |
Nick Coghlan | e993b10 | 2011-01-12 03:15:52 +0000 | [diff] [blame] | 145 | def test_large_range(self): |
| 146 | # Check long ranges (len > sys.maxsize) |
| 147 | # len() is expected to fail due to limitations of the __len__ protocol |
| 148 | def _range_len(x): |
| 149 | try: |
| 150 | length = len(x) |
| 151 | except OverflowError: |
| 152 | step = x[1] - x[0] |
| 153 | length = 1 + ((x[-1] - x[0]) // step) |
| 154 | return length |
| 155 | a = -sys.maxsize |
| 156 | b = sys.maxsize |
| 157 | expected_len = b - a |
| 158 | x = range(a, b) |
| 159 | self.assertIn(a, x) |
| 160 | self.assertNotIn(b, x) |
| 161 | self.assertRaises(OverflowError, len, x) |
| 162 | self.assertEqual(_range_len(x), expected_len) |
| 163 | self.assertEqual(x[0], a) |
| 164 | idx = sys.maxsize+1 |
| 165 | self.assertEqual(x[idx], a+idx) |
| 166 | self.assertEqual(x[idx:idx+1][0], a+idx) |
| 167 | with self.assertRaises(IndexError): |
| 168 | x[-expected_len-1] |
| 169 | with self.assertRaises(IndexError): |
| 170 | x[expected_len] |
| 171 | |
| 172 | a = 0 |
| 173 | b = 2 * sys.maxsize |
| 174 | expected_len = b - a |
| 175 | x = range(a, b) |
| 176 | self.assertIn(a, x) |
| 177 | self.assertNotIn(b, x) |
| 178 | self.assertRaises(OverflowError, len, x) |
| 179 | self.assertEqual(_range_len(x), expected_len) |
| 180 | self.assertEqual(x[0], a) |
| 181 | idx = sys.maxsize+1 |
| 182 | self.assertEqual(x[idx], a+idx) |
| 183 | self.assertEqual(x[idx:idx+1][0], a+idx) |
| 184 | with self.assertRaises(IndexError): |
| 185 | x[-expected_len-1] |
| 186 | with self.assertRaises(IndexError): |
| 187 | x[expected_len] |
| 188 | |
| 189 | a = 0 |
| 190 | b = sys.maxsize**10 |
| 191 | c = 2*sys.maxsize |
| 192 | expected_len = 1 + (b - a) // c |
| 193 | x = range(a, b, c) |
| 194 | self.assertIn(a, x) |
| 195 | self.assertNotIn(b, x) |
| 196 | self.assertRaises(OverflowError, len, x) |
| 197 | self.assertEqual(_range_len(x), expected_len) |
| 198 | self.assertEqual(x[0], a) |
| 199 | idx = sys.maxsize+1 |
| 200 | self.assertEqual(x[idx], a+(idx*c)) |
| 201 | self.assertEqual(x[idx:idx+1][0], a+(idx*c)) |
| 202 | with self.assertRaises(IndexError): |
| 203 | x[-expected_len-1] |
| 204 | with self.assertRaises(IndexError): |
| 205 | x[expected_len] |
| 206 | |
| 207 | a = sys.maxsize**10 |
| 208 | b = 0 |
| 209 | c = -2*sys.maxsize |
| 210 | expected_len = 1 + (b - a) // c |
| 211 | x = range(a, b, c) |
| 212 | self.assertIn(a, x) |
| 213 | self.assertNotIn(b, x) |
| 214 | self.assertRaises(OverflowError, len, x) |
| 215 | self.assertEqual(_range_len(x), expected_len) |
| 216 | self.assertEqual(x[0], a) |
| 217 | idx = sys.maxsize+1 |
| 218 | self.assertEqual(x[idx], a+(idx*c)) |
| 219 | self.assertEqual(x[idx:idx+1][0], a+(idx*c)) |
| 220 | with self.assertRaises(IndexError): |
| 221 | x[-expected_len-1] |
| 222 | with self.assertRaises(IndexError): |
| 223 | x[expected_len] |
Benjamin Peterson | 8d16ab3 | 2010-11-20 23:01:55 +0000 | [diff] [blame] | 224 | |
| 225 | def test_invalid_invocation(self): |
| 226 | self.assertRaises(TypeError, range) |
| 227 | self.assertRaises(TypeError, range, 1, 2, 3, 4) |
| 228 | self.assertRaises(ValueError, range, 1, 2, 0) |
Benjamin Peterson | d57bb55 | 2010-11-20 23:03:34 +0000 | [diff] [blame] | 229 | a = int(10 * sys.maxsize) |
Benjamin Peterson | 8d16ab3 | 2010-11-20 23:01:55 +0000 | [diff] [blame] | 230 | self.assertRaises(ValueError, range, a, a + 1, int(0)) |
| 231 | self.assertRaises(TypeError, range, 1., 1., 1.) |
| 232 | self.assertRaises(TypeError, range, 1e100, 1e101, 1e101) |
| 233 | self.assertRaises(TypeError, range, 0, "spam") |
| 234 | self.assertRaises(TypeError, range, 0, 42, "spam") |
| 235 | # Exercise various combinations of bad arguments, to check |
| 236 | # refcounting logic |
| 237 | self.assertRaises(TypeError, range, 0.0) |
| 238 | self.assertRaises(TypeError, range, 0, 0.0) |
| 239 | self.assertRaises(TypeError, range, 0.0, 0) |
| 240 | self.assertRaises(TypeError, range, 0.0, 0.0) |
| 241 | self.assertRaises(TypeError, range, 0, 0, 1.0) |
| 242 | self.assertRaises(TypeError, range, 0, 0.0, 1) |
| 243 | self.assertRaises(TypeError, range, 0, 0.0, 1.0) |
| 244 | self.assertRaises(TypeError, range, 0.0, 0, 1) |
| 245 | self.assertRaises(TypeError, range, 0.0, 0, 1.0) |
| 246 | self.assertRaises(TypeError, range, 0.0, 0.0, 1) |
| 247 | self.assertRaises(TypeError, range, 0.0, 0.0, 1.0) |
| 248 | |
| 249 | def test_index(self): |
| 250 | u = range(2) |
| 251 | self.assertEqual(u.index(0), 0) |
| 252 | self.assertEqual(u.index(1), 1) |
| 253 | self.assertRaises(ValueError, u.index, 2) |
| 254 | |
| 255 | u = range(-2, 3) |
| 256 | self.assertEqual(u.count(0), 1) |
| 257 | self.assertEqual(u.index(0), 2) |
| 258 | self.assertRaises(TypeError, u.index) |
| 259 | |
| 260 | class BadExc(Exception): |
| 261 | pass |
| 262 | |
| 263 | class BadCmp: |
| 264 | def __eq__(self, other): |
| 265 | if other == 2: |
| 266 | raise BadExc() |
| 267 | return False |
| 268 | |
| 269 | a = range(4) |
| 270 | self.assertRaises(BadExc, a.index, BadCmp()) |
| 271 | |
| 272 | a = range(-2, 3) |
| 273 | self.assertEqual(a.index(0), 2) |
| 274 | self.assertEqual(range(1, 10, 3).index(4), 1) |
| 275 | self.assertEqual(range(1, -10, -3).index(-5), 2) |
| 276 | |
| 277 | self.assertEqual(range(10**20).index(1), 1) |
| 278 | self.assertEqual(range(10**20).index(10**20 - 1), 10**20 - 1) |
| 279 | |
| 280 | self.assertRaises(ValueError, range(1, 2**100, 2).index, 2**87) |
| 281 | self.assertEqual(range(1, 2**100, 2).index(2**87+1), 2**86) |
| 282 | |
| 283 | class AlwaysEqual(object): |
| 284 | def __eq__(self, other): |
| 285 | return True |
| 286 | always_equal = AlwaysEqual() |
Benjamin Peterson | d57bb55 | 2010-11-20 23:03:34 +0000 | [diff] [blame] | 287 | self.assertEqual(range(10).index(always_equal), 0) |
Benjamin Peterson | 8d16ab3 | 2010-11-20 23:01:55 +0000 | [diff] [blame] | 288 | |
| 289 | def test_user_index_method(self): |
| 290 | bignum = 2*sys.maxsize |
| 291 | smallnum = 42 |
| 292 | |
| 293 | # User-defined class with an __index__ method |
| 294 | class I: |
| 295 | def __init__(self, n): |
| 296 | self.n = int(n) |
| 297 | def __index__(self): |
| 298 | return self.n |
| 299 | self.assertEqual(list(range(I(bignum), I(bignum + 1))), [bignum]) |
| 300 | self.assertEqual(list(range(I(smallnum), I(smallnum + 1))), [smallnum]) |
| 301 | |
| 302 | # User-defined class with a failing __index__ method |
| 303 | class IX: |
| 304 | def __index__(self): |
| 305 | raise RuntimeError |
| 306 | self.assertRaises(RuntimeError, range, IX()) |
| 307 | |
| 308 | # User-defined class with an invalid __index__ method |
| 309 | class IN: |
| 310 | def __index__(self): |
| 311 | return "not a number" |
| 312 | |
| 313 | self.assertRaises(TypeError, range, IN()) |
| 314 | |
| 315 | def test_count(self): |
| 316 | self.assertEqual(range(3).count(-1), 0) |
| 317 | self.assertEqual(range(3).count(0), 1) |
| 318 | self.assertEqual(range(3).count(1), 1) |
| 319 | self.assertEqual(range(3).count(2), 1) |
| 320 | self.assertEqual(range(3).count(3), 0) |
| 321 | self.assertIs(type(range(3).count(-1)), int) |
| 322 | self.assertIs(type(range(3).count(1)), int) |
| 323 | self.assertEqual(range(10**20).count(1), 1) |
| 324 | self.assertEqual(range(10**20).count(10**20), 0) |
| 325 | self.assertEqual(range(3).index(1), 1) |
| 326 | self.assertEqual(range(1, 2**100, 2).count(2**87), 0) |
| 327 | self.assertEqual(range(1, 2**100, 2).count(2**87+1), 1) |
| 328 | |
| 329 | class AlwaysEqual(object): |
| 330 | def __eq__(self, other): |
| 331 | return True |
| 332 | always_equal = AlwaysEqual() |
| 333 | self.assertEqual(range(10).count(always_equal), 10) |
| 334 | |
Nick Coghlan | 37ee850 | 2010-12-03 14:26:13 +0000 | [diff] [blame] | 335 | self.assertEqual(len(range(sys.maxsize, sys.maxsize+10)), 10) |
| 336 | |
Walter Dörwald | 67d9993 | 2007-05-20 08:22:37 +0000 | [diff] [blame] | 337 | def test_repr(self): |
Walter Dörwald | 03b43d8 | 2007-05-21 10:43:34 +0000 | [diff] [blame] | 338 | self.assertEqual(repr(range(1)), 'range(0, 1)') |
Walter Dörwald | 67d9993 | 2007-05-20 08:22:37 +0000 | [diff] [blame] | 339 | self.assertEqual(repr(range(1, 2)), 'range(1, 2)') |
| 340 | self.assertEqual(repr(range(1, 2, 3)), 'range(1, 2, 3)') |
| 341 | |
Alexandre Vassalotti | 7505607 | 2008-06-10 04:03:04 +0000 | [diff] [blame] | 342 | def test_pickling(self): |
| 343 | testcases = [(13,), (0, 11), (-22, 10), (20, 3, -1), |
| 344 | (13, 21, 3), (-2, 2, 2)] |
Hirokazu Yamamoto | d0d0b65 | 2008-10-23 00:38:15 +0000 | [diff] [blame] | 345 | for proto in range(pickle.HIGHEST_PROTOCOL + 1): |
Alexandre Vassalotti | 7505607 | 2008-06-10 04:03:04 +0000 | [diff] [blame] | 346 | for t in testcases: |
| 347 | r = range(*t) |
Ezio Melotti | b3aedd4 | 2010-11-20 19:04:17 +0000 | [diff] [blame] | 348 | self.assertEqual(list(pickle.loads(pickle.dumps(r, proto))), |
| 349 | list(r)) |
Alexandre Vassalotti | 7505607 | 2008-06-10 04:03:04 +0000 | [diff] [blame] | 350 | |
Raymond Hettinger | 94f5583 | 2009-06-12 18:40:16 +0000 | [diff] [blame] | 351 | def test_odd_bug(self): |
| 352 | # This used to raise a "SystemError: NULL result without error" |
| 353 | # because the range validation step was eating the exception |
| 354 | # before NULL was returned. |
| 355 | with self.assertRaises(TypeError): |
| 356 | range([], 1, -1) |
| 357 | |
Mark Dickinson | 3e124ae | 2009-09-22 21:47:24 +0000 | [diff] [blame] | 358 | def test_types(self): |
| 359 | # Non-integer objects *equal* to any of the range's items are supposed |
| 360 | # to be contained in the range. |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 361 | self.assertIn(1.0, range(3)) |
| 362 | self.assertIn(True, range(3)) |
| 363 | self.assertIn(1+0j, range(3)) |
Mark Dickinson | 3e124ae | 2009-09-22 21:47:24 +0000 | [diff] [blame] | 364 | |
| 365 | class C1: |
| 366 | def __eq__(self, other): return True |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 367 | self.assertIn(C1(), range(3)) |
Mark Dickinson | 3e124ae | 2009-09-22 21:47:24 +0000 | [diff] [blame] | 368 | |
| 369 | # Objects are never coerced into other types for comparison. |
| 370 | class C2: |
| 371 | def __int__(self): return 1 |
| 372 | def __index__(self): return 1 |
Ezio Melotti | b58e0bd | 2010-01-23 15:40:09 +0000 | [diff] [blame] | 373 | self.assertNotIn(C2(), range(3)) |
Mark Dickinson | 3e124ae | 2009-09-22 21:47:24 +0000 | [diff] [blame] | 374 | # ..except if explicitly told so. |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 375 | self.assertIn(int(C2()), range(3)) |
Mark Dickinson | 3e124ae | 2009-09-22 21:47:24 +0000 | [diff] [blame] | 376 | |
Mark Dickinson | 418f81d | 2009-09-24 20:04:23 +0000 | [diff] [blame] | 377 | # Check that the range.__contains__ optimization is only |
| 378 | # used for ints, not for instances of subclasses of int. |
| 379 | class C3(int): |
| 380 | def __eq__(self, other): return True |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 381 | self.assertIn(C3(11), range(10)) |
| 382 | self.assertIn(C3(11), list(range(10))) |
Mark Dickinson | 3e124ae | 2009-09-22 21:47:24 +0000 | [diff] [blame] | 383 | |
| 384 | def test_strided_limits(self): |
| 385 | r = range(0, 101, 2) |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 386 | self.assertIn(0, r) |
Ezio Melotti | b58e0bd | 2010-01-23 15:40:09 +0000 | [diff] [blame] | 387 | self.assertNotIn(1, r) |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 388 | self.assertIn(2, r) |
Ezio Melotti | b58e0bd | 2010-01-23 15:40:09 +0000 | [diff] [blame] | 389 | self.assertNotIn(99, r) |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 390 | self.assertIn(100, r) |
Ezio Melotti | b58e0bd | 2010-01-23 15:40:09 +0000 | [diff] [blame] | 391 | self.assertNotIn(101, r) |
Mark Dickinson | 3e124ae | 2009-09-22 21:47:24 +0000 | [diff] [blame] | 392 | |
| 393 | r = range(0, -20, -1) |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 394 | self.assertIn(0, r) |
| 395 | self.assertIn(-1, r) |
| 396 | self.assertIn(-19, r) |
Ezio Melotti | b58e0bd | 2010-01-23 15:40:09 +0000 | [diff] [blame] | 397 | self.assertNotIn(-20, r) |
Mark Dickinson | 3e124ae | 2009-09-22 21:47:24 +0000 | [diff] [blame] | 398 | |
| 399 | r = range(0, -20, -2) |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 400 | self.assertIn(-18, r) |
Ezio Melotti | b58e0bd | 2010-01-23 15:40:09 +0000 | [diff] [blame] | 401 | self.assertNotIn(-19, r) |
| 402 | self.assertNotIn(-20, r) |
Mark Dickinson | 3e124ae | 2009-09-22 21:47:24 +0000 | [diff] [blame] | 403 | |
| 404 | def test_empty(self): |
| 405 | r = range(0) |
Ezio Melotti | b58e0bd | 2010-01-23 15:40:09 +0000 | [diff] [blame] | 406 | self.assertNotIn(0, r) |
| 407 | self.assertNotIn(1, r) |
Mark Dickinson | 3e124ae | 2009-09-22 21:47:24 +0000 | [diff] [blame] | 408 | |
| 409 | r = range(0, -10) |
Ezio Melotti | b58e0bd | 2010-01-23 15:40:09 +0000 | [diff] [blame] | 410 | self.assertNotIn(0, r) |
| 411 | self.assertNotIn(-1, r) |
| 412 | self.assertNotIn(1, r) |
Mark Dickinson | 3e124ae | 2009-09-22 21:47:24 +0000 | [diff] [blame] | 413 | |
Mark Dickinson | d550c9a | 2009-11-15 09:57:26 +0000 | [diff] [blame] | 414 | def test_range_iterators(self): |
| 415 | # exercise 'fast' iterators, that use a rangeiterobject internally. |
| 416 | # see issue 7298 |
| 417 | limits = [base + jiggle |
| 418 | for M in (2**32, 2**64) |
| 419 | for base in (-M, -M//2, 0, M//2, M) |
| 420 | for jiggle in (-2, -1, 0, 1, 2)] |
| 421 | test_ranges = [(start, end, step) |
| 422 | for start in limits |
| 423 | for end in limits |
| 424 | for step in (-2**63, -2**31, -2, -1, 1, 2)] |
| 425 | |
| 426 | for start, end, step in test_ranges: |
| 427 | iter1 = range(start, end, step) |
| 428 | iter2 = pyrange(start, end, step) |
| 429 | test_id = "range({}, {}, {})".format(start, end, step) |
| 430 | # check first 100 entries |
| 431 | self.assert_iterators_equal(iter1, iter2, test_id, limit=100) |
| 432 | |
| 433 | iter1 = reversed(range(start, end, step)) |
| 434 | iter2 = pyrange_reversed(start, end, step) |
| 435 | test_id = "reversed(range({}, {}, {}))".format(start, end, step) |
| 436 | self.assert_iterators_equal(iter1, iter2, test_id, limit=100) |
| 437 | |
Nick Coghlan | 37ee850 | 2010-12-03 14:26:13 +0000 | [diff] [blame] | 438 | def test_slice(self): |
| 439 | def check(start, stop, step=None): |
| 440 | i = slice(start, stop, step) |
| 441 | self.assertEqual(list(r[i]), list(r)[i]) |
| 442 | self.assertEqual(len(r[i]), len(list(r)[i])) |
| 443 | for r in [range(10), |
| 444 | range(0), |
| 445 | range(1, 9, 3), |
| 446 | range(8, 0, -3), |
| 447 | range(sys.maxsize+1, sys.maxsize+10), |
| 448 | ]: |
| 449 | check(0, 2) |
| 450 | check(0, 20) |
| 451 | check(1, 2) |
| 452 | check(20, 30) |
| 453 | check(-30, -20) |
| 454 | check(-1, 100, 2) |
| 455 | check(0, -1) |
| 456 | check(-1, -3, -1) |
| 457 | |
| 458 | def test_contains(self): |
| 459 | r = range(10) |
| 460 | self.assertIn(0, r) |
| 461 | self.assertIn(1, r) |
| 462 | self.assertIn(5.0, r) |
| 463 | self.assertNotIn(5.1, r) |
| 464 | self.assertNotIn(-1, r) |
| 465 | self.assertNotIn(10, r) |
| 466 | self.assertNotIn("", r) |
| 467 | r = range(9, -1, -1) |
| 468 | self.assertIn(0, r) |
| 469 | self.assertIn(1, r) |
| 470 | self.assertIn(5.0, r) |
| 471 | self.assertNotIn(5.1, r) |
| 472 | self.assertNotIn(-1, r) |
| 473 | self.assertNotIn(10, r) |
| 474 | self.assertNotIn("", r) |
| 475 | r = range(0, 10, 2) |
| 476 | self.assertIn(0, r) |
| 477 | self.assertNotIn(1, r) |
| 478 | self.assertNotIn(5.0, r) |
| 479 | self.assertNotIn(5.1, r) |
| 480 | self.assertNotIn(-1, r) |
| 481 | self.assertNotIn(10, r) |
| 482 | self.assertNotIn("", r) |
| 483 | r = range(9, -1, -2) |
| 484 | self.assertNotIn(0, r) |
| 485 | self.assertIn(1, r) |
| 486 | self.assertIn(5.0, r) |
| 487 | self.assertNotIn(5.1, r) |
| 488 | self.assertNotIn(-1, r) |
| 489 | self.assertNotIn(10, r) |
| 490 | self.assertNotIn("", r) |
| 491 | |
| 492 | def test_reverse_iteration(self): |
| 493 | for r in [range(10), |
| 494 | range(0), |
| 495 | range(1, 9, 3), |
| 496 | range(8, 0, -3), |
| 497 | range(sys.maxsize+1, sys.maxsize+10), |
| 498 | ]: |
| 499 | self.assertEqual(list(reversed(r)), list(r)[::-1]) |
| 500 | |
Ezio Melotti | 982ef4e | 2011-04-15 08:15:40 +0300 | [diff] [blame] | 501 | def test_issue11845(self): |
| 502 | r = range(*slice(1, 18, 2).indices(20)) |
| 503 | values = {None, 0, 1, -1, 2, -2, 5, -5, 19, -19, |
| 504 | 20, -20, 21, -21, 30, -30, 99, -99} |
| 505 | for i in values: |
| 506 | for j in values: |
| 507 | for k in values - {0}: |
| 508 | r[i:j:k] |
| 509 | |
Nick Coghlan | 37ee850 | 2010-12-03 14:26:13 +0000 | [diff] [blame] | 510 | |
Neal Norwitz | 1c0423a | 2004-07-08 01:59:55 +0000 | [diff] [blame] | 511 | def test_main(): |
Benjamin Peterson | ee8712c | 2008-05-20 21:35:26 +0000 | [diff] [blame] | 512 | test.support.run_unittest(RangeTest) |
Neal Norwitz | 1c0423a | 2004-07-08 01:59:55 +0000 | [diff] [blame] | 513 | |
| 514 | if __name__ == "__main__": |
| 515 | test_main() |