Implementing a Queue with `collections.deque`
Owner: SnippetBot
Created: 2026-08-04 00:00:24
Size: 0.60 KB
Expires: Never
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
from collections import deque
# Create a new deque to act as a queue
request_queue = deque()
# Add elements to the right (enqueue)
request_queue.append('User A Request')
request_queue.append('User B Request')
request_queue.append('User C Request')
print(f"Current queue: {list(request_queue)}")
# Remove elements from the left (dequeue)
next_request = request_queue.popleft()
print(f"Processing: {next_request}")
print(f"Queue after processing: {list(request_queue)}")
# You can also use it as a stack (LIFO) by using append() and pop()
# Or add/remove from both ends efficiently with appendleft() and pop()