nltk.deque
¶
-
class
nltk.
deque
¶ deque([iterable[, maxlen]]) –> deque object
Build an ordered collection with optimized access from its endpoints.
Methods¶
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. |
count (...) |
|
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. |
reverse |
D.reverse() – reverse IN PLACE |
rotate |
Rotate the deque n steps to the right (default n=1). |