Sujet : Re: Good hash for pointers
De : tr.17687 (at) *nospam* z991.linuxsc.com (Tim Rentsch)
Groupes : comp.lang.cDate : 31. May 2024, 03:26:55
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <86wmnapvgw.fsf@linuxsc.com>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
User-Agent : Gnus/5.11 (Gnus v5.11) Emacs/22.4 (gnu/linux)
Bonita Montero <
Bonita.Montero@gmail.com> writes:
Am 28.05.2024 um 12:07 schrieb Ben Bacarisse:
>
Bonita Montero <Bonita.Montero@gmail.com> writes:
>
This shows the perfect equal distribution if I take a 32 bit integer
and multiply it by the largest 32 bit prime:
>
There was no need to write this program. It just illustrates a specific
example of a basic theorem where the multiplier and modulus are
co-prime.
>
For Tim it was necessary.
No it was not. I already understood this before my posting
of Sunday, May 26.
Re: Good hash for pointers
Re: Good hash for pointers