def testAttr_full_enqeue(self):
queue = Queue()
for i in range(1, Queue.MAX):
queue.enqeue(i)
self.assertFalse(queue.isFull())
queue.enqeue("fin")
self.assertTrue(queue.isFull())
self.assertRaises(ValueError, queue.enqeue, "impossible")
def testAttr_full_dequeue(self):
queue = Queue()
for i in range(0, Queue.MAX):
queue.enqeue(i)
self.assertTrue(queue.isFull())
for i in range(0, Queue.MAX):
queue.dequeue()
self.assertFalse(queue.isFull())
def testEnqeueToMaxDoesNotThrowErrors(self):
queue = Queue()
queue.enqeue(0)
for k in range(1, queue.MAX):
self.assertFalse(queue.isFull())
queue.enqeue(k)
self.assertEqual(queue.size(), k + 1)
self.assertEqual(str(queue.check_first()), str(0))
self.assertEqual(str(queue.check_last()), str(k))
#on s'assure que la pile est considere pleine si on a
#mis la quantite maximale d'elements permis
self.assertTrue(queue.isFull())
def testEmptyQueue(self):
queue = Queue()
self.assertFalse(queue.hasOne())
self.assertTrue(queue.isEmpty())
self.assertFalse(queue.isFull())
self.assertEqual(queue.size(), 0)
def testSeq2Full(self):
#Constructor
queue = Queue()
#Reporter : La queue n'est pas pleine
self.assertFalse(queue.isFull())
#Transformer : Une queue vide doit lancer une erreur si on essaie de retirer le premier élément
self.assertRaises(ValueError, queue.dequeue)
#Reporter : La queue n'est pas pleine
self.assertFalse(queue.isFull())
#Transformer : Ajoutons l'élément 0 à la queue
queue.enqeue(0)
#Reporter : La queue n'est pas pleine
self.assertFalse(queue.isFull())
def testSeq1Full(self):
#Constructor
queue = Queue()
#Reporter : La queue n'est pas pleine
self.assertFalse(queue.isFull())
#Transformer : Ajoutons l'élément 0 à la queue
queue.enqeue(0)
#Reporter : La queue n'est pas pleine
self.assertFalse(queue.isFull())
#Transformer : Retirons l'élément 0 de la queue
self.assertEqual(str(queue.dequeue()), str(0))
#Reporter : La queue n'est pas pleine
self.assertFalse(queue.isFull())
def testCheckFirstAndDequeueReturnsExpectedValues(self):
queue = Queue()
for k in range(0, queue.MAX):
queue.enqeue(k)
tailleAttendue = queue.size()
#tests pour le premier element
self.assertEqual(str(queue.check_first()), str(0))
self.assertEqual(str(queue.check_last()), str(99))
self.assertTrue(queue.isFull())
self.assertEqual(queue.size(), tailleAttendue)
self.assertEqual(str(queue.dequeue()), str(0))
self.assertFalse(queue.isFull())
tailleAttendue = tailleAttendue - 1
self.assertEqual(queue.size(), tailleAttendue)
#tests pour les elements intermediaires
for k in range(1, queue.MAX - 1):
self.assertEqual(str(queue.check_last()), str(99))
self.assertEqual(str(queue.check_first()), str(k))
self.assertEqual(str(queue.dequeue()), str(k))
self.assertFalse(queue.isFull())
tailleAttendue = tailleAttendue - 1
self.assertEqual(queue.size(), tailleAttendue)
#tests pour le dernier element
self.assertEqual(queue.size(), 1)
self.assertTrue(queue.hasOne)
self.assertRaises(ValueError, queue.check_last)
self.assertEqual(str(queue.check_first()), str(99))
self.assertEqual(str(queue.dequeue()), str(99))
self.assertEqual(queue.size(), 0)
self.assertTrue(queue.hasOne)
self.assertRaises(ValueError, queue.check_first)
self.assertRaises(ValueError, queue.check_last)
def test_queue(self):
myQueue = Queue(10)
self.assertIsNone(myQueue.dequeue())
self.assertTrue(myQueue.isEmpty())
self.assertFalse(myQueue.isFull())
self.assertIsNone(myQueue.peek())
myQueue.enqueue(1)
myQueue.enqueue(2)
myQueue.enqueue(3)
self.assertEqual(myQueue.dequeue(), 1)
self.assertEqual(myQueue.dequeue(), 2)
self.assertEqual(myQueue.dequeue(), 3)
print("--------------Queue----------------")
q = Queue(5)
q.add(1)
trrce(q)
q.add(2)
trrce(q)
q.add(3)
trrce(q)
q.add(4)
trrce(q)
q.add(5)
trrce(q)
print("first = ", q.first())
print("last = ", q.last())
print("isFull? ", q.isFull())
q.remove()
trrce(q)
q.remove()
trrce(q)
q.remove()
trrce(q)
q.remove()
trrce(q)
q.remove()
trrce(q)
print("isEmpty? ",s.isEmpty())
print("--------------BinaryTree----------------")
tree = '''
# -*- coding: utf-8 -*-
"""
Created on Sun Dec 13 16:46:28 2020
@author: Anjali Venugopal
@secondary-author: Abhiram Shibu
"""
from Queue import Queue
testpass=True
myQueue = Queue(10)
if(myQueue.dequeue()!=None):
testpass=False
if(myQueue.isEmpty()!=True):
testpass=False
if(myQueue.isFull()!=False):
testpass=False
if(myQueue.peek()!=None):
testpass=False
myQueue.enqueue(1)
myQueue.enqueue(2)
myQueue.enqueue(3)
if(myQueue.dequeue()!=1):
testpass=False
if(myQueue.dequeue()!=2):
testpass=False
if(myQueue.dequeue()!=3):
testpass=False
if(myQueue.dequeue()!=None):
testpass=False
if(testPass==True):
