Mirror
/
cpython
mirror of https://github.com/python/cpython
4
1
Fork 0
Code Issues Releases Wiki Activity

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

This commit is contained in:
Ezio Melotti 2010-03-31 07:39:45 +00:00
parent 8fb0904f2d
commit fc7b3d26b1
1 changed files with 0 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
Doc/tutorial/datastructures.rst
View File

@ -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: