> > FWIW, deque indexing for small deques is already O(1) > and somewhat fast. You only get O(n) degradation > (with a small contant factor) on large deques. >
Hi. For small dequeues (smaller than a constant), you have to have O(1) operations, by definition :-) Cheers, fijal _______________________________________________ Python-Dev mailing list Python-Dev@python.org http://mail.python.org/mailman/listinfo/python-dev Unsubscribe: http://mail.python.org/mailman/options/python-dev/archive%40mail-archive.com
