How do I implement a FIFO data structure in Python?

How do I implement a FIFO data structure in Python?

You can implement a FIFO (First In, First Out) data structure using a queue. In Python, you can use the collections.deque for this purpose.

Can you show me a simple example?

Sure! Here's a basic example:

from collections import deque

# Create a FIFO queue
queue = deque()

# Add elements to the queue
queue.append('first')
queue.append('second')
queue.append('third')

# Remove elements from the queue
print(queue.popleft())  # Output: first
print(queue.popleft())  # Output: second

What if I want to limit the size of the queue?

You can limit the size of the queue by using a conditional check before appending new elements. For example:

MAX_SIZE = 3
if len(queue) < MAX_SIZE:
    queue.append('new_element')
else:
    print('Queue is full!')