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

document that deque indexing is O(n) #4123

This commit is contained in:
Benjamin Peterson 2008-10-16 18:52:14 +00:00
parent 61376409a9
commit 5c4e006367
1 changed files with 3 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Doc/library/collections.rst
View File

@ -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: