deque(iterable[, maxlen]) –> deque object
Build an ordered collection accessible from endpoints only.
Add an element to the right side of the deque.
Add an element to the left side of the deque.
Remove all elements from the deque.
Extend the right side of the deque with elements from the iterable
Extend the left side of the deque with elements from the iterable
Remove and return the rightmost element.
Remove and return the leftmost element.
D.remove(value) – remove first occurrence of value.
Rotate the deque n steps to the right (default n=1). If n is negative, rotates left.