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