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 <[email protected]> a écrit : > > On Mon, Dec 16, 2019 at 1:33 PM Guido van Rossum <[email protected]> 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 -- [email protected] > To unsubscribe send an email to [email protected] > https://mail.python.org/mailman3/lists/python-dev.python.org/ > Message archived at > https://mail.python.org/archives/list/[email protected]/message/SGDD47GTMS7OGIEZTLLXEYHABL5OS4EN/ > Code of Conduct: http://python.org/psf/codeofconduct/ -- Night gathers, and now my watch begins. It shall not end until my death. _______________________________________________ Python-Dev mailing list -- [email protected] To unsubscribe send an email to [email protected] https://mail.python.org/mailman3/lists/python-dev.python.org/ Message archived at https://mail.python.org/archives/list/[email protected]/message/C4IQW5OHLTGWJ7I6EAZ6S6XYQPONGVAV/ Code of Conduct: http://python.org/psf/codeofconduct/
