Martin v. L.: > For this API, I think it's important to make some performance guarantees.
I may appreciate them for all Python collections :-) > It seems fairly difficult to make byindex O(1), and > simultaneously also make insertion/deletion better than O(n). It may be possible to make both of them O(log n), but I may appreciate byindex O(n) and insertion/deletion O(1). Bye, bearophile -- http://mail.python.org/mailman/listinfo/python-list
