[Python-checkins] r79182 - in python/branches/py3k: Doc/tutorial/datastructures.rst

[georg.brandl]

Author: georg.brandl
Date: Sun Mar 21 10:51:44 2010
New Revision: 79182

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


Modified:
   python/branches/py3k/   (props changed)
   python/branches/py3k/Doc/tutorial/datastructures.rst

Modified: python/branches/py3k/Doc/tutorial/datastructures.rst
==============================================================================
--- python/branches/py3k/Doc/tutorial/datastructures.rst	(original)
+++ python/branches/py3k/Doc/tutorial/datastructures.rst	Sun Mar 21 10:51:44 2010
@@ -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: