There has been recent complains that run-time performance of Nim's Table implementation got worse:
<https://forum.nim-lang.org/t/6920#43331> <https://github.com/timotheecour/Nim/issues/82#issuecomment-625613116> I am curious, whether anyone tried to implement Python 3.6+ `dict` algorithm in Nim. New python `dict` is ordered (by order of insertion), uses less memory with the same sparsity factor. The gist of implementation is in the original Raymond Hettinger's email <https://mail.python.org/pipermail/python-dev/2012-December/123028.html>
