Message169355
| Author |
ncoghlan |
| Recipients |
Arfrever, christian.heimes, georg.brandl, loewis, mark.dickinson, meador.inge, ncoghlan, pitrou, python-dev, skrah, vstinner |
| Date |
2012年08月29日.09:51:27 |
| SpamBayes Score |
-1.0 |
| Marked as misclassified |
Yes |
| Message-id |
<1346233888.9.0.416084379579.issue15573@psf.upfronthosting.co.za> |
| In-reply-to |
| Content |
Perhaps the hash could just be based on a subset of the items? For example, hash the format, shape and the first and last items?
Yes, such an approach means you're more likely to get collisions if you do start hashing these, but that seems better than making hashing itself excessively slow. |
|
History
|
|---|
| Date |
User |
Action |
Args |
| 2012年08月29日 09:51:29 | ncoghlan | set | recipients:
+ ncoghlan, loewis, georg.brandl, mark.dickinson, pitrou, vstinner, christian.heimes, Arfrever, skrah, meador.inge, python-dev |
| 2012年08月29日 09:51:28 | ncoghlan | set | messageid: <1346233888.9.0.416084379579.issue15573@psf.upfronthosting.co.za> |
| 2012年08月29日 09:51:28 | ncoghlan | link | issue15573 messages |
| 2012年08月29日 09:51:27 | ncoghlan | create |
|