Message151584
> 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. |
|
Date |
User |
Action |
Args |
2012-01-18 23:30:12 | pitrou | set | recipients:
+ pitrou, lemburg, gvanrossum, tim.peters, barry, georg.brandl, terry.reedy, gregory.p.smith, jcea, mark.dickinson, vstinner, christian.heimes, benjamin.peterson, eric.araujo, grahamd, Arfrever, v+python, alex, zbysz, skrah, dmalcolm, gz, neologix, Arach, Mark.Shannon, eric.snow, Zhiping.Deng, Huzaifa.Sidhpurwala, Jim.Jewett, PaulMcMillan, fx5 |
2012-01-18 23:30:12 | pitrou | link | issue13703 messages |
2012-01-18 23:30:12 | pitrou | create | |
|