That looks quite interesting. It looks like compact dict optimization applied to set. I had the same idea :-) If it reduces the memory footprint, keep insertion order and has low performance overhead, I would be an interesting idea! Victor Le lun. 16 déc. 2019 à 07:56, Inada Naoki <songofacandy@gmail.com> a écrit :
On Mon, Dec 16, 2019 at 1:33 PM Guido van Rossum <guido@python.org> wrote:
Actually, for dicts the implementation came first.
I had tried to implement the Ordered Set. Here is the implementation. https://github.com/methane/cpython/pull/23
Regards, _______________________________________________ Python-Dev mailing list -- python-dev@python.org To unsubscribe send an email to python-dev-leave@python.org https://mail.python.org/mailman3/lists/python-dev.python.org/ Message archived at https://mail.python.org/archives/list/python-dev@python.org/message/SGDD47GT... Code of Conduct: http://python.org/psf/codeofconduct/
-- Night gathers, and now my watch begins. It shall not end until my death.