On 13.10.16 23:36, Марк Коренберг wrote:
I think it should be one standardized implementation of such containers
in CPython.
For example, C++ has both ordered_map and unorderd_map.
Instead of trees, implementation may use SkipList structure, but this is
just implementation details.
Such structres imply fast insertion and deletion, ability to iterate,
and also memory efficiency.
I recommend to read thorough review articles written by Andrew Barnert:
http://stupidpythonideas.blogspot.com/2013/07/sorted-collections-in-stdlib.html
http://stupidpythonideas.blogspot.com/2014/04/sortedcontainers.html
_______________________________________________
Python-ideas mailing list
Python-ideas@python.org
https://mail.python.org/mailman/listinfo/python-ideas
Code of Conduct: http://python.org/psf/codeofconduct/
