On Tue, 3 Oct 2017 22:04:46 +1100 Steven D'Aprano <st...@pearwood.info> wrote: > > If it were possible to have a lightweight sequence data structure with > fast O(1) random access AND insertion/deletion at the same time, that > would be a candidate to replace both lists and deques in the stdlib.
Daniel Stutzbach's blist is well-known at this point: http://stutzbachenterprises.com/performance-blist See http://legacy.python.org/dev/peps/pep-3128/ (rejected) and https://mail.python.org/pipermail/python-ideas/2014-September/029434.html (inconclusive) Regards Antoine. _______________________________________________ Python-ideas mailing list Python-ideas@python.org https://mail.python.org/mailman/listinfo/python-ideas Code of Conduct: http://python.org/psf/codeofconduct/
