From fc7b3d26b1fa9642d65370e8a26d940e6e2b2418 Mon Sep 17 00:00:00 2001 From: Ezio Melotti Date: Wed, 31 Mar 2010 07:39:45 +0000 Subject: [PATCH] Remove paragraph about inefficiency of lists used as queues now that the example uses deque. --- Doc/tutorial/datastructures.rst | 5 ----- 1 file changed, 5 deletions(-) diff --git a/Doc/tutorial/datastructures.rst b/Doc/tutorial/datastructures.rst index 2f9488561c..dfc2b33bb9 100644 --- a/Doc/tutorial/datastructures.rst +++ b/Doc/tutorial/datastructures.rst @@ -158,11 +158,6 @@ have fast appends and pops from both ends. For example:: >>> 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: -- 2.40.0