def setUp(self):
self.qq = Queue()
self.assertListEqual([], self.qq) # Ensure queue is initially empty
class QueueTest(unittest.TestCase):
def setUp(self):
self.qq = Queue()
self.assertListEqual([], self.qq) # Ensure queue is initially empty
def test_enqueue(self):
self.qq.enqueue(1) # Add item to queue
self.assertListEqual([1], self.qq)
def test_dequeue(self):
items = list(set(range(5))) # unique set of items
# Add items to queue
for i in items:
self.qq.enqueue(items[i])
self.assertListEqual(self.qq, items) # Ensure items were added
item = random.choice(items)
self.qq.dequeue(item) # Remove random item from queue
self.assertNotIn(item, self.qq) # confirm dequeue
def test_has_next(self):
# Being initially empty, queue should have no next item
self.assertFalse(self.qq.has_next())
# Add item to queue and check that queue now has a next item
self.qq.enqueue(1)
self.assertTrue(self.qq)
self.assertTrue(self.qq.has_next())
def test_peek_next(self):
items = list(set(range(5))) # unique set of items
# Add items to queue
for i in items:
self.qq.enqueue(items[i])
self.assertListEqual(self.qq, items) # Ensure items were added
self.assertEquals(self.qq.peek_next(), items[0])
self.assertListEqual(items, self.qq) # Ensure item was not removed
def test_pop_next(self):
items = list(set(range(5))) # unique set of items
# Add items to queue
for i in items:
self.qq.enqueue(items[i])
next_item = self.qq.pop_next()
self.assertEquals(next_item, items[0])
self.assertNotEquals(self.qq.peek_next(), next_item) # Ensure item was removed
def test_clear(self):
items = list(set(range(5))) # unique set of items
# Add items to queue
for i in items:
self.qq.enqueue(items[i])
self.assertListEqual(self.qq, items) # Ensure items were added
self.qq.clear()
self.assertListEqual([], self.qq)
def tearDown(self):
del self.qq
