Message151679
> A dict can contain non-orderable keys, I don't know how an AVL tree
> can fit into that.
They may be non-orderable, but since they are required to be hashable,
I guess one can build an comparison function with the following:
def cmp(x, y):
if x == y:
return 0
elif hash(x) <= hash(y):
return -1
else:
return 1
It doesn't yield a mathematical order because it lacks the
anti-symmetry property, but it should be enough for a binary search
tree. |
|
Date |
User |
Action |
Args |
2012-01-20 09:03:20 | neologix | set | recipients:
+ neologix, lemburg, gvanrossum, tim.peters, barry, georg.brandl, terry.reedy, gregory.p.smith, jcea, mark.dickinson, pitrou, vstinner, christian.heimes, benjamin.peterson, eric.araujo, grahamd, Arfrever, v+python, alex, zbysz, skrah, dmalcolm, gz, Arach, Mark.Shannon, eric.snow, Zhiping.Deng, Huzaifa.Sidhpurwala, Jim.Jewett, PaulMcMillan, fx5 |
2012-01-20 09:03:20 | neologix | set | messageid: <1327050200.08.0.337334307592.issue13703@psf.upfronthosting.co.za> |
2012-01-20 09:03:16 | neologix | link | issue13703 messages |
2012-01-20 09:03:16 | neologix | create | |
|