Daniel Stutzbach <dan...@stutzbachenterprises.com> added the comment:
Hello Simon, Accessing an arbitrary element of a deque takes O(n) time, making your .index implementation O(n**2). If you describe the kinds of operations that you need to perform efficiently, we may be able to suggest a better data structure for you to use. ---------- _______________________________________ Python tracker <rep...@bugs.python.org> <http://bugs.python.org/issue10059> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: http://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
