[Python-checkins] r79524 - python/branches/release26-maint/Doc/tutorial/datastructures.rst
ezio.melotti
python-checkins at python.org
Wed Mar 31 09:39:45 CEST 2010
Author: ezio.melotti
Date: Wed Mar 31 09:39:45 2010
New Revision: 79524
Log:
Remove paragraph about inefficiency of lists used as queues now that the example uses deque.
Modified:
python/branches/release26-maint/Doc/tutorial/datastructures.rst
Modified: python/branches/release26-maint/Doc/tutorial/datastructures.rst
==============================================================================
--- python/branches/release26-maint/Doc/tutorial/datastructures.rst (original)
+++ python/branches/release26-maint/Doc/tutorial/datastructures.rst Wed Mar 31 09:39:45 2010
@@ -158,11 +158,6 @@
>>> queue # Remaining queue in order of arrival
deque(['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-functional:
More information about the Python-checkins
mailing list