How slow and space-inefficient would it be to just implement the set methods on top of dict?
Do dicts lose insertion order when a key is deleted? AFAIU, OrderedDict do not lose insertion order on delete. Would this limit the utility of an ordered set as a queue? What set methods does a queue need to have? On Thu, Dec 19, 2019, 11:41 PM Tim Peters <tim.pet...@gmail.com> wrote: > [Nick] > > I must admit that I was assuming without stating that a full OrderedSet > > implementation would support the MutableSequence interface. > > Efficient access via index position too would be an enormous new > requirement, My bet: basic operations would need to change from O(1) > to O(log(N)). > > BTW, in previous msgs there are links to various implementations > calling themselves "ordered sets". One of them supplies O(1) > indexing, but at the expense of making deletion O(N) (!): > > https://pypi.org/project/ordered-set/ > > If efficient indexing is really wanted, then the original "use case" > Larry gave was definitely obscuring an XY problem ;-) > _______________________________________________ > Python-Dev mailing list -- python-dev@python.org > To unsubscribe send an email to python-dev-le...@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/IBRSGUTHIMOZ6JGIYJBQJFXEANFZI4V5/ > Code of Conduct: http://python.org/psf/codeofconduct/ >
_______________________________________________ Python-Dev mailing list -- python-dev@python.org To unsubscribe send an email to python-dev-le...@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/PK4C2OGTB2HZ4E7OYU6B6W7A7H4LPX7W/ Code of Conduct: http://python.org/psf/codeofconduct/
