Remove paragraph about inefficiency of lists used as queues now that the example...

diff --git a/Doc/tutorial/datastructures.rst b/Doc/tutorial/datastructures.rst
index 2f9488561cd888b34e5c924fd38051a2ab4f5a40..dfc2b33bb9e979ea01a65a6ee78e5ec37ef9685a 100644 (file)
--- 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: