Mercurial > cpython-lru_cache-weakref
diff Doc/tutorial/datastructures.rst @ 59800:575ec773dda4
Merged revisions 79179 via svnmerge from
svn+ssh://pythondev@svn.python.org/python/trunk
........
r79179 | georg.brandl | 2010-03-21 10:37:54 +0100 (So, 21 Mär 2010) | 1 line
Mention inefficiency of lists as queues, add link to collections.deque discussion.
........
| author | Georg Brandl <georg@python.org> |
|---|---|
| date | Sun, 21 Mar 2010 09:51:44 +0000 |
| parents | f0195daadffb |
| children | fd5c0ea2870b |
line wrap: on
line diff
--- a/Doc/tutorial/datastructures.rst Sun Mar 21 09:50:49 2010 +0000 +++ b/Doc/tutorial/datastructures.rst Sun Mar 21 09:51:44 2010 +0000 @@ -153,6 +153,11 @@ >>> queue ['Michael', 'Terry', 'Graham'] +However, since lists are implemented as an array of elements, they are not the +optimal data structure to use as a queue (the ``pop(0)`` needs to move all +following elements). See :ref:`tut-list-tools` for a look at +:class:`collections.deque`, which is designed to work efficiently as a queue. + .. _tut-listcomps: