QUEUES
A queue is a FIFO (“First In, First Out”) data structure. The oldest item in a queue is removed when a new item is added to a queue that is already full.
Earlier in the chapter you learned how to use a list to emulate a queue. However, there is also a queue object in Python. The following code snippets illustrate how to use a queue.
>>> from collections import deque
>>> q = deque('',maxlen=10)
>>> for i in range(10,20):
... q.append(i)
...
>>> print q
deque([10, 11, 12, 13, 14, 15, 16, 17, 18, 19], maxlen=10)
