diff options
Diffstat (limited to 'lib/python2.7/test/test_bigmem.py')
| -rw-r--r-- | lib/python2.7/test/test_bigmem.py | 1073 |
1 files changed, 0 insertions, 1073 deletions
diff --git a/lib/python2.7/test/test_bigmem.py b/lib/python2.7/test/test_bigmem.py deleted file mode 100644 index c41c373..0000000 --- a/lib/python2.7/test/test_bigmem.py +++ /dev/null @@ -1,1073 +0,0 @@ -from test import test_support -from test.test_support import bigmemtest, _1G, _2G, _4G, precisionbigmemtest - -import unittest -import operator -import string -import sys - -# Bigmem testing houserules: -# -# - Try not to allocate too many large objects. It's okay to rely on -# refcounting semantics, but don't forget that 's = create_largestring()' -# doesn't release the old 's' (if it exists) until well after its new -# value has been created. Use 'del s' before the create_largestring call. -# -# - Do *not* compare large objects using assertEqual or similar. It's a -# lengty operation and the errormessage will be utterly useless due to -# its size. To make sure whether a result has the right contents, better -# to use the strip or count methods, or compare meaningful slices. -# -# - Don't forget to test for large indices, offsets and results and such, -# in addition to large sizes. -# -# - When repeating an object (say, a substring, or a small list) to create -# a large object, make the subobject of a length that is not a power of -# 2. That way, int-wrapping problems are more easily detected. -# -# - While the bigmemtest decorator speaks of 'minsize', all tests will -# actually be called with a much smaller number too, in the normal -# test run (5Kb currently.) This is so the tests themselves get frequent -# testing. Consequently, always make all large allocations based on the -# passed-in 'size', and don't rely on the size being very large. Also, -# memuse-per-size should remain sane (less than a few thousand); if your -# test uses more, adjust 'size' upward, instead. - -class StrTest(unittest.TestCase): - @bigmemtest(minsize=_2G, memuse=2) - def test_capitalize(self, size): - SUBSTR = ' abc def ghi' - s = '-' * size + SUBSTR - caps = s.capitalize() - self.assertEqual(caps[-len(SUBSTR):], - SUBSTR.capitalize()) - self.assertEqual(caps.lstrip('-'), SUBSTR) - - @bigmemtest(minsize=_2G + 10, memuse=1) - def test_center(self, size): - SUBSTR = ' abc def ghi' - s = SUBSTR.center(size) - self.assertEqual(len(s), size) - lpadsize = rpadsize = (len(s) - len(SUBSTR)) // 2 - if len(s) % 2: - lpadsize += 1 - self.assertEqual(s[lpadsize:-rpadsize], SUBSTR) - self.assertEqual(s.strip(), SUBSTR.strip()) - - @precisionbigmemtest(size=_2G - 1, memuse=1) - def test_center_unicode(self, size): - SUBSTR = u' abc def ghi' - try: - s = SUBSTR.center(size) - except OverflowError: - pass # acceptable on 32-bit - else: - self.assertEqual(len(s), size) - lpadsize = rpadsize = (len(s) - len(SUBSTR)) // 2 - if len(s) % 2: - lpadsize += 1 - self.assertEqual(s[lpadsize:-rpadsize], SUBSTR) - self.assertEqual(s.strip(), SUBSTR.strip()) - del s - - @bigmemtest(minsize=_2G, memuse=2) - def test_count(self, size): - SUBSTR = ' abc def ghi' - s = '.' * size + SUBSTR - self.assertEqual(s.count('.'), size) - s += '.' - self.assertEqual(s.count('.'), size + 1) - self.assertEqual(s.count(' '), 3) - self.assertEqual(s.count('i'), 1) - self.assertEqual(s.count('j'), 0) - - @bigmemtest(minsize=_2G + 2, memuse=3) - def test_decode(self, size): - s = '.' * size - self.assertEqual(len(s.decode('utf-8')), size) - - def basic_encode_test(self, size, enc, c=u'.', expectedsize=None): - if expectedsize is None: - expectedsize = size - - s = c * size - self.assertEqual(len(s.encode(enc)), expectedsize) - - @bigmemtest(minsize=_2G + 2, memuse=3) - def test_encode(self, size): - return self.basic_encode_test(size, 'utf-8') - - @precisionbigmemtest(size=_4G // 6 + 2, memuse=2) - def test_encode_raw_unicode_escape(self, size): - try: - return self.basic_encode_test(size, 'raw_unicode_escape') - except MemoryError: - pass # acceptable on 32-bit - - @precisionbigmemtest(size=_4G // 5 + 70, memuse=3) - def test_encode_utf7(self, size): - try: - return self.basic_encode_test(size, 'utf7') - except MemoryError: - pass # acceptable on 32-bit - - @precisionbigmemtest(size=_4G // 4 + 5, memuse=6) - def test_encode_utf32(self, size): - try: - return self.basic_encode_test(size, 'utf32', expectedsize=4*size+4) - except MemoryError: - pass # acceptable on 32-bit - - @precisionbigmemtest(size=_2G-1, memuse=4) - def test_decodeascii(self, size): - return self.basic_encode_test(size, 'ascii', c='A') - - @precisionbigmemtest(size=_4G // 5, memuse=6+2) - def test_unicode_repr_oflw(self, size): - self.skipTest("test crashes - see issue #14904") - try: - s = u"\uAAAA"*size - r = repr(s) - except MemoryError: - pass # acceptable on 32-bit - else: - self.assertTrue(s == eval(r)) - - @bigmemtest(minsize=_2G, memuse=2) - def test_endswith(self, size): - SUBSTR = ' abc def ghi' - s = '-' * size + SUBSTR - self.assertTrue(s.endswith(SUBSTR)) - self.assertTrue(s.endswith(s)) - s2 = '...' + s - self.assertTrue(s2.endswith(s)) - self.assertFalse(s.endswith('a' + SUBSTR)) - self.assertFalse(SUBSTR.endswith(s)) - - @bigmemtest(minsize=_2G + 10, memuse=2) - def test_expandtabs(self, size): - s = '-' * size - tabsize = 8 - self.assertEqual(s.expandtabs(), s) - del s - slen, remainder = divmod(size, tabsize) - s = ' \t' * slen - s = s.expandtabs(tabsize) - self.assertEqual(len(s), size - remainder) - self.assertEqual(len(s.strip(' ')), 0) - - @bigmemtest(minsize=_2G, memuse=2) - def test_find(self, size): - SUBSTR = ' abc def ghi' - sublen = len(SUBSTR) - s = ''.join([SUBSTR, '-' * size, SUBSTR]) - self.assertEqual(s.find(' '), 0) - self.assertEqual(s.find(SUBSTR), 0) - self.assertEqual(s.find(' ', sublen), sublen + size) - self.assertEqual(s.find(SUBSTR, len(SUBSTR)), sublen + size) - self.assertEqual(s.find('i'), SUBSTR.find('i')) - self.assertEqual(s.find('i', sublen), - sublen + size + SUBSTR.find('i')) - self.assertEqual(s.find('i', size), - sublen + size + SUBSTR.find('i')) - self.assertEqual(s.find('j'), -1) - - @bigmemtest(minsize=_2G, memuse=2) - def test_index(self, size): - SUBSTR = ' abc def ghi' - sublen = len(SUBSTR) - s = ''.join([SUBSTR, '-' * size, SUBSTR]) - self.assertEqual(s.index(' '), 0) - self.assertEqual(s.index(SUBSTR), 0) - self.assertEqual(s.index(' ', sublen), sublen + size) - self.assertEqual(s.index(SUBSTR, sublen), sublen + size) - self.assertEqual(s.index('i'), SUBSTR.index('i')) - self.assertEqual(s.index('i', sublen), - sublen + size + SUBSTR.index('i')) - self.assertEqual(s.index('i', size), - sublen + size + SUBSTR.index('i')) - self.assertRaises(ValueError, s.index, 'j') - - @bigmemtest(minsize=_2G, memuse=2) - def test_isalnum(self, size): - SUBSTR = '123456' - s = 'a' * size + SUBSTR - self.assertTrue(s.isalnum()) - s += '.' - self.assertFalse(s.isalnum()) - - @bigmemtest(minsize=_2G, memuse=2) - def test_isalpha(self, size): - SUBSTR = 'zzzzzzz' - s = 'a' * size + SUBSTR - self.assertTrue(s.isalpha()) - s += '.' - self.assertFalse(s.isalpha()) - - @bigmemtest(minsize=_2G, memuse=2) - def test_isdigit(self, size): - SUBSTR = '123456' - s = '9' * size + SUBSTR - self.assertTrue(s.isdigit()) - s += 'z' - self.assertFalse(s.isdigit()) - - @bigmemtest(minsize=_2G, memuse=2) - def test_islower(self, size): - chars = ''.join([ chr(c) for c in range(255) if not chr(c).isupper() ]) - repeats = size // len(chars) + 2 - s = chars * repeats - self.assertTrue(s.islower()) - s += 'A' - self.assertFalse(s.islower()) - - @bigmemtest(minsize=_2G, memuse=2) - def test_isspace(self, size): - whitespace = ' \f\n\r\t\v' - repeats = size // len(whitespace) + 2 - s = whitespace * repeats - self.assertTrue(s.isspace()) - s += 'j' - self.assertFalse(s.isspace()) - - @bigmemtest(minsize=_2G, memuse=2) - def test_istitle(self, size): - SUBSTR = '123456' - s = ''.join(['A', 'a' * size, SUBSTR]) - self.assertTrue(s.istitle()) - s += 'A' - self.assertTrue(s.istitle()) - s += 'aA' - self.assertFalse(s.istitle()) - - @bigmemtest(minsize=_2G, memuse=2) - def test_isupper(self, size): - chars = ''.join([ chr(c) for c in range(255) if not chr(c).islower() ]) - repeats = size // len(chars) + 2 - s = chars * repeats - self.assertTrue(s.isupper()) - s += 'a' - self.assertFalse(s.isupper()) - - @bigmemtest(minsize=_2G, memuse=2) - def test_join(self, size): - s = 'A' * size - x = s.join(['aaaaa', 'bbbbb']) - self.assertEqual(x.count('a'), 5) - self.assertEqual(x.count('b'), 5) - self.assertTrue(x.startswith('aaaaaA')) - self.assertTrue(x.endswith('Abbbbb')) - - @bigmemtest(minsize=_2G + 10, memuse=1) - def test_ljust(self, size): - SUBSTR = ' abc def ghi' - s = SUBSTR.ljust(size) - self.assertTrue(s.startswith(SUBSTR + ' ')) - self.assertEqual(len(s), size) - self.assertEqual(s.strip(), SUBSTR.strip()) - - @bigmemtest(minsize=_2G + 10, memuse=2) - def test_lower(self, size): - s = 'A' * size - s = s.lower() - self.assertEqual(len(s), size) - self.assertEqual(s.count('a'), size) - - @bigmemtest(minsize=_2G + 10, memuse=1) - def test_lstrip(self, size): - SUBSTR = 'abc def ghi' - s = SUBSTR.rjust(size) - self.assertEqual(len(s), size) - self.assertEqual(s.lstrip(), SUBSTR.lstrip()) - del s - s = SUBSTR.ljust(size) - self.assertEqual(len(s), size) - stripped = s.lstrip() - self.assertTrue(stripped is s) - - @bigmemtest(minsize=_2G + 10, memuse=2) - def test_replace(self, size): - replacement = 'a' - s = ' ' * size - s = s.replace(' ', replacement) - self.assertEqual(len(s), size) - self.assertEqual(s.count(replacement), size) - s = s.replace(replacement, ' ', size - 4) - self.assertEqual(len(s), size) - self.assertEqual(s.count(replacement), 4) - self.assertEqual(s[-10:], ' aaaa') - - @bigmemtest(minsize=_2G, memuse=2) - def test_rfind(self, size): - SUBSTR = ' abc def ghi' - sublen = len(SUBSTR) - s = ''.join([SUBSTR, '-' * size, SUBSTR]) - self.assertEqual(s.rfind(' '), sublen + size + SUBSTR.rfind(' ')) - self.assertEqual(s.rfind(SUBSTR), sublen + size) - self.assertEqual(s.rfind(' ', 0, size), SUBSTR.rfind(' ')) - self.assertEqual(s.rfind(SUBSTR, 0, sublen + size), 0) - self.assertEqual(s.rfind('i'), sublen + size + SUBSTR.rfind('i')) - self.assertEqual(s.rfind('i', 0, sublen), SUBSTR.rfind('i')) - self.assertEqual(s.rfind('i', 0, sublen + size), - SUBSTR.rfind('i')) - self.assertEqual(s.rfind('j'), -1) - - @bigmemtest(minsize=_2G, memuse=2) - def test_rindex(self, size): - SUBSTR = ' abc def ghi' - sublen = len(SUBSTR) - s = ''.join([SUBSTR, '-' * size, SUBSTR]) - self.assertEqual(s.rindex(' '), - sublen + size + SUBSTR.rindex(' ')) - self.assertEqual(s.rindex(SUBSTR), sublen + size) - self.assertEqual(s.rindex(' ', 0, sublen + size - 1), - SUBSTR.rindex(' ')) - self.assertEqual(s.rindex(SUBSTR, 0, sublen + size), 0) - self.assertEqual(s.rindex('i'), - sublen + size + SUBSTR.rindex('i')) - self.assertEqual(s.rindex('i', 0, sublen), SUBSTR.rindex('i')) - self.assertEqual(s.rindex('i', 0, sublen + size), - SUBSTR.rindex('i')) - self.assertRaises(ValueError, s.rindex, 'j') - - @bigmemtest(minsize=_2G + 10, memuse=1) - def test_rjust(self, size): - SUBSTR = ' abc def ghi' - s = SUBSTR.ljust(size) - self.assertTrue(s.startswith(SUBSTR + ' ')) - self.assertEqual(len(s), size) - self.assertEqual(s.strip(), SUBSTR.strip()) - - @bigmemtest(minsize=_2G + 10, memuse=1) - def test_rstrip(self, size): - SUBSTR = ' abc def ghi' - s = SUBSTR.ljust(size) - self.assertEqual(len(s), size) - self.assertEqual(s.rstrip(), SUBSTR.rstrip()) - del s - s = SUBSTR.rjust(size) - self.assertEqual(len(s), size) - stripped = s.rstrip() - self.assertTrue(stripped is s) - - # The test takes about size bytes to build a string, and then about - # sqrt(size) substrings of sqrt(size) in size and a list to - # hold sqrt(size) items. It's close but just over 2x size. - @bigmemtest(minsize=_2G, memuse=2.1) - def test_split_small(self, size): - # Crudely calculate an estimate so that the result of s.split won't - # take up an inordinate amount of memory - chunksize = int(size ** 0.5 + 2) - SUBSTR = 'a' + ' ' * chunksize - s = SUBSTR * chunksize - l = s.split() - self.assertEqual(len(l), chunksize) - self.assertEqual(set(l), set(['a'])) - del l - l = s.split('a') - self.assertEqual(len(l), chunksize + 1) - self.assertEqual(set(l), set(['', ' ' * chunksize])) - - # Allocates a string of twice size (and briefly two) and a list of - # size. Because of internal affairs, the s.split() call produces a - # list of size times the same one-character string, so we only - # suffer for the list size. (Otherwise, it'd cost another 48 times - # size in bytes!) Nevertheless, a list of size takes - # 8*size bytes. - @bigmemtest(minsize=_2G + 5, memuse=10) - def test_split_large(self, size): - s = ' a' * size + ' ' - l = s.split() - self.assertEqual(len(l), size) - self.assertEqual(set(l), set(['a'])) - del l - l = s.split('a') - self.assertEqual(len(l), size + 1) - self.assertEqual(set(l), set([' '])) - - @bigmemtest(minsize=_2G, memuse=2.1) - def test_splitlines(self, size): - # Crudely calculate an estimate so that the result of s.split won't - # take up an inordinate amount of memory - chunksize = int(size ** 0.5 + 2) // 2 - SUBSTR = ' ' * chunksize + '\n' + ' ' * chunksize + '\r\n' - s = SUBSTR * chunksize - l = s.splitlines() - self.assertEqual(len(l), chunksize * 2) - self.assertEqual(set(l), set([' ' * chunksize])) - - @bigmemtest(minsize=_2G, memuse=2) - def test_startswith(self, size): - SUBSTR = ' abc def ghi' - s = '-' * size + SUBSTR - self.assertTrue(s.startswith(s)) - self.assertTrue(s.startswith('-' * size)) - self.assertFalse(s.startswith(SUBSTR)) - - @bigmemtest(minsize=_2G, memuse=1) - def test_strip(self, size): - SUBSTR = ' abc def ghi ' - s = SUBSTR.rjust(size) - self.assertEqual(len(s), size) - self.assertEqual(s.strip(), SUBSTR.strip()) - del s - s = SUBSTR.ljust(size) - self.assertEqual(len(s), size) - self.assertEqual(s.strip(), SUBSTR.strip()) - - @bigmemtest(minsize=_2G, memuse=2) - def test_swapcase(self, size): - SUBSTR = "aBcDeFG12.'\xa9\x00" - sublen = len(SUBSTR) - repeats = size // sublen + 2 - s = SUBSTR * repeats - s = s.swapcase() - self.assertEqual(len(s), sublen * repeats) - self.assertEqual(s[:sublen * 3], SUBSTR.swapcase() * 3) - self.assertEqual(s[-sublen * 3:], SUBSTR.swapcase() * 3) - - @bigmemtest(minsize=_2G, memuse=2) - def test_title(self, size): - SUBSTR = 'SpaaHAaaAaham' - s = SUBSTR * (size // len(SUBSTR) + 2) - s = s.title() - self.assertTrue(s.startswith((SUBSTR * 3).title())) - self.assertTrue(s.endswith(SUBSTR.lower() * 3)) - - @bigmemtest(minsize=_2G, memuse=2) - def test_translate(self, size): - trans = string.maketrans('.aZ', '-!$') - SUBSTR = 'aZz.z.Aaz.' - sublen = len(SUBSTR) - repeats = size // sublen + 2 - s = SUBSTR * repeats - s = s.translate(trans) - self.assertEqual(len(s), repeats * sublen) - self.assertEqual(s[:sublen], SUBSTR.translate(trans)) - self.assertEqual(s[-sublen:], SUBSTR.translate(trans)) - self.assertEqual(s.count('.'), 0) - self.assertEqual(s.count('!'), repeats * 2) - self.assertEqual(s.count('z'), repeats * 3) - - @bigmemtest(minsize=_2G + 5, memuse=2) - def test_upper(self, size): - s = 'a' * size - s = s.upper() - self.assertEqual(len(s), size) - self.assertEqual(s.count('A'), size) - - @bigmemtest(minsize=_2G + 20, memuse=1) - def test_zfill(self, size): - SUBSTR = '-568324723598234' - s = SUBSTR.zfill(size) - self.assertTrue(s.endswith('0' + SUBSTR[1:])) - self.assertTrue(s.startswith('-0')) - self.assertEqual(len(s), size) - self.assertEqual(s.count('0'), size - len(SUBSTR)) - - @bigmemtest(minsize=_2G + 10, memuse=2) - def test_format(self, size): - s = '-' * size - sf = '%s' % (s,) - self.assertTrue(s == sf) - del sf - sf = '..%s..' % (s,) - self.assertEqual(len(sf), len(s) + 4) - self.assertTrue(sf.startswith('..-')) - self.assertTrue(sf.endswith('-..')) - del s, sf - - size //= 2 - edge = '-' * size - s = ''.join([edge, '%s', edge]) - del edge - s = s % '...' - self.assertEqual(len(s), size * 2 + 3) - self.assertEqual(s.count('.'), 3) - self.assertEqual(s.count('-'), size * 2) - - @bigmemtest(minsize=_2G + 10, memuse=5) - def test_repr_small(self, size): - s = '-' * size - s = repr(s) - self.assertEqual(len(s), size + 2) - self.assertEqual(s[0], "'") - self.assertEqual(s[-1], "'") - self.assertEqual(s.count('-'), size) - del s - # repr() will create a string four times as large as this 'binary - # string', but we don't want to allocate much more than twice - # size in total. (We do extra testing in test_repr_large()) - s = '\x00' * size - s = repr(s) - self.assertEqual(len(s), size * 4 + 2) - self.assertEqual(s[0], "'") - self.assertEqual(s[-1], "'") - self.assertEqual(s.count('\\'), size) - self.assertEqual(s.count('0'), size * 2) - - @bigmemtest(minsize=_2G + 10, memuse=5) - def test_repr_large(self, size): - s = '\x00' * size - s = repr(s) - self.assertEqual(len(s), size * 4 + 2) - self.assertEqual(s[0], "'") - self.assertEqual(s[-1], "'") - self.assertEqual(s.count('\\'), size) - self.assertEqual(s.count('0'), size * 2) - - @bigmemtest(minsize=2**32 // 5, memuse=6+2) - def test_unicode_repr(self, size): - s = u"\uAAAA" * size - self.assertTrue(len(repr(s)) > size) - - # This test is meaningful even with size < 2G, as long as the - # doubled string is > 2G (but it tests more if both are > 2G :) - @bigmemtest(minsize=_1G + 2, memuse=3) - def test_concat(self, size): - s = '.' * size - self.assertEqual(len(s), size) - s = s + s - self.assertEqual(len(s), size * 2) - self.assertEqual(s.count('.'), size * 2) - - # This test is meaningful even with size < 2G, as long as the - # repeated string is > 2G (but it tests more if both are > 2G :) - @bigmemtest(minsize=_1G + 2, memuse=3) - def test_repeat(self, size): - s = '.' * size - self.assertEqual(len(s), size) - s = s * 2 - self.assertEqual(len(s), size * 2) - self.assertEqual(s.count('.'), size * 2) - - @bigmemtest(minsize=_2G + 20, memuse=2) - def test_slice_and_getitem(self, size): - SUBSTR = '0123456789' - sublen = len(SUBSTR) - s = SUBSTR * (size // sublen) - stepsize = len(s) // 100 - stepsize = stepsize - (stepsize % sublen) - for i in range(0, len(s) - stepsize, stepsize): - self.assertEqual(s[i], SUBSTR[0]) - self.assertEqual(s[i:i + sublen], SUBSTR) - self.assertEqual(s[i:i + sublen:2], SUBSTR[::2]) - if i > 0: - self.assertEqual(s[i + sublen - 1:i - 1:-3], - SUBSTR[sublen::-3]) - # Make sure we do some slicing and indexing near the end of the - # string, too. - self.assertEqual(s[len(s) - 1], SUBSTR[-1]) - self.assertEqual(s[-1], SUBSTR[-1]) - self.assertEqual(s[len(s) - 10], SUBSTR[0]) - self.assertEqual(s[-sublen], SUBSTR[0]) - self.assertEqual(s[len(s):], '') - self.assertEqual(s[len(s) - 1:], SUBSTR[-1]) - self.assertEqual(s[-1:], SUBSTR[-1]) - self.assertEqual(s[len(s) - sublen:], SUBSTR) - self.assertEqual(s[-sublen:], SUBSTR) - self.assertEqual(len(s[:]), len(s)) - self.assertEqual(len(s[:len(s) - 5]), len(s) - 5) - self.assertEqual(len(s[5:-5]), len(s) - 10) - - self.assertRaises(IndexError, operator.getitem, s, len(s)) - self.assertRaises(IndexError, operator.getitem, s, len(s) + 1) - self.assertRaises(IndexError, operator.getitem, s, len(s) + 1<<31) - - @bigmemtest(minsize=_2G, memuse=2) - def test_contains(self, size): - SUBSTR = '0123456789' - edge = '-' * (size // 2) - s = ''.join([edge, SUBSTR, edge]) - del edge - self.assertIn(SUBSTR, s) - self.assertNotIn(SUBSTR * 2, s) - self.assertIn('-', s) - self.assertNotIn('a', s) - s += 'a' - self.assertIn('a', s) - - @bigmemtest(minsize=_2G + 10, memuse=2) - def test_compare(self, size): - s1 = '-' * size - s2 = '-' * size - self.assertTrue(s1 == s2) - del s2 - s2 = s1 + 'a' - self.assertFalse(s1 == s2) - del s2 - s2 = '.' * size - self.assertFalse(s1 == s2) - - @bigmemtest(minsize=_2G + 10, memuse=1) - def test_hash(self, size): - # Not sure if we can do any meaningful tests here... Even if we - # start relying on the exact algorithm used, the result will be - # different depending on the size of the C 'long int'. Even this - # test is dodgy (there's no *guarantee* that the two things should - # have a different hash, even if they, in the current - # implementation, almost always do.) - s = '\x00' * size - h1 = hash(s) - del s - s = '\x00' * (size + 1) - self.assertFalse(h1 == hash(s)) - -class TupleTest(unittest.TestCase): - - # Tuples have a small, fixed-sized head and an array of pointers to - # data. Since we're testing 64-bit addressing, we can assume that the - # pointers are 8 bytes, and that thus that the tuples take up 8 bytes - # per size. - - # As a side-effect of testing long tuples, these tests happen to test - # having more than 2<<31 references to any given object. Hence the - # use of different types of objects as contents in different tests. - - @bigmemtest(minsize=_2G + 2, memuse=16) - def test_compare(self, size): - t1 = (u'',) * size - t2 = (u'',) * size - self.assertTrue(t1 == t2) - del t2 - t2 = (u'',) * (size + 1) - self.assertFalse(t1 == t2) - del t2 - t2 = (1,) * size - self.assertFalse(t1 == t2) - - # Test concatenating into a single tuple of more than 2G in length, - # and concatenating a tuple of more than 2G in length separately, so - # the smaller test still gets run even if there isn't memory for the - # larger test (but we still let the tester know the larger test is - # skipped, in verbose mode.) - def basic_concat_test(self, size): - t = ((),) * size - self.assertEqual(len(t), size) - t = t + t - self.assertEqual(len(t), size * 2) - - @bigmemtest(minsize=_2G // 2 + 2, memuse=24) - def test_concat_small(self, size): - return self.basic_concat_test(size) - - @bigmemtest(minsize=_2G + 2, memuse=24) - def test_concat_large(self, size): - return self.basic_concat_test(size) - - @bigmemtest(minsize=_2G // 5 + 10, memuse=8 * 5) - def test_contains(self, size): - t = (1, 2, 3, 4, 5) * size - self.assertEqual(len(t), size * 5) - self.assertIn(5, t) - self.assertNotIn((1, 2, 3, 4, 5), t) - self.assertNotIn(0, t) - - @bigmemtest(minsize=_2G + 10, memuse=8) - def test_hash(self, size): - t1 = (0,) * size - h1 = hash(t1) - del t1 - t2 = (0,) * (size + 1) - self.assertFalse(h1 == hash(t2)) - - @bigmemtest(minsize=_2G + 10, memuse=8) - def test_index_and_slice(self, size): - t = (None,) * size - self.assertEqual(len(t), size) - self.assertEqual(t[-1], None) - self.assertEqual(t[5], None) - self.assertEqual(t[size - 1], None) - self.assertRaises(IndexError, operator.getitem, t, size) - self.assertEqual(t[:5], (None,) * 5) - self.assertEqual(t[-5:], (None,) * 5) - self.assertEqual(t[20:25], (None,) * 5) - self.assertEqual(t[-25:-20], (None,) * 5) - self.assertEqual(t[size - 5:], (None,) * 5) - self.assertEqual(t[size - 5:size], (None,) * 5) - self.assertEqual(t[size - 6:size - 2], (None,) * 4) - self.assertEqual(t[size:size], ()) - self.assertEqual(t[size:size+5], ()) - - # Like test_concat, split in two. - def basic_test_repeat(self, size): - t = ('',) * size - self.assertEqual(len(t), size) - t = t * 2 - self.assertEqual(len(t), size * 2) - - @bigmemtest(minsize=_2G // 2 + 2, memuse=24) - def test_repeat_small(self, size): - return self.basic_test_repeat(size) - - @bigmemtest(minsize=_2G + 2, memuse=24) - def test_repeat_large(self, size): - return self.basic_test_repeat(size) - - @bigmemtest(minsize=_1G - 1, memuse=12) - def test_repeat_large_2(self, size): - return self.basic_test_repeat(size) - - @precisionbigmemtest(size=_1G - 1, memuse=9) - def test_from_2G_generator(self, size): - try: - t = tuple(xrange(size)) - except MemoryError: - pass # acceptable on 32-bit - else: - count = 0 - for item in t: - self.assertEqual(item, count) - count += 1 - self.assertEqual(count, size) - - @precisionbigmemtest(size=_1G - 25, memuse=9) - def test_from_almost_2G_generator(self, size): - try: - t = tuple(xrange(size)) - count = 0 - for item in t: - self.assertEqual(item, count) - count += 1 - self.assertEqual(count, size) - except MemoryError: - pass # acceptable, expected on 32-bit - - # Like test_concat, split in two. - def basic_test_repr(self, size): - t = (0,) * size - s = repr(t) - # The repr of a tuple of 0's is exactly three times the tuple length. - self.assertEqual(len(s), size * 3) - self.assertEqual(s[:5], '(0, 0') - self.assertEqual(s[-5:], '0, 0)') - self.assertEqual(s.count('0'), size) - - @bigmemtest(minsize=_2G // 3 + 2, memuse=8 + 3) - def test_repr_small(self, size): - return self.basic_test_repr(size) - - @bigmemtest(minsize=_2G + 2, memuse=8 + 3) - def test_repr_large(self, size): - return self.basic_test_repr(size) - -class ListTest(unittest.TestCase): - - # Like tuples, lists have a small, fixed-sized head and an array of - # pointers to data, so 8 bytes per size. Also like tuples, we make the - # lists hold references to various objects to test their refcount - # limits. - - @bigmemtest(minsize=_2G + 2, memuse=16) - def test_compare(self, size): - l1 = [u''] * size - l2 = [u''] * size - self.assertTrue(l1 == l2) - del l2 - l2 = [u''] * (size + 1) - self.assertFalse(l1 == l2) - del l2 - l2 = [2] * size - self.assertFalse(l1 == l2) - - # Test concatenating into a single list of more than 2G in length, - # and concatenating a list of more than 2G in length separately, so - # the smaller test still gets run even if there isn't memory for the - # larger test (but we still let the tester know the larger test is - # skipped, in verbose mode.) - def basic_test_concat(self, size): - l = [[]] * size - self.assertEqual(len(l), size) - l = l + l - self.assertEqual(len(l), size * 2) - - @bigmemtest(minsize=_2G // 2 + 2, memuse=24) - def test_concat_small(self, size): - return self.basic_test_concat(size) - - @bigmemtest(minsize=_2G + 2, memuse=24) - def test_concat_large(self, size): - return self.basic_test_concat(size) - - def basic_test_inplace_concat(self, size): - l = [sys.stdout] * size - l += l - self.assertEqual(len(l), size * 2) - self.assertTrue(l[0] is l[-1]) - self.assertTrue(l[size - 1] is l[size + 1]) - - @bigmemtest(minsize=_2G // 2 + 2, memuse=24) - def test_inplace_concat_small(self, size): - return self.basic_test_inplace_concat(size) - - @bigmemtest(minsize=_2G + 2, memuse=24) - def test_inplace_concat_large(self, size): - return self.basic_test_inplace_concat(size) - - @bigmemtest(minsize=_2G // 5 + 10, memuse=8 * 5) - def test_contains(self, size): - l = [1, 2, 3, 4, 5] * size - self.assertEqual(len(l), size * 5) - self.assertIn(5, l) - self.assertNotIn([1, 2, 3, 4, 5], l) - self.assertNotIn(0, l) - - @bigmemtest(minsize=_2G + 10, memuse=8) - def test_hash(self, size): - l = [0] * size - self.assertRaises(TypeError, hash, l) - - @bigmemtest(minsize=_2G + 10, memuse=8) - def test_index_and_slice(self, size): - l = [None] * size - self.assertEqual(len(l), size) - self.assertEqual(l[-1], None) - self.assertEqual(l[5], None) - self.assertEqual(l[size - 1], None) - self.assertRaises(IndexError, operator.getitem, l, size) - self.assertEqual(l[:5], [None] * 5) - self.assertEqual(l[-5:], [None] * 5) - self.assertEqual(l[20:25], [None] * 5) - self.assertEqual(l[-25:-20], [None] * 5) - self.assertEqual(l[size - 5:], [None] * 5) - self.assertEqual(l[size - 5:size], [None] * 5) - self.assertEqual(l[size - 6:size - 2], [None] * 4) - self.assertEqual(l[size:size], []) - self.assertEqual(l[size:size+5], []) - - l[size - 2] = 5 - self.assertEqual(len(l), size) - self.assertEqual(l[-3:], [None, 5, None]) - self.assertEqual(l.count(5), 1) - self.assertRaises(IndexError, operator.setitem, l, size, 6) - self.assertEqual(len(l), size) - - l[size - 7:] = [1, 2, 3, 4, 5] - size -= 2 - self.assertEqual(len(l), size) - self.assertEqual(l[-7:], [None, None, 1, 2, 3, 4, 5]) - - l[:7] = [1, 2, 3, 4, 5] - size -= 2 - self.assertEqual(len(l), size) - self.assertEqual(l[:7], [1, 2, 3, 4, 5, None, None]) - - del l[size - 1] - size -= 1 - self.assertEqual(len(l), size) - self.assertEqual(l[-1], 4) - - del l[-2:] - size -= 2 - self.assertEqual(len(l), size) - self.assertEqual(l[-1], 2) - - del l[0] - size -= 1 - self.assertEqual(len(l), size) - self.assertEqual(l[0], 2) - - del l[:2] - size -= 2 - self.assertEqual(len(l), size) - self.assertEqual(l[0], 4) - - # Like test_concat, split in two. - def basic_test_repeat(self, size): - l = [] * size - self.assertFalse(l) - l = [''] * size - self.assertEqual(len(l), size) - l = l * 2 - self.assertEqual(len(l), size * 2) - - @bigmemtest(minsize=_2G // 2 + 2, memuse=24) - def test_repeat_small(self, size): - return self.basic_test_repeat(size) - - @bigmemtest(minsize=_2G + 2, memuse=24) - def test_repeat_large(self, size): - return self.basic_test_repeat(size) - - def basic_test_inplace_repeat(self, size): - l = [''] - l *= size - self.assertEqual(len(l), size) - self.assertTrue(l[0] is l[-1]) - del l - - l = [''] * size - l *= 2 - self.assertEqual(len(l), size * 2) - self.assertTrue(l[size - 1] is l[-1]) - - @bigmemtest(minsize=_2G // 2 + 2, memuse=16) - def test_inplace_repeat_small(self, size): - return self.basic_test_inplace_repeat(size) - - @bigmemtest(minsize=_2G + 2, memuse=16) - def test_inplace_repeat_large(self, size): - return self.basic_test_inplace_repeat(size) - - def basic_test_repr(self, size): - l = [0] * size - s = repr(l) - # The repr of a list of 0's is exactly three times the list length. - self.assertEqual(len(s), size * 3) - self.assertEqual(s[:5], '[0, 0') - self.assertEqual(s[-5:], '0, 0]') - self.assertEqual(s.count('0'), size) - - @bigmemtest(minsize=_2G // 3 + 2, memuse=8 + 3) - def test_repr_small(self, size): - return self.basic_test_repr(size) - - @bigmemtest(minsize=_2G + 2, memuse=8 + 3) - def test_repr_large(self, size): - return self.basic_test_repr(size) - - # list overallocates ~1/8th of the total size (on first expansion) so - # the single list.append call puts memuse at 9 bytes per size. - @bigmemtest(minsize=_2G, memuse=9) - def test_append(self, size): - l = [object()] * size - l.append(object()) - self.assertEqual(len(l), size+1) - self.assertTrue(l[-3] is l[-2]) - self.assertFalse(l[-2] is l[-1]) - - @bigmemtest(minsize=_2G // 5 + 2, memuse=8 * 5) - def test_count(self, size): - l = [1, 2, 3, 4, 5] * size - self.assertEqual(l.count(1), size) - self.assertEqual(l.count("1"), 0) - - def basic_test_extend(self, size): - l = [file] * size - l.extend(l) - self.assertEqual(len(l), size * 2) - self.assertTrue(l[0] is l[-1]) - self.assertTrue(l[size - 1] is l[size + 1]) - - @bigmemtest(minsize=_2G // 2 + 2, memuse=16) - def test_extend_small(self, size): - return self.basic_test_extend(size) - - @bigmemtest(minsize=_2G + 2, memuse=16) - def test_extend_large(self, size): - return self.basic_test_extend(size) - - @bigmemtest(minsize=_2G // 5 + 2, memuse=8 * 5) - def test_index(self, size): - l = [1L, 2L, 3L, 4L, 5L] * size - size *= 5 - self.assertEqual(l.index(1), 0) - self.assertEqual(l.index(5, size - 5), size - 1) - self.assertEqual(l.index(5, size - 5, size), size - 1) - self.assertRaises(ValueError, l.index, 1, size - 4, size) - self.assertRaises(ValueError, l.index, 6L) - - # This tests suffers from overallocation, just like test_append. - @bigmemtest(minsize=_2G + 10, memuse=9) - def test_insert(self, size): - l = [1.0] * size - l.insert(size - 1, "A") - size += 1 - self.assertEqual(len(l), size) - self.assertEqual(l[-3:], [1.0, "A", 1.0]) - - l.insert(size + 1, "B") - size += 1 - self.assertEqual(len(l), size) - self.assertEqual(l[-3:], ["A", 1.0, "B"]) - - l.insert(1, "C") - size += 1 - self.assertEqual(len(l), size) - self.assertEqual(l[:3], [1.0, "C", 1.0]) - self.assertEqual(l[size - 3:], ["A", 1.0, "B"]) - - @bigmemtest(minsize=_2G // 5 + 4, memuse=8 * 5) - def test_pop(self, size): - l = [u"a", u"b", u"c", u"d", u"e"] * size - size *= 5 - self.assertEqual(len(l), size) - - item = l.pop() - size -= 1 - self.assertEqual(len(l), size) - self.assertEqual(item, u"e") - self.assertEqual(l[-2:], [u"c", u"d"]) - - item = l.pop(0) - size -= 1 - self.assertEqual(len(l), size) - self.assertEqual(item, u"a") - self.assertEqual(l[:2], [u"b", u"c"]) - - item = l.pop(size - 2) - size -= 1 - self.assertEqual(len(l), size) - self.assertEqual(item, u"c") - self.assertEqual(l[-2:], [u"b", u"d"]) - - @bigmemtest(minsize=_2G + 10, memuse=8) - def test_remove(self, size): - l = [10] * size - self.assertEqual(len(l), size) - - l.remove(10) - size -= 1 - self.assertEqual(len(l), size) - - # Because of the earlier l.remove(), this append doesn't trigger - # a resize. - l.append(5) - size += 1 - self.assertEqual(len(l), size) - self.assertEqual(l[-2:], [10, 5]) - l.remove(5) - size -= 1 - self.assertEqual(len(l), size) - self.assertEqual(l[-2:], [10, 10]) - - @bigmemtest(minsize=_2G // 5 + 2, memuse=8 * 5) - def test_reverse(self, size): - l = [1, 2, 3, 4, 5] * size - l.reverse() - self.assertEqual(len(l), size * 5) - self.assertEqual(l[-5:], [5, 4, 3, 2, 1]) - self.assertEqual(l[:5], [5, 4, 3, 2, 1]) - - @bigmemtest(minsize=_2G // 5 + 2, memuse=8 * 5) - def test_sort(self, size): - l = [1, 2, 3, 4, 5] * size - l.sort() - self.assertEqual(len(l), size * 5) - self.assertEqual(l.count(1), size) - self.assertEqual(l[:10], [1] * 10) - self.assertEqual(l[-10:], [5] * 10) - -class BufferTest(unittest.TestCase): - - @precisionbigmemtest(size=_1G, memuse=4) - def test_repeat(self, size): - try: - with test_support.check_py3k_warnings(): - b = buffer("AAAA")*size - except MemoryError: - pass # acceptable on 32-bit - else: - count = 0 - for c in b: - self.assertEqual(c, 'A') - count += 1 - self.assertEqual(count, size*4) - -def test_main(): - test_support.run_unittest(StrTest, TupleTest, ListTest, BufferTest) - -if __name__ == '__main__': - if len(sys.argv) > 1: - test_support.set_memlimit(sys.argv[1]) - test_main() |