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.
........

diff --git a/Doc/tutorial/datastructures.rst b/Doc/tutorial/datastructures.rst
index ef364b20f84a6a44f74ed120b6479c863d391fcb..8cf58c85b312095ea306bcf26b68e6ebc6e233af 100644 (file)
--- a/Doc/tutorial/datastructures.rst
+++ b/Doc/tutorial/datastructures.rst
@@ -153,6 +153,11 @@ the queue, use :meth:`pop` with ``0`` as the index.  For example::
    >>> 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: