bpo-35118: Improve docs regarding indexing (GH-10265)
diff --git a/Doc/library/collections.rst b/Doc/library/collections.rst
index 495cfc2..6b9d85a 100644
--- a/Doc/library/collections.rst
+++ b/Doc/library/collections.rst
@@ -531,9 +531,9 @@
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 1fea86b..f99f6ff 100644
--- a/Doc/library/queue.rst
+++ b/Doc/library/queue.rst
@@ -275,4 +275,5 @@
: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.