This module implements no thread-safe fifo queues. A fifo queue behaves in such a way that the first element inserted in the queue is also the first element to be removed (first in, first out).
Create a Fifo instance with size “places” for items. If only_bytes is True, the Fifo will use a bytearray to store bytes; if False it will use a list.
Return True if the fifo is full
Return True if the fifo is empty
Insert obj into the fifo queue. Raise FifoFullError if the fifo is full.
Get an object out of the fifo queue. Raise FifoEmptyError if the fifo is empty.
Return the object at the head of the fifo queu without removing it. Raise FifoEmptyError if the fifo is empty.
Put every item of objs into the fifo queue.
Return the number of items in the queue.
Clear the fifo by removing all elements