Antoine Pitrou <pit...@free.fr> added the comment: > MvL's suggestion of using AVL trees for hash bucket slots instead of > our linear slot finding algorithm is a better way to fix the ultimate > problem by never devolving into linear behavior at all.
A dict can contain non-orderable keys, I don't know how an AVL tree can fit into that. ---------- _______________________________________ Python tracker <rep...@bugs.python.org> <http://bugs.python.org/issue13703> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: http://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
