mirrors/cpython
0
0
Fork 0
mirror of https://github.com/python/cpython.git synced 2024-11-25 19:03:49 +08:00
Code Issues Packages Projects Releases Wiki Activity

Exercise some error conditions

Browse Source
This commit is contained in:
Neal Norwitz 2004-07-08 01:56:46 +00:00
parent 739a8f86d6
commit d7be118626
1 changed files with 10 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
Lib/test/test_heapq.py
View File

@ -38,6 +38,10 @@ class TestHeap(unittest.TestCase):
# 2) Check that the invariant holds for a sorted array
self.check_invariant(results)
self.assertRaises(TypeError, heappush, [])
self.assertRaises(TypeError, heappush, None, None)
self.assertRaises(TypeError, heappop, None)
def check_invariant(self, heap):
# Check the heap invariant.
for pos, item in enumerate(heap):
@ -51,6 +55,8 @@ class TestHeap(unittest.TestCase):
heapify(heap)
self.check_invariant(heap)
self.assertRaises(TypeError, heapify, None)
def test_naive_nbest(self):
data = [random.randrange(2000) for i in range(1000)]
heap = []
@ -75,6 +81,10 @@ class TestHeap(unittest.TestCase):
heapreplace(heap, item)
self.assertEqual(list(heapiter(heap)), sorted(data)[-10:])
self.assertRaises(TypeError, heapreplace, None)
self.assertRaises(TypeError, heapreplace, None, None)
self.assertRaises(IndexError, heapreplace, [], None)
def test_heapsort(self):
# Exercise everything with repeated heapsort checks
for trial in xrange(100):