diff options
| author | Ezio Melotti <ezio.melotti@gmail.com> | 2010-03-31 07:39:45 +0000 |
|---|---|---|
| committer | Ezio Melotti <ezio.melotti@gmail.com> | 2010-03-31 07:39:45 +0000 |
| commit | fc7b3d26b1fa9642d65370e8a26d940e6e2b2418 (patch) | |
| tree | fc464f2bd9d7228af7199ceb64b937ddf9f2b61c | |
| parent | 8fb0904f2d4662ab1c731ec11f9550fef9a9be2a (diff) | |
| download | cpython-git-fc7b3d26b1fa9642d65370e8a26d940e6e2b2418.tar.gz | |
Remove paragraph about inefficiency of lists used as queues now that the example uses deque.
| -rw-r--r-- | Doc/tutorial/datastructures.rst | 5 |
1 files changed, 0 insertions, 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: |