def test_size_data(self):
"""
The _size() of a heap is equal to the number of values in its list.
"""
h = MaxHeap()
h._data.append('fake')
self.assertEqual(1, h._size())
h._data.append('fake')
self.assertEqual(2, h._size())
h._data.pop()
self.assertEqual(1, h._size())
class PriorityQueue:
def __init__(self):
self.heap = MaxHeap()
def enqueue(self, value):
self.heap.insert(value)
def dequeue(self):
return self.heap.delete()
def is_empty(self):
return self.heap._size() == 0
def test_size_initial(self):
"""
The _size() of a new heap is 0.
"""
h = MaxHeap()
self.assertEqual(0, h._size())
