72_collections.py 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516
  1. from collections import Counter, deque, defaultdict
  2. import random
  3. import pickle
  4. import gc
  5. # test defaultdict
  6. assert issubclass(defaultdict, dict)
  7. a = defaultdict(int)
  8. a['1'] += 1
  9. assert a == {'1': 1}
  10. a = defaultdict(list)
  11. a['1'].append(1)
  12. assert a == {'1': [1]}
  13. q = deque()
  14. q.append(1)
  15. q.append(2)
  16. q.appendleft(3)
  17. q.append(4)
  18. assert len(q) == 4
  19. assert q == deque([3, 1, 2, 4])
  20. assert q.popleft() == 3
  21. assert q.pop() == 4
  22. assert len(q) == 2
  23. assert q == deque([1, 2])
  24. # ADDING TESTS FROM CPYTHON's test_deque.py file
  25. ############ TEST basics###############
  26. def assertEqual(a, b):
  27. if a == b:
  28. return
  29. print(a)
  30. print(b)
  31. raise AssertionError
  32. def assertNotEqual(a, b):
  33. if a != b:
  34. return
  35. print(a)
  36. print(b)
  37. raise AssertionError
  38. def printFailed(function_name, *args, **kwargs):
  39. print("X Failed Tests for {} for args: {} {}".format(str(function_name), str(args), str(kwargs)))
  40. BIG = 10000
  41. def fail():
  42. raise SyntaxError
  43. yield 1
  44. d = deque()
  45. assertEqual(len(d), 0)
  46. assertEqual(list(d), [])
  47. d = deque(range(6))
  48. assertEqual(list(d), list(range(6)))
  49. d = deque(range(7)) # [0, 1, 2, 3, 4, 5, 6]
  50. # print(d._data, d._head, d._tail, d._capacity)
  51. assertEqual(list(d), list(range(7)))
  52. d = deque(range(8))
  53. assertEqual(list(d), list(range(8)))
  54. d = deque(range(9))
  55. assertEqual(list(d), list(range(9)))
  56. d = deque(range(200))
  57. for i in range(200, 400):
  58. d.append(i)
  59. assertEqual(len(d), 400)
  60. assertEqual(list(d), list(range(400)))
  61. for i in reversed(range(-200, 0)):
  62. d.appendleft(i)
  63. assertEqual(len(d), 600)
  64. assertEqual(list(d), list(range(-200, 400)))
  65. left = [d.popleft() for i in range(250)]
  66. assertEqual(left, list(range(-200, 50)))
  67. assertEqual(list(d), list(range(50, 400)))
  68. right = [d.pop() for i in range(250)]
  69. right.reverse()
  70. assertEqual(right, list(range(150, 400)))
  71. assertEqual(list(d), list(range(50, 150)))
  72. ######### TEST count()#################
  73. for s in ('', 'abracadabra', 'simsalabim'*500+'abc'):
  74. s = list(s)
  75. d = deque(s)
  76. for letter in 'abcdefghijklmnopqrstuvwxyz':
  77. assertEqual(s.count(letter), d.count(letter))
  78. try:
  79. d.count()
  80. printFailed("deque.count")
  81. exit(1)
  82. except TypeError:
  83. pass
  84. try:
  85. d.count(1, 2)
  86. printFailed("deque.count", 1, 2)
  87. exit(1)
  88. except TypeError:
  89. pass
  90. class ArithmeticError(Exception): pass
  91. class BadCompare:
  92. def __eq__(self, other):
  93. raise ArithmeticError
  94. def __ne__(self, other):
  95. raise ArithmeticError
  96. d = deque([1, 2, BadCompare(), 3])
  97. try:
  98. d.count(2)
  99. printFailed("deque.count", 2)
  100. exit(1)
  101. except ArithmeticError:
  102. pass
  103. d = deque([1, 2, 3])
  104. try:
  105. d.count(BadCompare())
  106. printFailed("deque.count", "BadCompare()")
  107. exit(1)
  108. except ArithmeticError:
  109. pass
  110. # class MutatingCompare:
  111. # def __eq__(self, other):
  112. # d.pop()
  113. # return True
  114. # m = MutatingCompare()
  115. # d = deque([1, 2, 3, m, 4, 5])
  116. # m.d = d
  117. # try:
  118. # d.count(3)
  119. # printFailed("deque.count", "MutatingCompare()")
  120. # exit(1)
  121. # except RuntimeError:
  122. # pass
  123. #### TEST comparisons == #####
  124. d = deque('xabc')
  125. d.popleft()
  126. for e in [d, deque('abc'), deque('ab'), deque(), list(d)]:
  127. assertEqual(d == e, type(d) == type(e) and list(d) == list(e))
  128. assertEqual(d != e, not (type(d) == type(e) and list(d) == list(e)))
  129. def get_args():
  130. args = map(deque, ('', 'a', 'b', 'ab', 'ba', 'abc', 'xba', 'xabc', 'cba'))
  131. return args
  132. for x in get_args():
  133. for y in get_args():
  134. assertEqual(x == y, list(x) == list(y))
  135. assertEqual(x != y, list(x) != list(y))
  136. # assertEqual(x < y, list(x) < list(y)) # not currently supported
  137. # assertEqual(x <= y, list(x) <= list(y)) # not currently supported
  138. # assertEqual(x > y, list(x) > list(y)) # not currently supported
  139. # assertEqual(x >= y, list(x) >= list(y)) # not currently supported
  140. ############### TEST contains()#################
  141. n = 200
  142. d = deque(range(n))
  143. for i in range(n):
  144. assertEqual(i in d, True)
  145. assertEqual((n+1) not in d, True)
  146. # class MutateCmp:
  147. # def __init__(self, deque, result):
  148. # self.deque = deque
  149. # self.result = result
  150. # def __eq__(self, other):
  151. # self.deque.clear()
  152. # return self.result
  153. # # # Test detection of mutation during iteration
  154. # d = deque(range(n))
  155. # d[n//2] = MutateCmp(d, False)
  156. # try:
  157. # n in d
  158. # printFailed("deque.__contains__", n)
  159. # exit(1)
  160. # except RuntimeError:
  161. # pass
  162. class BadCmp:
  163. def __eq__(self, other):
  164. raise RuntimeError
  165. # # Test detection of comparison exceptions
  166. d = deque(range(n))
  167. d.append(BadCmp())
  168. try:
  169. n in d
  170. printFailed("deque.__contains__", n)
  171. exit(1)
  172. except RuntimeError:
  173. pass
  174. ######## TEST extend()################
  175. d = deque('a')
  176. try:
  177. d.extend(1)
  178. printFailed("deque.extend", 1)
  179. exit(1)
  180. except TypeError:
  181. pass
  182. d.extend('bcd')
  183. assertEqual(list(d), list('abcd'))
  184. d.extend(d.copy())
  185. assertEqual(list(d), list('abcdabcd'))
  186. ###### TEST extend_left() ################
  187. d = deque('a')
  188. try:
  189. d.extendleft(1)
  190. printFailed("deque.extendleft", 1)
  191. exit(1)
  192. except TypeError:
  193. pass
  194. d.extendleft('bcd')
  195. assertEqual(list(d), list(reversed('abcd')))
  196. d.extendleft(d.copy())
  197. assertEqual(list(d), list('abcddcba'))
  198. d = deque()
  199. d.extendleft(range(1000))
  200. assertEqual(list(d), list(reversed(range(1000))))
  201. try:
  202. d.extendleft(fail())
  203. printFailed("deque.extendleft", fail())
  204. exit(1)
  205. except SyntaxError:
  206. pass
  207. ############ test rotate#############
  208. s = tuple('abcde')
  209. n = len(s)
  210. d = deque(s)
  211. d.rotate(1) # verify rot(1)
  212. assertEqual(''.join(d), 'eabcd')
  213. d = deque(s)
  214. d.rotate(-1) # verify rot(-1)
  215. assertEqual(''.join(d), 'bcdea')
  216. d.rotate() # check default to 1
  217. assertEqual(tuple(d), s)
  218. for i in range(n*3):
  219. d = deque(s)
  220. e = deque(d)
  221. # print(i, d, e)
  222. d.rotate(i) # check vs. rot(1) n times
  223. for j in range(i):
  224. e.rotate(1)
  225. assertEqual(tuple(d), tuple(e))
  226. d.rotate(-i) # check that it works in reverse
  227. assertEqual(tuple(d), s)
  228. e.rotate(n-i) # check that it wraps forward
  229. assertEqual(tuple(e), s)
  230. for i in range(n*3):
  231. d = deque(s)
  232. e = deque(d)
  233. d.rotate(-i)
  234. for j in range(i):
  235. e.rotate(-1) # check vs. rot(-1) n times
  236. assertEqual(tuple(d), tuple(e))
  237. d.rotate(i) # check that it works in reverse
  238. assertEqual(tuple(d), s)
  239. e.rotate(i-n) # check that it wraps backaround
  240. assertEqual(tuple(e), s)
  241. d = deque(s)
  242. e = deque(s)
  243. e.rotate(BIG+17) # verify on long series of rotates
  244. dr = d.rotate
  245. for i in range(BIG+17):
  246. dr()
  247. assertEqual(tuple(d), tuple(e))
  248. try:
  249. d.rotate(1, 2)
  250. printFailed("deque.rotate", 1, 2)
  251. exit(1)
  252. except TypeError:
  253. pass
  254. try:
  255. d.rotate(1, 10)
  256. printFailed("deque.rotate", 1, 10)
  257. exit(1)
  258. except TypeError:
  259. pass
  260. d = deque()
  261. d.rotate() # rotate an empty deque
  262. assertEqual(d, deque())
  263. ########## test len#############
  264. d = deque('ab')
  265. assertEqual(len(d), 2)
  266. d.popleft()
  267. assertEqual(len(d), 1)
  268. d.pop()
  269. assertEqual(len(d), 0)
  270. try:
  271. d.pop()
  272. printFailed("deque.pop")
  273. exit(1)
  274. except IndexError:
  275. pass
  276. assertEqual(len(d), 0)
  277. d.append('c')
  278. assertEqual(len(d), 1)
  279. d.appendleft('d')
  280. assertEqual(len(d), 2)
  281. d.clear()
  282. assertEqual(len(d), 0)
  283. ############## test underflow#############
  284. d = deque()
  285. try:
  286. d.pop()
  287. printFailed("deque.pop")
  288. exit(1)
  289. except IndexError:
  290. pass
  291. try:
  292. d.popleft()
  293. printFailed("deque.popleft")
  294. exit(1)
  295. except IndexError:
  296. pass
  297. ############## test clear#############
  298. d = deque(range(100))
  299. assertEqual(len(d), 100)
  300. d.clear()
  301. assertEqual(len(d), 0)
  302. assertEqual(list(d), [])
  303. d.clear() # clear an empty deque
  304. assertEqual(list(d), [])
  305. # Handle comparison errors
  306. d = deque(['a', 'b', BadCmp(), 'c'])
  307. e = deque(d)
  308. for x, y in zip(d, e):
  309. # verify that original order and values are retained.
  310. assertEqual(x is y, True)
  311. ########### test repr#############
  312. d = deque(range(200))
  313. e = eval(repr(d))
  314. assertEqual(list(d), list(e))
  315. d.append(None)
  316. assertEqual(repr(d)[-19:], '7, 198, 199, None])')
  317. ######### test init #############
  318. try:
  319. deque('abc', 2, 3)
  320. printFailed("deque", 'abc', 2, 3)
  321. exit(1)
  322. except TypeError:
  323. pass
  324. try:
  325. deque(1)
  326. printFailed("deque", 1)
  327. exit(1)
  328. except TypeError:
  329. pass
  330. ######### test hash #############
  331. try:
  332. hash(deque('abcd'))
  333. except TypeError:
  334. pass
  335. ###### test long steady state queue pop left ########
  336. for size in (0, 1, 2, 100, 1000):
  337. d = deque(range(size))
  338. append, pop = d.append, d.popleft
  339. for i in range(size, BIG):
  340. append(i)
  341. x = pop()
  342. if x != i - size:
  343. assertEqual(x, i-size)
  344. assertEqual(list(d), list(range(BIG-size, BIG)))
  345. ######## test long steady state queue pop right ########
  346. for size in (0, 1, 2, 100, 1000):
  347. d = deque(reversed(range(size)))
  348. append, pop = d.appendleft, d.pop
  349. for i in range(size, BIG):
  350. append(i)
  351. x = pop()
  352. if x != i - size:
  353. assertEqual(x, i-size)
  354. assertEqual(list(reversed(list(d))),
  355. list(range(BIG-size, BIG)))
  356. ###### test big queue popleft ########
  357. d = deque()
  358. append, pop = d.append, d.popleft
  359. for i in range(BIG):
  360. append(i)
  361. for i in range(BIG):
  362. x = pop()
  363. if x != i:
  364. assertEqual(x, i)
  365. ###### test big queue pop right ########
  366. d = deque()
  367. append, pop = d.appendleft, d.pop
  368. for i in range(BIG):
  369. append(i)
  370. for i in range(BIG):
  371. x = pop()
  372. if x != i:
  373. assertEqual(x, i)
  374. ####### test big stack right########
  375. d = deque()
  376. append, pop = d.append, d.pop
  377. for i in range(BIG):
  378. append(i)
  379. for i in reversed(range(BIG)):
  380. x = pop()
  381. if x != i:
  382. assertEqual(x, i)
  383. assertEqual(len(d), 0)
  384. ##### test big stack left ########
  385. d = deque()
  386. append, pop = d.appendleft, d.popleft
  387. for i in range(BIG):
  388. append(i)
  389. for i in reversed(range(BIG)):
  390. x = pop()
  391. if x != i:
  392. assertEqual(x, i)
  393. assertEqual(len(d), 0)
  394. ##### test roundtrip iter init ########
  395. d = deque(range(200))
  396. e = deque(d)
  397. assertNotEqual(id(d), id(e))
  398. assertEqual(list(d), list(e))
  399. ########## test pickle #############
  400. d = deque(range(200))
  401. for _ in range(5 + 1):
  402. s = pickle.dumps(d)
  403. e = pickle.loads(s)
  404. assertNotEqual(id(e), id(d))
  405. assertEqual(list(e), list(d))
  406. ### test copy ########
  407. mut = [10]
  408. d = deque([mut])
  409. e = d.copy()
  410. assertEqual(list(d), list(e))
  411. mut[0] = 11
  412. assertNotEqual(id(d), id(e))
  413. assertEqual(list(d), list(e))
  414. ### test reversed#$####
  415. for s in ('abcd', range(2000)):
  416. assertEqual(list(reversed(deque(s))), list(reversed(s)))
  417. d = deque()
  418. for i in range(100):
  419. d.append(1)
  420. gc.collect()