rings

[Gribouillis]

I may misunderstand your point though

deques are perfect if the program pushes and pops many items at the ends of the deque. It is perfect for stacks and fifos, but if the programs wants to access many times an element in the middle of the deque, it could be very inefficient because accessing the n-th element involves dereferencing n pointers. The getitem has a performance in O(n)