Re: question on hash for objects such as tables and functions

[Francisco Olarte <folarte@...>]

Philippe:

On Wed, May 27, 2020 at 12:56 PM Philippe Verdy <verdyp@gmail.com> wrote:
>> > Knuth designated good multipliers for several wordsizes. You deliberately ignored it just like you deliberately chose to ignore the primality requiement of the factor: this is a proof that you've not understood the Knuth algorithm and how and why it really works as a good (but still fast) hash.
>>
>> .... This "you deliberately" seems to indicate you are not replying to
>> me, although you are doing it in ( top posted as usual, something
>> smells rotten in Denmark ) response which quotes me.

> You directly support this code even if it's evidently incorrect. So you're directly part of the problem.

No, that is a false acusation. I do not directly support any code. I
just oppose your ways.

Francisco Olarte.