From: Windson yang Date: Sun, 4 Nov 2018 22:34:22 +0000 (+0800) Subject: bpo-35118: Improve docs regarding indexing (GH-10265) X-Git-Tag: v3.8.0a1~581 X-Git-Url: http://git.ipfire.org/?a=commitdiff_plain;h=98b85354153883b0a080f678f213729cd0764fee;p=thirdparty%2FPython%2Fcpython.git bpo-35118: Improve docs regarding indexing (GH-10265) --- diff --git a/Doc/library/collections.rst b/Doc/library/collections.rst index 495cfc2c234f..6b9d85abaae7 100644 --- a/Doc/library/collections.rst +++ b/Doc/library/collections.rst @@ -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__()``. diff --git a/Doc/library/queue.rst b/Doc/library/queue.rst index 1fea86bfc5cd..f99f6ffb05f6 100644 --- a/Doc/library/queue.rst +++ b/Doc/library/queue.rst @@ -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.