On Nov 2, 2010, at 1:42 PM, Tom Lane <t...@sss.pgh.pa.us> wrote: > However, this is largely beside the point, because that theory, as well > as the Java code you're arguing from, has to do with the initial hashing > of a raw sequence of input items. Not with combining some existing hash > values. The rotate-and-xor method I suggested for that is borrowed > exactly from section 6.4 of Knuth (page 512, in the first edition of > volume 3).
It seems undesirable to me to have a situation where transposing two array elements doesn't change the hash value. But I just work here. ...Robert -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers
