最全的python3队列操作

python里面队列的所有成员函数

from collections import deque

| deque([iterable[, maxlen]]) --> deque object
|
| A list-like sequence optimized for data accesses near its endpoints.
|
|
| add(self, value, /)
| Return self+value.
|
| bool(self, /)
| self != 0
|
| contains(self, key, /)
| Return key in self.
|
| copy(…)
| Return a shallow copy of a deque.
|
| delitem(self, key, /)
| Delete self[key].
|
| eq(self, value, /)
| Return self==value.
|
| ge(self, value, /)
| Return self>=value.
|
| getattribute(self, name, /)
| Return getattr(self, name).
|
| getitem(self, key, /)
| Return self[key].
|
| gt(self, value, /)
| Return self>value.
|
| iadd(self, value, /)
| Implement self+=value.
|
| imul(self, value, /)
| Implement self*=value.
|
| init(self, /, args, **kwargs)
| Initialize self. See help(type(self)) for accurate signature.
|
| iter(self, /)
| Implement iter(self).
|
| le(self, value, /)
| Return self<=value.
|
| len(self, /)
| Return len(self).
|
| lt(self, value, /)
| Return self |
| mul(self, value, /)
| Return selfvalue.
|
| ne(self, value, /)
| Return self!=value.
|
| reduce(…)
| Return state information for pickling.
|
| repr(self, /)
| Return repr(self).
|
| reversed(…)
| D.reversed() – return a reverse iterator over the deque
|
| rmul(self, value, /)
| Return value*self.
|
| setitem(self, key, value, /)
| Set self[key] to value.
|
| sizeof(…)
| D.sizeof() – size of D in memory, in bytes
|
| 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.
|
| copy(…)
| Return a shallow copy of a deque.
|
| count(…)
| D.count(value) -> integer – return number of occurrences of value
|
| 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
|
| index(…)
| D.index(value, [start, [stop]]) -> integer – return first index of value.
| Raises ValueError if the value is not present.
|
| insert(…)
| D.insert(index, object) – insert object before index
|
| 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). If n is negative, rotates left.

Static methods defined here:
new(*args, **kwargs) from builtins.type
Create and return a new object. See help(type) for accurate signature.
----------------------------------------------------------------------
Data descriptors defined here:
maxlen
maximum size of a deque or None if unbounded
----------------------------------------------------------------------
Data and other attributes defined here:
hash = None