|
1 from test import test_support |
|
2 from test.test_support import bigmemtest, _1G, _2G |
|
3 |
|
4 import unittest |
|
5 import operator |
|
6 import string |
|
7 import sys |
|
8 |
|
9 # Bigmem testing houserules: |
|
10 # |
|
11 # - Try not to allocate too many large objects. It's okay to rely on |
|
12 # refcounting semantics, but don't forget that 's = create_largestring()' |
|
13 # doesn't release the old 's' (if it exists) until well after its new |
|
14 # value has been created. Use 'del s' before the create_largestring call. |
|
15 # |
|
16 # - Do *not* compare large objects using assertEquals or similar. It's a |
|
17 # lengty operation and the errormessage will be utterly useless due to |
|
18 # its size. To make sure whether a result has the right contents, better |
|
19 # to use the strip or count methods, or compare meaningful slices. |
|
20 # |
|
21 # - Don't forget to test for large indices, offsets and results and such, |
|
22 # in addition to large sizes. |
|
23 # |
|
24 # - When repeating an object (say, a substring, or a small list) to create |
|
25 # a large object, make the subobject of a length that is not a power of |
|
26 # 2. That way, int-wrapping problems are more easily detected. |
|
27 # |
|
28 # - While the bigmemtest decorator speaks of 'minsize', all tests will |
|
29 # actually be called with a much smaller number too, in the normal |
|
30 # test run (5Kb currently.) This is so the tests themselves get frequent |
|
31 # testing. Consequently, always make all large allocations based on the |
|
32 # passed-in 'size', and don't rely on the size being very large. Also, |
|
33 # memuse-per-size should remain sane (less than a few thousand); if your |
|
34 # test uses more, adjust 'size' upward, instead. |
|
35 |
|
36 class StrTest(unittest.TestCase): |
|
37 @bigmemtest(minsize=_2G, memuse=2) |
|
38 def test_capitalize(self, size): |
|
39 SUBSTR = ' abc def ghi' |
|
40 s = '-' * size + SUBSTR |
|
41 caps = s.capitalize() |
|
42 self.assertEquals(caps[-len(SUBSTR):], |
|
43 SUBSTR.capitalize()) |
|
44 self.assertEquals(caps.lstrip('-'), SUBSTR) |
|
45 |
|
46 @bigmemtest(minsize=_2G + 10, memuse=1) |
|
47 def test_center(self, size): |
|
48 SUBSTR = ' abc def ghi' |
|
49 s = SUBSTR.center(size) |
|
50 self.assertEquals(len(s), size) |
|
51 lpadsize = rpadsize = (len(s) - len(SUBSTR)) // 2 |
|
52 if len(s) % 2: |
|
53 lpadsize += 1 |
|
54 self.assertEquals(s[lpadsize:-rpadsize], SUBSTR) |
|
55 self.assertEquals(s.strip(), SUBSTR.strip()) |
|
56 |
|
57 @bigmemtest(minsize=_2G, memuse=2) |
|
58 def test_count(self, size): |
|
59 SUBSTR = ' abc def ghi' |
|
60 s = '.' * size + SUBSTR |
|
61 self.assertEquals(s.count('.'), size) |
|
62 s += '.' |
|
63 self.assertEquals(s.count('.'), size + 1) |
|
64 self.assertEquals(s.count(' '), 3) |
|
65 self.assertEquals(s.count('i'), 1) |
|
66 self.assertEquals(s.count('j'), 0) |
|
67 |
|
68 @bigmemtest(minsize=_2G + 2, memuse=3) |
|
69 def test_decode(self, size): |
|
70 s = '.' * size |
|
71 self.assertEquals(len(s.decode('utf-8')), size) |
|
72 |
|
73 @bigmemtest(minsize=_2G + 2, memuse=3) |
|
74 def test_encode(self, size): |
|
75 s = u'.' * size |
|
76 self.assertEquals(len(s.encode('utf-8')), size) |
|
77 |
|
78 @bigmemtest(minsize=_2G, memuse=2) |
|
79 def test_endswith(self, size): |
|
80 SUBSTR = ' abc def ghi' |
|
81 s = '-' * size + SUBSTR |
|
82 self.failUnless(s.endswith(SUBSTR)) |
|
83 self.failUnless(s.endswith(s)) |
|
84 s2 = '...' + s |
|
85 self.failUnless(s2.endswith(s)) |
|
86 self.failIf(s.endswith('a' + SUBSTR)) |
|
87 self.failIf(SUBSTR.endswith(s)) |
|
88 |
|
89 @bigmemtest(minsize=_2G + 10, memuse=2) |
|
90 def test_expandtabs(self, size): |
|
91 s = '-' * size |
|
92 tabsize = 8 |
|
93 self.assertEquals(s.expandtabs(), s) |
|
94 del s |
|
95 slen, remainder = divmod(size, tabsize) |
|
96 s = ' \t' * slen |
|
97 s = s.expandtabs(tabsize) |
|
98 self.assertEquals(len(s), size - remainder) |
|
99 self.assertEquals(len(s.strip(' ')), 0) |
|
100 |
|
101 @bigmemtest(minsize=_2G, memuse=2) |
|
102 def test_find(self, size): |
|
103 SUBSTR = ' abc def ghi' |
|
104 sublen = len(SUBSTR) |
|
105 s = ''.join([SUBSTR, '-' * size, SUBSTR]) |
|
106 self.assertEquals(s.find(' '), 0) |
|
107 self.assertEquals(s.find(SUBSTR), 0) |
|
108 self.assertEquals(s.find(' ', sublen), sublen + size) |
|
109 self.assertEquals(s.find(SUBSTR, len(SUBSTR)), sublen + size) |
|
110 self.assertEquals(s.find('i'), SUBSTR.find('i')) |
|
111 self.assertEquals(s.find('i', sublen), |
|
112 sublen + size + SUBSTR.find('i')) |
|
113 self.assertEquals(s.find('i', size), |
|
114 sublen + size + SUBSTR.find('i')) |
|
115 self.assertEquals(s.find('j'), -1) |
|
116 |
|
117 @bigmemtest(minsize=_2G, memuse=2) |
|
118 def test_index(self, size): |
|
119 SUBSTR = ' abc def ghi' |
|
120 sublen = len(SUBSTR) |
|
121 s = ''.join([SUBSTR, '-' * size, SUBSTR]) |
|
122 self.assertEquals(s.index(' '), 0) |
|
123 self.assertEquals(s.index(SUBSTR), 0) |
|
124 self.assertEquals(s.index(' ', sublen), sublen + size) |
|
125 self.assertEquals(s.index(SUBSTR, sublen), sublen + size) |
|
126 self.assertEquals(s.index('i'), SUBSTR.index('i')) |
|
127 self.assertEquals(s.index('i', sublen), |
|
128 sublen + size + SUBSTR.index('i')) |
|
129 self.assertEquals(s.index('i', size), |
|
130 sublen + size + SUBSTR.index('i')) |
|
131 self.assertRaises(ValueError, s.index, 'j') |
|
132 |
|
133 @bigmemtest(minsize=_2G, memuse=2) |
|
134 def test_isalnum(self, size): |
|
135 SUBSTR = '123456' |
|
136 s = 'a' * size + SUBSTR |
|
137 self.failUnless(s.isalnum()) |
|
138 s += '.' |
|
139 self.failIf(s.isalnum()) |
|
140 |
|
141 @bigmemtest(minsize=_2G, memuse=2) |
|
142 def test_isalpha(self, size): |
|
143 SUBSTR = 'zzzzzzz' |
|
144 s = 'a' * size + SUBSTR |
|
145 self.failUnless(s.isalpha()) |
|
146 s += '.' |
|
147 self.failIf(s.isalpha()) |
|
148 |
|
149 @bigmemtest(minsize=_2G, memuse=2) |
|
150 def test_isdigit(self, size): |
|
151 SUBSTR = '123456' |
|
152 s = '9' * size + SUBSTR |
|
153 self.failUnless(s.isdigit()) |
|
154 s += 'z' |
|
155 self.failIf(s.isdigit()) |
|
156 |
|
157 @bigmemtest(minsize=_2G, memuse=2) |
|
158 def test_islower(self, size): |
|
159 chars = ''.join([ chr(c) for c in range(255) if not chr(c).isupper() ]) |
|
160 repeats = size // len(chars) + 2 |
|
161 s = chars * repeats |
|
162 self.failUnless(s.islower()) |
|
163 s += 'A' |
|
164 self.failIf(s.islower()) |
|
165 |
|
166 @bigmemtest(minsize=_2G, memuse=2) |
|
167 def test_isspace(self, size): |
|
168 whitespace = ' \f\n\r\t\v' |
|
169 repeats = size // len(whitespace) + 2 |
|
170 s = whitespace * repeats |
|
171 self.failUnless(s.isspace()) |
|
172 s += 'j' |
|
173 self.failIf(s.isspace()) |
|
174 |
|
175 @bigmemtest(minsize=_2G, memuse=2) |
|
176 def test_istitle(self, size): |
|
177 SUBSTR = '123456' |
|
178 s = ''.join(['A', 'a' * size, SUBSTR]) |
|
179 self.failUnless(s.istitle()) |
|
180 s += 'A' |
|
181 self.failUnless(s.istitle()) |
|
182 s += 'aA' |
|
183 self.failIf(s.istitle()) |
|
184 |
|
185 @bigmemtest(minsize=_2G, memuse=2) |
|
186 def test_isupper(self, size): |
|
187 chars = ''.join([ chr(c) for c in range(255) if not chr(c).islower() ]) |
|
188 repeats = size // len(chars) + 2 |
|
189 s = chars * repeats |
|
190 self.failUnless(s.isupper()) |
|
191 s += 'a' |
|
192 self.failIf(s.isupper()) |
|
193 |
|
194 @bigmemtest(minsize=_2G, memuse=2) |
|
195 def test_join(self, size): |
|
196 s = 'A' * size |
|
197 x = s.join(['aaaaa', 'bbbbb']) |
|
198 self.assertEquals(x.count('a'), 5) |
|
199 self.assertEquals(x.count('b'), 5) |
|
200 self.failUnless(x.startswith('aaaaaA')) |
|
201 self.failUnless(x.endswith('Abbbbb')) |
|
202 |
|
203 @bigmemtest(minsize=_2G + 10, memuse=1) |
|
204 def test_ljust(self, size): |
|
205 SUBSTR = ' abc def ghi' |
|
206 s = SUBSTR.ljust(size) |
|
207 self.failUnless(s.startswith(SUBSTR + ' ')) |
|
208 self.assertEquals(len(s), size) |
|
209 self.assertEquals(s.strip(), SUBSTR.strip()) |
|
210 |
|
211 @bigmemtest(minsize=_2G + 10, memuse=2) |
|
212 def test_lower(self, size): |
|
213 s = 'A' * size |
|
214 s = s.lower() |
|
215 self.assertEquals(len(s), size) |
|
216 self.assertEquals(s.count('a'), size) |
|
217 |
|
218 @bigmemtest(minsize=_2G + 10, memuse=1) |
|
219 def test_lstrip(self, size): |
|
220 SUBSTR = 'abc def ghi' |
|
221 s = SUBSTR.rjust(size) |
|
222 self.assertEquals(len(s), size) |
|
223 self.assertEquals(s.lstrip(), SUBSTR.lstrip()) |
|
224 del s |
|
225 s = SUBSTR.ljust(size) |
|
226 self.assertEquals(len(s), size) |
|
227 stripped = s.lstrip() |
|
228 self.failUnless(stripped is s) |
|
229 |
|
230 @bigmemtest(minsize=_2G + 10, memuse=2) |
|
231 def test_replace(self, size): |
|
232 replacement = 'a' |
|
233 s = ' ' * size |
|
234 s = s.replace(' ', replacement) |
|
235 self.assertEquals(len(s), size) |
|
236 self.assertEquals(s.count(replacement), size) |
|
237 s = s.replace(replacement, ' ', size - 4) |
|
238 self.assertEquals(len(s), size) |
|
239 self.assertEquals(s.count(replacement), 4) |
|
240 self.assertEquals(s[-10:], ' aaaa') |
|
241 |
|
242 @bigmemtest(minsize=_2G, memuse=2) |
|
243 def test_rfind(self, size): |
|
244 SUBSTR = ' abc def ghi' |
|
245 sublen = len(SUBSTR) |
|
246 s = ''.join([SUBSTR, '-' * size, SUBSTR]) |
|
247 self.assertEquals(s.rfind(' '), sublen + size + SUBSTR.rfind(' ')) |
|
248 self.assertEquals(s.rfind(SUBSTR), sublen + size) |
|
249 self.assertEquals(s.rfind(' ', 0, size), SUBSTR.rfind(' ')) |
|
250 self.assertEquals(s.rfind(SUBSTR, 0, sublen + size), 0) |
|
251 self.assertEquals(s.rfind('i'), sublen + size + SUBSTR.rfind('i')) |
|
252 self.assertEquals(s.rfind('i', 0, sublen), SUBSTR.rfind('i')) |
|
253 self.assertEquals(s.rfind('i', 0, sublen + size), |
|
254 SUBSTR.rfind('i')) |
|
255 self.assertEquals(s.rfind('j'), -1) |
|
256 |
|
257 @bigmemtest(minsize=_2G, memuse=2) |
|
258 def test_rindex(self, size): |
|
259 SUBSTR = ' abc def ghi' |
|
260 sublen = len(SUBSTR) |
|
261 s = ''.join([SUBSTR, '-' * size, SUBSTR]) |
|
262 self.assertEquals(s.rindex(' '), |
|
263 sublen + size + SUBSTR.rindex(' ')) |
|
264 self.assertEquals(s.rindex(SUBSTR), sublen + size) |
|
265 self.assertEquals(s.rindex(' ', 0, sublen + size - 1), |
|
266 SUBSTR.rindex(' ')) |
|
267 self.assertEquals(s.rindex(SUBSTR, 0, sublen + size), 0) |
|
268 self.assertEquals(s.rindex('i'), |
|
269 sublen + size + SUBSTR.rindex('i')) |
|
270 self.assertEquals(s.rindex('i', 0, sublen), SUBSTR.rindex('i')) |
|
271 self.assertEquals(s.rindex('i', 0, sublen + size), |
|
272 SUBSTR.rindex('i')) |
|
273 self.assertRaises(ValueError, s.rindex, 'j') |
|
274 |
|
275 @bigmemtest(minsize=_2G + 10, memuse=1) |
|
276 def test_rjust(self, size): |
|
277 SUBSTR = ' abc def ghi' |
|
278 s = SUBSTR.ljust(size) |
|
279 self.failUnless(s.startswith(SUBSTR + ' ')) |
|
280 self.assertEquals(len(s), size) |
|
281 self.assertEquals(s.strip(), SUBSTR.strip()) |
|
282 |
|
283 @bigmemtest(minsize=_2G + 10, memuse=1) |
|
284 def test_rstrip(self, size): |
|
285 SUBSTR = ' abc def ghi' |
|
286 s = SUBSTR.ljust(size) |
|
287 self.assertEquals(len(s), size) |
|
288 self.assertEquals(s.rstrip(), SUBSTR.rstrip()) |
|
289 del s |
|
290 s = SUBSTR.rjust(size) |
|
291 self.assertEquals(len(s), size) |
|
292 stripped = s.rstrip() |
|
293 self.failUnless(stripped is s) |
|
294 |
|
295 # The test takes about size bytes to build a string, and then about |
|
296 # sqrt(size) substrings of sqrt(size) in size and a list to |
|
297 # hold sqrt(size) items. It's close but just over 2x size. |
|
298 @bigmemtest(minsize=_2G, memuse=2.1) |
|
299 def test_split_small(self, size): |
|
300 # Crudely calculate an estimate so that the result of s.split won't |
|
301 # take up an inordinate amount of memory |
|
302 chunksize = int(size ** 0.5 + 2) |
|
303 SUBSTR = 'a' + ' ' * chunksize |
|
304 s = SUBSTR * chunksize |
|
305 l = s.split() |
|
306 self.assertEquals(len(l), chunksize) |
|
307 self.assertEquals(set(l), set(['a'])) |
|
308 del l |
|
309 l = s.split('a') |
|
310 self.assertEquals(len(l), chunksize + 1) |
|
311 self.assertEquals(set(l), set(['', ' ' * chunksize])) |
|
312 |
|
313 # Allocates a string of twice size (and briefly two) and a list of |
|
314 # size. Because of internal affairs, the s.split() call produces a |
|
315 # list of size times the same one-character string, so we only |
|
316 # suffer for the list size. (Otherwise, it'd cost another 48 times |
|
317 # size in bytes!) Nevertheless, a list of size takes |
|
318 # 8*size bytes. |
|
319 @bigmemtest(minsize=_2G + 5, memuse=10) |
|
320 def test_split_large(self, size): |
|
321 s = ' a' * size + ' ' |
|
322 l = s.split() |
|
323 self.assertEquals(len(l), size) |
|
324 self.assertEquals(set(l), set(['a'])) |
|
325 del l |
|
326 l = s.split('a') |
|
327 self.assertEquals(len(l), size + 1) |
|
328 self.assertEquals(set(l), set([' '])) |
|
329 |
|
330 @bigmemtest(minsize=_2G, memuse=2.1) |
|
331 def test_splitlines(self, size): |
|
332 # Crudely calculate an estimate so that the result of s.split won't |
|
333 # take up an inordinate amount of memory |
|
334 chunksize = int(size ** 0.5 + 2) // 2 |
|
335 SUBSTR = ' ' * chunksize + '\n' + ' ' * chunksize + '\r\n' |
|
336 s = SUBSTR * chunksize |
|
337 l = s.splitlines() |
|
338 self.assertEquals(len(l), chunksize * 2) |
|
339 self.assertEquals(set(l), set([' ' * chunksize])) |
|
340 |
|
341 @bigmemtest(minsize=_2G, memuse=2) |
|
342 def test_startswith(self, size): |
|
343 SUBSTR = ' abc def ghi' |
|
344 s = '-' * size + SUBSTR |
|
345 self.failUnless(s.startswith(s)) |
|
346 self.failUnless(s.startswith('-' * size)) |
|
347 self.failIf(s.startswith(SUBSTR)) |
|
348 |
|
349 @bigmemtest(minsize=_2G, memuse=1) |
|
350 def test_strip(self, size): |
|
351 SUBSTR = ' abc def ghi ' |
|
352 s = SUBSTR.rjust(size) |
|
353 self.assertEquals(len(s), size) |
|
354 self.assertEquals(s.strip(), SUBSTR.strip()) |
|
355 del s |
|
356 s = SUBSTR.ljust(size) |
|
357 self.assertEquals(len(s), size) |
|
358 self.assertEquals(s.strip(), SUBSTR.strip()) |
|
359 |
|
360 @bigmemtest(minsize=_2G, memuse=2) |
|
361 def test_swapcase(self, size): |
|
362 SUBSTR = "aBcDeFG12.'\xa9\x00" |
|
363 sublen = len(SUBSTR) |
|
364 repeats = size // sublen + 2 |
|
365 s = SUBSTR * repeats |
|
366 s = s.swapcase() |
|
367 self.assertEquals(len(s), sublen * repeats) |
|
368 self.assertEquals(s[:sublen * 3], SUBSTR.swapcase() * 3) |
|
369 self.assertEquals(s[-sublen * 3:], SUBSTR.swapcase() * 3) |
|
370 |
|
371 @bigmemtest(minsize=_2G, memuse=2) |
|
372 def test_title(self, size): |
|
373 SUBSTR = 'SpaaHAaaAaham' |
|
374 s = SUBSTR * (size // len(SUBSTR) + 2) |
|
375 s = s.title() |
|
376 self.failUnless(s.startswith((SUBSTR * 3).title())) |
|
377 self.failUnless(s.endswith(SUBSTR.lower() * 3)) |
|
378 |
|
379 @bigmemtest(minsize=_2G, memuse=2) |
|
380 def test_translate(self, size): |
|
381 trans = string.maketrans('.aZ', '-!$') |
|
382 SUBSTR = 'aZz.z.Aaz.' |
|
383 sublen = len(SUBSTR) |
|
384 repeats = size // sublen + 2 |
|
385 s = SUBSTR * repeats |
|
386 s = s.translate(trans) |
|
387 self.assertEquals(len(s), repeats * sublen) |
|
388 self.assertEquals(s[:sublen], SUBSTR.translate(trans)) |
|
389 self.assertEquals(s[-sublen:], SUBSTR.translate(trans)) |
|
390 self.assertEquals(s.count('.'), 0) |
|
391 self.assertEquals(s.count('!'), repeats * 2) |
|
392 self.assertEquals(s.count('z'), repeats * 3) |
|
393 |
|
394 @bigmemtest(minsize=_2G + 5, memuse=2) |
|
395 def test_upper(self, size): |
|
396 s = 'a' * size |
|
397 s = s.upper() |
|
398 self.assertEquals(len(s), size) |
|
399 self.assertEquals(s.count('A'), size) |
|
400 |
|
401 @bigmemtest(minsize=_2G + 20, memuse=1) |
|
402 def test_zfill(self, size): |
|
403 SUBSTR = '-568324723598234' |
|
404 s = SUBSTR.zfill(size) |
|
405 self.failUnless(s.endswith('0' + SUBSTR[1:])) |
|
406 self.failUnless(s.startswith('-0')) |
|
407 self.assertEquals(len(s), size) |
|
408 self.assertEquals(s.count('0'), size - len(SUBSTR)) |
|
409 |
|
410 @bigmemtest(minsize=_2G + 10, memuse=2) |
|
411 def test_format(self, size): |
|
412 s = '-' * size |
|
413 sf = '%s' % (s,) |
|
414 self.failUnless(s == sf) |
|
415 del sf |
|
416 sf = '..%s..' % (s,) |
|
417 self.assertEquals(len(sf), len(s) + 4) |
|
418 self.failUnless(sf.startswith('..-')) |
|
419 self.failUnless(sf.endswith('-..')) |
|
420 del s, sf |
|
421 |
|
422 size //= 2 |
|
423 edge = '-' * size |
|
424 s = ''.join([edge, '%s', edge]) |
|
425 del edge |
|
426 s = s % '...' |
|
427 self.assertEquals(len(s), size * 2 + 3) |
|
428 self.assertEquals(s.count('.'), 3) |
|
429 self.assertEquals(s.count('-'), size * 2) |
|
430 |
|
431 @bigmemtest(minsize=_2G + 10, memuse=2) |
|
432 def test_repr_small(self, size): |
|
433 s = '-' * size |
|
434 s = repr(s) |
|
435 self.assertEquals(len(s), size + 2) |
|
436 self.assertEquals(s[0], "'") |
|
437 self.assertEquals(s[-1], "'") |
|
438 self.assertEquals(s.count('-'), size) |
|
439 del s |
|
440 # repr() will create a string four times as large as this 'binary |
|
441 # string', but we don't want to allocate much more than twice |
|
442 # size in total. (We do extra testing in test_repr_large()) |
|
443 size = size // 5 * 2 |
|
444 s = '\x00' * size |
|
445 s = repr(s) |
|
446 self.assertEquals(len(s), size * 4 + 2) |
|
447 self.assertEquals(s[0], "'") |
|
448 self.assertEquals(s[-1], "'") |
|
449 self.assertEquals(s.count('\\'), size) |
|
450 self.assertEquals(s.count('0'), size * 2) |
|
451 |
|
452 @bigmemtest(minsize=_2G + 10, memuse=5) |
|
453 def test_repr_large(self, size): |
|
454 s = '\x00' * size |
|
455 s = repr(s) |
|
456 self.assertEquals(len(s), size * 4 + 2) |
|
457 self.assertEquals(s[0], "'") |
|
458 self.assertEquals(s[-1], "'") |
|
459 self.assertEquals(s.count('\\'), size) |
|
460 self.assertEquals(s.count('0'), size * 2) |
|
461 |
|
462 # This test is meaningful even with size < 2G, as long as the |
|
463 # doubled string is > 2G (but it tests more if both are > 2G :) |
|
464 @bigmemtest(minsize=_1G + 2, memuse=3) |
|
465 def test_concat(self, size): |
|
466 s = '.' * size |
|
467 self.assertEquals(len(s), size) |
|
468 s = s + s |
|
469 self.assertEquals(len(s), size * 2) |
|
470 self.assertEquals(s.count('.'), size * 2) |
|
471 |
|
472 # This test is meaningful even with size < 2G, as long as the |
|
473 # repeated string is > 2G (but it tests more if both are > 2G :) |
|
474 @bigmemtest(minsize=_1G + 2, memuse=3) |
|
475 def test_repeat(self, size): |
|
476 s = '.' * size |
|
477 self.assertEquals(len(s), size) |
|
478 s = s * 2 |
|
479 self.assertEquals(len(s), size * 2) |
|
480 self.assertEquals(s.count('.'), size * 2) |
|
481 |
|
482 @bigmemtest(minsize=_2G + 20, memuse=1) |
|
483 def test_slice_and_getitem(self, size): |
|
484 SUBSTR = '0123456789' |
|
485 sublen = len(SUBSTR) |
|
486 s = SUBSTR * (size // sublen) |
|
487 stepsize = len(s) // 100 |
|
488 stepsize = stepsize - (stepsize % sublen) |
|
489 for i in range(0, len(s) - stepsize, stepsize): |
|
490 self.assertEquals(s[i], SUBSTR[0]) |
|
491 self.assertEquals(s[i:i + sublen], SUBSTR) |
|
492 self.assertEquals(s[i:i + sublen:2], SUBSTR[::2]) |
|
493 if i > 0: |
|
494 self.assertEquals(s[i + sublen - 1:i - 1:-3], |
|
495 SUBSTR[sublen::-3]) |
|
496 # Make sure we do some slicing and indexing near the end of the |
|
497 # string, too. |
|
498 self.assertEquals(s[len(s) - 1], SUBSTR[-1]) |
|
499 self.assertEquals(s[-1], SUBSTR[-1]) |
|
500 self.assertEquals(s[len(s) - 10], SUBSTR[0]) |
|
501 self.assertEquals(s[-sublen], SUBSTR[0]) |
|
502 self.assertEquals(s[len(s):], '') |
|
503 self.assertEquals(s[len(s) - 1:], SUBSTR[-1]) |
|
504 self.assertEquals(s[-1:], SUBSTR[-1]) |
|
505 self.assertEquals(s[len(s) - sublen:], SUBSTR) |
|
506 self.assertEquals(s[-sublen:], SUBSTR) |
|
507 self.assertEquals(len(s[:]), len(s)) |
|
508 self.assertEquals(len(s[:len(s) - 5]), len(s) - 5) |
|
509 self.assertEquals(len(s[5:-5]), len(s) - 10) |
|
510 |
|
511 self.assertRaises(IndexError, operator.getitem, s, len(s)) |
|
512 self.assertRaises(IndexError, operator.getitem, s, len(s) + 1) |
|
513 self.assertRaises(IndexError, operator.getitem, s, len(s) + 1<<31) |
|
514 |
|
515 @bigmemtest(minsize=_2G, memuse=2) |
|
516 def test_contains(self, size): |
|
517 SUBSTR = '0123456789' |
|
518 edge = '-' * (size // 2) |
|
519 s = ''.join([edge, SUBSTR, edge]) |
|
520 del edge |
|
521 self.failUnless(SUBSTR in s) |
|
522 self.failIf(SUBSTR * 2 in s) |
|
523 self.failUnless('-' in s) |
|
524 self.failIf('a' in s) |
|
525 s += 'a' |
|
526 self.failUnless('a' in s) |
|
527 |
|
528 @bigmemtest(minsize=_2G + 10, memuse=2) |
|
529 def test_compare(self, size): |
|
530 s1 = '-' * size |
|
531 s2 = '-' * size |
|
532 self.failUnless(s1 == s2) |
|
533 del s2 |
|
534 s2 = s1 + 'a' |
|
535 self.failIf(s1 == s2) |
|
536 del s2 |
|
537 s2 = '.' * size |
|
538 self.failIf(s1 == s2) |
|
539 |
|
540 @bigmemtest(minsize=_2G + 10, memuse=1) |
|
541 def test_hash(self, size): |
|
542 # Not sure if we can do any meaningful tests here... Even if we |
|
543 # start relying on the exact algorithm used, the result will be |
|
544 # different depending on the size of the C 'long int'. Even this |
|
545 # test is dodgy (there's no *guarantee* that the two things should |
|
546 # have a different hash, even if they, in the current |
|
547 # implementation, almost always do.) |
|
548 s = '\x00' * size |
|
549 h1 = hash(s) |
|
550 del s |
|
551 s = '\x00' * (size + 1) |
|
552 self.failIf(h1 == hash(s)) |
|
553 |
|
554 class TupleTest(unittest.TestCase): |
|
555 |
|
556 # Tuples have a small, fixed-sized head and an array of pointers to |
|
557 # data. Since we're testing 64-bit addressing, we can assume that the |
|
558 # pointers are 8 bytes, and that thus that the tuples take up 8 bytes |
|
559 # per size. |
|
560 |
|
561 # As a side-effect of testing long tuples, these tests happen to test |
|
562 # having more than 2<<31 references to any given object. Hence the |
|
563 # use of different types of objects as contents in different tests. |
|
564 |
|
565 @bigmemtest(minsize=_2G + 2, memuse=16) |
|
566 def test_compare(self, size): |
|
567 t1 = (u'',) * size |
|
568 t2 = (u'',) * size |
|
569 self.failUnless(t1 == t2) |
|
570 del t2 |
|
571 t2 = (u'',) * (size + 1) |
|
572 self.failIf(t1 == t2) |
|
573 del t2 |
|
574 t2 = (1,) * size |
|
575 self.failIf(t1 == t2) |
|
576 |
|
577 # Test concatenating into a single tuple of more than 2G in length, |
|
578 # and concatenating a tuple of more than 2G in length separately, so |
|
579 # the smaller test still gets run even if there isn't memory for the |
|
580 # larger test (but we still let the tester know the larger test is |
|
581 # skipped, in verbose mode.) |
|
582 def basic_concat_test(self, size): |
|
583 t = ((),) * size |
|
584 self.assertEquals(len(t), size) |
|
585 t = t + t |
|
586 self.assertEquals(len(t), size * 2) |
|
587 |
|
588 @bigmemtest(minsize=_2G // 2 + 2, memuse=24) |
|
589 def test_concat_small(self, size): |
|
590 return self.basic_concat_test(size) |
|
591 |
|
592 @bigmemtest(minsize=_2G + 2, memuse=24) |
|
593 def test_concat_large(self, size): |
|
594 return self.basic_concat_test(size) |
|
595 |
|
596 @bigmemtest(minsize=_2G // 5 + 10, memuse=8 * 5) |
|
597 def test_contains(self, size): |
|
598 t = (1, 2, 3, 4, 5) * size |
|
599 self.assertEquals(len(t), size * 5) |
|
600 self.failUnless(5 in t) |
|
601 self.failIf((1, 2, 3, 4, 5) in t) |
|
602 self.failIf(0 in t) |
|
603 |
|
604 @bigmemtest(minsize=_2G + 10, memuse=8) |
|
605 def test_hash(self, size): |
|
606 t1 = (0,) * size |
|
607 h1 = hash(t1) |
|
608 del t1 |
|
609 t2 = (0,) * (size + 1) |
|
610 self.failIf(h1 == hash(t2)) |
|
611 |
|
612 @bigmemtest(minsize=_2G + 10, memuse=8) |
|
613 def test_index_and_slice(self, size): |
|
614 t = (None,) * size |
|
615 self.assertEquals(len(t), size) |
|
616 self.assertEquals(t[-1], None) |
|
617 self.assertEquals(t[5], None) |
|
618 self.assertEquals(t[size - 1], None) |
|
619 self.assertRaises(IndexError, operator.getitem, t, size) |
|
620 self.assertEquals(t[:5], (None,) * 5) |
|
621 self.assertEquals(t[-5:], (None,) * 5) |
|
622 self.assertEquals(t[20:25], (None,) * 5) |
|
623 self.assertEquals(t[-25:-20], (None,) * 5) |
|
624 self.assertEquals(t[size - 5:], (None,) * 5) |
|
625 self.assertEquals(t[size - 5:size], (None,) * 5) |
|
626 self.assertEquals(t[size - 6:size - 2], (None,) * 4) |
|
627 self.assertEquals(t[size:size], ()) |
|
628 self.assertEquals(t[size:size+5], ()) |
|
629 |
|
630 # Like test_concat, split in two. |
|
631 def basic_test_repeat(self, size): |
|
632 t = ('',) * size |
|
633 self.assertEquals(len(t), size) |
|
634 t = t * 2 |
|
635 self.assertEquals(len(t), size * 2) |
|
636 |
|
637 @bigmemtest(minsize=_2G // 2 + 2, memuse=24) |
|
638 def test_repeat_small(self, size): |
|
639 return self.basic_test_repeat(size) |
|
640 |
|
641 @bigmemtest(minsize=_2G + 2, memuse=24) |
|
642 def test_repeat_large(self, size): |
|
643 return self.basic_test_repeat(size) |
|
644 |
|
645 # Like test_concat, split in two. |
|
646 def basic_test_repr(self, size): |
|
647 t = (0,) * size |
|
648 s = repr(t) |
|
649 # The repr of a tuple of 0's is exactly three times the tuple length. |
|
650 self.assertEquals(len(s), size * 3) |
|
651 self.assertEquals(s[:5], '(0, 0') |
|
652 self.assertEquals(s[-5:], '0, 0)') |
|
653 self.assertEquals(s.count('0'), size) |
|
654 |
|
655 @bigmemtest(minsize=_2G // 3 + 2, memuse=8 + 3) |
|
656 def test_repr_small(self, size): |
|
657 return self.basic_test_repr(size) |
|
658 |
|
659 @bigmemtest(minsize=_2G + 2, memuse=8 + 3) |
|
660 def test_repr_large(self, size): |
|
661 return self.basic_test_repr(size) |
|
662 |
|
663 class ListTest(unittest.TestCase): |
|
664 |
|
665 # Like tuples, lists have a small, fixed-sized head and an array of |
|
666 # pointers to data, so 8 bytes per size. Also like tuples, we make the |
|
667 # lists hold references to various objects to test their refcount |
|
668 # limits. |
|
669 |
|
670 @bigmemtest(minsize=_2G + 2, memuse=16) |
|
671 def test_compare(self, size): |
|
672 l1 = [u''] * size |
|
673 l2 = [u''] * size |
|
674 self.failUnless(l1 == l2) |
|
675 del l2 |
|
676 l2 = [u''] * (size + 1) |
|
677 self.failIf(l1 == l2) |
|
678 del l2 |
|
679 l2 = [2] * size |
|
680 self.failIf(l1 == l2) |
|
681 |
|
682 # Test concatenating into a single list of more than 2G in length, |
|
683 # and concatenating a list of more than 2G in length separately, so |
|
684 # the smaller test still gets run even if there isn't memory for the |
|
685 # larger test (but we still let the tester know the larger test is |
|
686 # skipped, in verbose mode.) |
|
687 def basic_test_concat(self, size): |
|
688 l = [[]] * size |
|
689 self.assertEquals(len(l), size) |
|
690 l = l + l |
|
691 self.assertEquals(len(l), size * 2) |
|
692 |
|
693 @bigmemtest(minsize=_2G // 2 + 2, memuse=24) |
|
694 def test_concat_small(self, size): |
|
695 return self.basic_test_concat(size) |
|
696 |
|
697 @bigmemtest(minsize=_2G + 2, memuse=24) |
|
698 def test_concat_large(self, size): |
|
699 return self.basic_test_concat(size) |
|
700 |
|
701 def basic_test_inplace_concat(self, size): |
|
702 l = [sys.stdout] * size |
|
703 l += l |
|
704 self.assertEquals(len(l), size * 2) |
|
705 self.failUnless(l[0] is l[-1]) |
|
706 self.failUnless(l[size - 1] is l[size + 1]) |
|
707 |
|
708 @bigmemtest(minsize=_2G // 2 + 2, memuse=24) |
|
709 def test_inplace_concat_small(self, size): |
|
710 return self.basic_test_inplace_concat(size) |
|
711 |
|
712 @bigmemtest(minsize=_2G + 2, memuse=24) |
|
713 def test_inplace_concat_large(self, size): |
|
714 return self.basic_test_inplace_concat(size) |
|
715 |
|
716 @bigmemtest(minsize=_2G // 5 + 10, memuse=8 * 5) |
|
717 def test_contains(self, size): |
|
718 l = [1, 2, 3, 4, 5] * size |
|
719 self.assertEquals(len(l), size * 5) |
|
720 self.failUnless(5 in l) |
|
721 self.failIf([1, 2, 3, 4, 5] in l) |
|
722 self.failIf(0 in l) |
|
723 |
|
724 @bigmemtest(minsize=_2G + 10, memuse=8) |
|
725 def test_hash(self, size): |
|
726 l = [0] * size |
|
727 self.failUnlessRaises(TypeError, hash, l) |
|
728 |
|
729 @bigmemtest(minsize=_2G + 10, memuse=8) |
|
730 def test_index_and_slice(self, size): |
|
731 l = [None] * size |
|
732 self.assertEquals(len(l), size) |
|
733 self.assertEquals(l[-1], None) |
|
734 self.assertEquals(l[5], None) |
|
735 self.assertEquals(l[size - 1], None) |
|
736 self.assertRaises(IndexError, operator.getitem, l, size) |
|
737 self.assertEquals(l[:5], [None] * 5) |
|
738 self.assertEquals(l[-5:], [None] * 5) |
|
739 self.assertEquals(l[20:25], [None] * 5) |
|
740 self.assertEquals(l[-25:-20], [None] * 5) |
|
741 self.assertEquals(l[size - 5:], [None] * 5) |
|
742 self.assertEquals(l[size - 5:size], [None] * 5) |
|
743 self.assertEquals(l[size - 6:size - 2], [None] * 4) |
|
744 self.assertEquals(l[size:size], []) |
|
745 self.assertEquals(l[size:size+5], []) |
|
746 |
|
747 l[size - 2] = 5 |
|
748 self.assertEquals(len(l), size) |
|
749 self.assertEquals(l[-3:], [None, 5, None]) |
|
750 self.assertEquals(l.count(5), 1) |
|
751 self.assertRaises(IndexError, operator.setitem, l, size, 6) |
|
752 self.assertEquals(len(l), size) |
|
753 |
|
754 l[size - 7:] = [1, 2, 3, 4, 5] |
|
755 size -= 2 |
|
756 self.assertEquals(len(l), size) |
|
757 self.assertEquals(l[-7:], [None, None, 1, 2, 3, 4, 5]) |
|
758 |
|
759 l[:7] = [1, 2, 3, 4, 5] |
|
760 size -= 2 |
|
761 self.assertEquals(len(l), size) |
|
762 self.assertEquals(l[:7], [1, 2, 3, 4, 5, None, None]) |
|
763 |
|
764 del l[size - 1] |
|
765 size -= 1 |
|
766 self.assertEquals(len(l), size) |
|
767 self.assertEquals(l[-1], 4) |
|
768 |
|
769 del l[-2:] |
|
770 size -= 2 |
|
771 self.assertEquals(len(l), size) |
|
772 self.assertEquals(l[-1], 2) |
|
773 |
|
774 del l[0] |
|
775 size -= 1 |
|
776 self.assertEquals(len(l), size) |
|
777 self.assertEquals(l[0], 2) |
|
778 |
|
779 del l[:2] |
|
780 size -= 2 |
|
781 self.assertEquals(len(l), size) |
|
782 self.assertEquals(l[0], 4) |
|
783 |
|
784 # Like test_concat, split in two. |
|
785 def basic_test_repeat(self, size): |
|
786 l = [] * size |
|
787 self.failIf(l) |
|
788 l = [''] * size |
|
789 self.assertEquals(len(l), size) |
|
790 l = l * 2 |
|
791 self.assertEquals(len(l), size * 2) |
|
792 |
|
793 @bigmemtest(minsize=_2G // 2 + 2, memuse=24) |
|
794 def test_repeat_small(self, size): |
|
795 return self.basic_test_repeat(size) |
|
796 |
|
797 @bigmemtest(minsize=_2G + 2, memuse=24) |
|
798 def test_repeat_large(self, size): |
|
799 return self.basic_test_repeat(size) |
|
800 |
|
801 def basic_test_inplace_repeat(self, size): |
|
802 l = [''] |
|
803 l *= size |
|
804 self.assertEquals(len(l), size) |
|
805 self.failUnless(l[0] is l[-1]) |
|
806 del l |
|
807 |
|
808 l = [''] * size |
|
809 l *= 2 |
|
810 self.assertEquals(len(l), size * 2) |
|
811 self.failUnless(l[size - 1] is l[-1]) |
|
812 |
|
813 @bigmemtest(minsize=_2G // 2 + 2, memuse=16) |
|
814 def test_inplace_repeat_small(self, size): |
|
815 return self.basic_test_inplace_repeat(size) |
|
816 |
|
817 @bigmemtest(minsize=_2G + 2, memuse=16) |
|
818 def test_inplace_repeat_large(self, size): |
|
819 return self.basic_test_inplace_repeat(size) |
|
820 |
|
821 def basic_test_repr(self, size): |
|
822 l = [0] * size |
|
823 s = repr(l) |
|
824 # The repr of a list of 0's is exactly three times the list length. |
|
825 self.assertEquals(len(s), size * 3) |
|
826 self.assertEquals(s[:5], '[0, 0') |
|
827 self.assertEquals(s[-5:], '0, 0]') |
|
828 self.assertEquals(s.count('0'), size) |
|
829 |
|
830 @bigmemtest(minsize=_2G // 3 + 2, memuse=8 + 3) |
|
831 def test_repr_small(self, size): |
|
832 return self.basic_test_repr(size) |
|
833 |
|
834 @bigmemtest(minsize=_2G + 2, memuse=8 + 3) |
|
835 def test_repr_large(self, size): |
|
836 return self.basic_test_repr(size) |
|
837 |
|
838 # list overallocates ~1/8th of the total size (on first expansion) so |
|
839 # the single list.append call puts memuse at 9 bytes per size. |
|
840 @bigmemtest(minsize=_2G, memuse=9) |
|
841 def test_append(self, size): |
|
842 l = [object()] * size |
|
843 l.append(object()) |
|
844 self.assertEquals(len(l), size+1) |
|
845 self.failUnless(l[-3] is l[-2]) |
|
846 self.failIf(l[-2] is l[-1]) |
|
847 |
|
848 @bigmemtest(minsize=_2G // 5 + 2, memuse=8 * 5) |
|
849 def test_count(self, size): |
|
850 l = [1, 2, 3, 4, 5] * size |
|
851 self.assertEquals(l.count(1), size) |
|
852 self.assertEquals(l.count("1"), 0) |
|
853 |
|
854 def basic_test_extend(self, size): |
|
855 l = [file] * size |
|
856 l.extend(l) |
|
857 self.assertEquals(len(l), size * 2) |
|
858 self.failUnless(l[0] is l[-1]) |
|
859 self.failUnless(l[size - 1] is l[size + 1]) |
|
860 |
|
861 @bigmemtest(minsize=_2G // 2 + 2, memuse=16) |
|
862 def test_extend_small(self, size): |
|
863 return self.basic_test_extend(size) |
|
864 |
|
865 @bigmemtest(minsize=_2G + 2, memuse=16) |
|
866 def test_extend_large(self, size): |
|
867 return self.basic_test_extend(size) |
|
868 |
|
869 @bigmemtest(minsize=_2G // 5 + 2, memuse=8 * 5) |
|
870 def test_index(self, size): |
|
871 l = [1L, 2L, 3L, 4L, 5L] * size |
|
872 size *= 5 |
|
873 self.assertEquals(l.index(1), 0) |
|
874 self.assertEquals(l.index(5, size - 5), size - 1) |
|
875 self.assertEquals(l.index(5, size - 5, size), size - 1) |
|
876 self.assertRaises(ValueError, l.index, 1, size - 4, size) |
|
877 self.assertRaises(ValueError, l.index, 6L) |
|
878 |
|
879 # This tests suffers from overallocation, just like test_append. |
|
880 @bigmemtest(minsize=_2G + 10, memuse=9) |
|
881 def test_insert(self, size): |
|
882 l = [1.0] * size |
|
883 l.insert(size - 1, "A") |
|
884 size += 1 |
|
885 self.assertEquals(len(l), size) |
|
886 self.assertEquals(l[-3:], [1.0, "A", 1.0]) |
|
887 |
|
888 l.insert(size + 1, "B") |
|
889 size += 1 |
|
890 self.assertEquals(len(l), size) |
|
891 self.assertEquals(l[-3:], ["A", 1.0, "B"]) |
|
892 |
|
893 l.insert(1, "C") |
|
894 size += 1 |
|
895 self.assertEquals(len(l), size) |
|
896 self.assertEquals(l[:3], [1.0, "C", 1.0]) |
|
897 self.assertEquals(l[size - 3:], ["A", 1.0, "B"]) |
|
898 |
|
899 @bigmemtest(minsize=_2G // 5 + 4, memuse=8 * 5) |
|
900 def test_pop(self, size): |
|
901 l = [u"a", u"b", u"c", u"d", u"e"] * size |
|
902 size *= 5 |
|
903 self.assertEquals(len(l), size) |
|
904 |
|
905 item = l.pop() |
|
906 size -= 1 |
|
907 self.assertEquals(len(l), size) |
|
908 self.assertEquals(item, u"e") |
|
909 self.assertEquals(l[-2:], [u"c", u"d"]) |
|
910 |
|
911 item = l.pop(0) |
|
912 size -= 1 |
|
913 self.assertEquals(len(l), size) |
|
914 self.assertEquals(item, u"a") |
|
915 self.assertEquals(l[:2], [u"b", u"c"]) |
|
916 |
|
917 item = l.pop(size - 2) |
|
918 size -= 1 |
|
919 self.assertEquals(len(l), size) |
|
920 self.assertEquals(item, u"c") |
|
921 self.assertEquals(l[-2:], [u"b", u"d"]) |
|
922 |
|
923 @bigmemtest(minsize=_2G + 10, memuse=8) |
|
924 def test_remove(self, size): |
|
925 l = [10] * size |
|
926 self.assertEquals(len(l), size) |
|
927 |
|
928 l.remove(10) |
|
929 size -= 1 |
|
930 self.assertEquals(len(l), size) |
|
931 |
|
932 # Because of the earlier l.remove(), this append doesn't trigger |
|
933 # a resize. |
|
934 l.append(5) |
|
935 size += 1 |
|
936 self.assertEquals(len(l), size) |
|
937 self.assertEquals(l[-2:], [10, 5]) |
|
938 l.remove(5) |
|
939 size -= 1 |
|
940 self.assertEquals(len(l), size) |
|
941 self.assertEquals(l[-2:], [10, 10]) |
|
942 |
|
943 @bigmemtest(minsize=_2G // 5 + 2, memuse=8 * 5) |
|
944 def test_reverse(self, size): |
|
945 l = [1, 2, 3, 4, 5] * size |
|
946 l.reverse() |
|
947 self.assertEquals(len(l), size * 5) |
|
948 self.assertEquals(l[-5:], [5, 4, 3, 2, 1]) |
|
949 self.assertEquals(l[:5], [5, 4, 3, 2, 1]) |
|
950 |
|
951 @bigmemtest(minsize=_2G // 5 + 2, memuse=8 * 5) |
|
952 def test_sort(self, size): |
|
953 l = [1, 2, 3, 4, 5] * size |
|
954 l.sort() |
|
955 self.assertEquals(len(l), size * 5) |
|
956 self.assertEquals(l.count(1), size) |
|
957 self.assertEquals(l[:10], [1] * 10) |
|
958 self.assertEquals(l[-10:], [5] * 10) |
|
959 |
|
960 def test_main(): |
|
961 test_support.run_unittest(StrTest, TupleTest, ListTest) |
|
962 |
|
963 if __name__ == '__main__': |
|
964 if len(sys.argv) > 1: |
|
965 test_support.set_memlimit(sys.argv[1]) |
|
966 test_main() |