Skip Montanaro <[EMAIL PROTECTED]> added the comment:
What would you suggest? The docs already say:
Though list objects support similar operations, they are optimized
for fast fixed-length operations and incur O(n) memory movement costs
for pop(0) and insert(0, v) operations which change both the size and
position of the underlying data representation.
How would you suck elements out of a list? Probably with something
like:
while mylist:
elt = mylist.pop()
Aside from possible performance issues it's not clear that you would use
a deque object differently than a list in this context.
----------
nosy: +skip.montanaro
_______________________________________
Python tracker <[EMAIL PROTECTED]>
<http://bugs.python.org/issue3891>
_______________________________________
_______________________________________________
Python-bugs-list mailing list
Unsubscribe:
http://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
