Message151680
> They may be non-orderable, but since they are required to be hashable,
> I guess one can build an comparison function with the following:
Since we are are trying to fix a problem where hash(X) == hash(Y), you
can't make them orderable by using the hash-values and build a binary
out of the (equal) hash-values. |
|
Date |
User |
Action |
Args |
2012-01-20 09:30:41 | fx5 | set | recipients:
+ fx5, 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, neologix, Arach, Mark.Shannon, eric.snow, Zhiping.Deng, Huzaifa.Sidhpurwala, Jim.Jewett, PaulMcMillan |
2012-01-20 09:30:41 | fx5 | set | messageid: <1327051841.74.0.786264271225.issue13703@psf.upfronthosting.co.za> |
2012-01-20 09:30:41 | fx5 | link | issue13703 messages |
2012-01-20 09:30:41 | fx5 | create | |
|