/Lib/test/test_bigmem.py

http://unladen-swallow.googlecode.com/ · Python · 1072 lines · 860 code · 127 blank · 85 comment · 34 complexity · cb37abb1442415cf6c830e0a049fd766 MD5 · raw file

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