pymel.util.trees.deque¶
![digraph inheritance24619508a7 {
rankdir=TB;
ranksep=0.15;
nodesep=0.15;
size="8.0, 12.0";
"deque" [shape=box,fontname=Vera Sans, DejaVu Sans, Liberation Sans, Arial, Helvetica, sans,fontsize=8,style="setlinewidth(0.5)",height=0.25];
}](../../../_images/inheritance-e6f3296bec2594973ddb3166904ff94b54dc7d0e.png)
- class deque¶
deque(iterable[, maxlen]) –> deque object
Build an ordered collection accessible from endpoints only.
- append¶
- Add an element to the right side of the deque.
- appendleft¶
- Add an element to the left side of the deque.
- clear¶
- Remove all elements from the deque.
- extend¶
- Extend the right side of the deque with elements from the iterable
- extendleft¶
- Extend the left side of the deque with elements from the iterable
- pop¶
- Remove and return the rightmost element.
- popleft¶
- Remove and return the leftmost element.
- remove¶
- D.remove(value) – remove first occurrence of value.
- rotate¶
- Rotate the deque n steps to the right (default n=1). If n is negative, rotates left.