Antoine Pitrou <[EMAIL PROTECTED]> added the comment: Well, perhaps the deque documentation should make it clear that random access is O(n), rather than O(1) for a list. With this information it is easy to infer that operations such as shuffle() can be much slower on a deque.
---------- assignee: -> georg.brandl components: +Documentation -Library (Lib) nosy: +georg.brandl, pitrou priority: -> normal type: -> feature request versions: +Python 2.6, Python 3.0 -Python 2.5 _______________________________________ Python tracker <[EMAIL PROTECTED]> <http://bugs.python.org/issue4123> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: http://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
