traverseda
/
cpython
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

bpo-35118: Improve docs regarding indexing (GH-10265)

This commit is contained in:
Windson yang 2018-11-05 06:34:22 +08:00 committed by Raymond Hettinger
parent 55f3317e98
commit 98b8535415
2 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Doc/library/collections.rst
View File

@ -531,9 +531,9 @@ or subtracting from an empty counter.
In addition to the above, deques support iteration, pickling, ``len(d)``,
``reversed(d)``, ``copy.copy(d)``, ``copy.deepcopy(d)``, membership testing with
the :keyword:`in` operator, and subscript references such as ``d[-1]``. Indexed
access is O(1) at both ends but slows to O(n) in the middle. For fast random
access, use lists instead.
the :keyword:`in` operator, and subscript references such as ``d[0]`` to access
the first element. Indexed access is O(1) at both ends but slows to O(n) in
the middle. For fast random access, use lists instead.
Starting in version 3.5, deques support ``__add__()``, ``__mul__()``,
and ``__imul__()``.

3
Doc/library/queue.rst
View File

@ -275,4 +275,5 @@ SimpleQueue Objects
:class:`collections.deque` is an alternative implementation of unbounded
queues with fast atomic :meth:`~collections.deque.append` and
:meth:`~collections.deque.popleft` operations that do not require locking.
:meth:`~collections.deque.popleft` operations that do not require locking
and also support indexing.