➜

This issue tracker has been migrated to GitHub, and is currently read-only.
For more information, see the GitHub FAQs in the Python's Developer Guide.

Author PaulMcMillan
Recipients Arfrever, Mark.Shannon, PaulMcMillan, Zhiping.Deng, alex, barry, benjamin.peterson, christian.heimes, dmalcolm, eric.araujo, georg.brandl, gvanrossum, jcea, lemburg, pitrou, terry.reedy, vstinner
Date 2012-01-05.00:57:03
SpamBayes Score 7.996954e-05
Marked as misclassified No
Message-id <CAO_YWRXwYVLGsx8A=EpVoKETD0qmD8EL=xfqBYbc_Pos0ibjyw@mail.gmail.com>
In-reply-to <1325724837.8.0.410157062214.issue13703@psf.upfronthosting.co.za>
Content 
> - for small strings we could use a different seed than for larger strings

Or just leave them unseeded with our existing algorithm. Shifting them
into a different part of the hash space doesn't really gain us much.

> - for larger strings we could use Paul's algorithm but limit the XOR op to the first and last 16 elements instead of all elements.

Agreed. It does have to be both the first and the last though. We
can't just do one or the other.
History
Date User Action Args
2012-01-05 00:57:04PaulMcMillansetrecipients: + PaulMcMillan, lemburg, gvanrossum, barry, georg.brandl, terry.reedy, jcea, pitrou, vstinner, christian.heimes, benjamin.peterson, eric.araujo, Arfrever, alex, dmalcolm, Mark.Shannon, Zhiping.Deng
2012-01-05 00:57:04PaulMcMillanlinkissue13703 messages
2012-01-05 00:57:03PaulMcMillancreate