[issue4123] random.shuffle slow on deque

[Antoine Pitrou]

Antoine Pitrou <pitrou at free.fr> 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 <report at bugs.python.org>
<http://bugs.python.org/issue4123>
_______________________________________