def Testremove(self):
heap1 = BinHeap_Ptr()
heap1.insert(9)
heap1.insert(5)
heap1.insert(4)
heap1.insert(3)
heap1.insert(2)
self.assertEqual(heap1.remove(),2)
self.assertEqual(heap1.remove(),3)
self.assertEqual(heap1.remove(),4)
self.assertEqual(heap1.remove(),5)
self.assertEqual(heap1.remove(),9)
def heap_timeptr():
# Request LENGTH
LENGTH = request.args.get('length', type=int)
if LENGTH == None or LENGTH <= 0:
return "Please enter a valid length!", 400
# Request SEED
SEED = request.args.get('seed', 100) # Use a default seed of 100
(insert_time, remove_time) = BinHeap_Ptr().rand(LENGTH, SEED)
return "The length is " + str(LENGTH) + ", and the seed is " + str(SEED) + '\n' \
"The insertion time is " + str(insert_time) + '\n' + "The popping time is " + str(remove_time) + '\n'
def Testremove(self):
heap1 = BinHeap_Ptr()
heap1.insert(9)
heap1.insert(5)
heap1.insert(4)
heap1.insert(3)
heap1.insert(2)
self.assertEqual(heap1.remove(), 2)
self.assertEqual(heap1.remove(), 3)
self.assertEqual(heap1.remove(), 4)
self.assertEqual(heap1.remove(), 5)
self.assertEqual(heap1.remove(), 9)
def Testinsert(self):
heap1 = BinHeap_Ptr()
heap1.insert(9)
self.assertEqual(heap1.peek(), 9)
heap1.insert(5)
self.assertEqual(heap1.peek(), 5)
heap1.insert(4)
self.assertEqual(heap1.peek(), 4)
heap1.insert(6)
self.assertEqual(heap1.peek(), 4)
def Testinsert(self):
heap1 = BinHeap_Ptr()
heap1.insert(9)
self.assertEqual(heap1.peek(),9)
heap1.insert(5)
self.assertEqual(heap1.peek(),5)
heap1.insert(4)
self.assertEqual(heap1.peek(),4)
heap1.insert(6)
self.assertEqual(heap1.peek(),4)
