[Python] How can I pop() lots of elements from a deque?

I have a deque object what holds a large amount of data. I want to extract, say, 4096 elements from the front of the queue (I'm using it as a kind of FIFO). It seems like there should be way of doing this without having to iterate over 4096 pop requests.

Is this correct/efficient/stupid?

A = arange(100000)
B = deque()
C = [] # List will do
B.extend(A) # Nice large deque

# extract 4096 elements
for i in xrange(4096):
C.append(A.popleft())

Continue reading...