From: Benjamin Peterson <benjamin@python.org>
Date: Thu, 16 Oct 2008 18:52:14 +0000 (+0000)
Subject: document that deque indexing is O(n) #4123
X-Git-Tag: v2.7a1~2733
X-Git-Url: http://git.ipfire.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=5c4e006367fcfb2cac3581080637976d0bd83921;p=thirdparty%2FPython%2Fcpython.git

document that deque indexing is O(n) #4123
---

diff --git a/Doc/library/collections.rst b/Doc/library/collections.rst
index a66b555191d3..258b54fdc609 100644
--- a/Doc/library/collections.rst
+++ b/Doc/library/collections.rst
@@ -247,7 +247,9 @@ Notes on using :class:`Set` and :class:`MutableSet` as a mixin:
 
 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]``.
+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.
 
 Example: