On Fri, 9 Sep 2016 14:01:08 -0500 David Mertz <me...@gnosis.cx> wrote: > It seems unlikely, but not inconceivable, that someday in the future > someone will implement a dictionary that is faster than current versions > but at the cost of losing inherent ordering.
I agree with this. Since ordering is a constraint, in abstracto it is quite understandable that relaxing a constraint may enable more efficient algorithms or implementations. Besides, I don't think it has been proven that the compact-and-ordered dict implementation is actually *faster* than the legacy one. It is more compact, which can matter in some contexts (memory-heavy workloads with lots of objects, perhaps), but not necessarily others. Regards Antoine. _______________________________________________ Python-Dev mailing list Python-Dev@python.org https://mail.python.org/mailman/listinfo/python-dev Unsubscribe: https://mail.python.org/mailman/options/python-dev/archive%40mail-archive.com
