Serhiy Storchaka added the comment: > But rotate_at() / rotate_after() can probably be O(1), unless I'm missing > something.
Hmm, perhaps. But only for current implementation. With more effective deque-like implementation (when linked list items grouped in fixed-size chunks) it will be O(n). ---------- _______________________________________ Python tracker <rep...@bugs.python.org> <http://bugs.python.org/issue17100> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: http://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
