[fpc-pascal] How reliable are Hashlists in Contnrs

[Bart]

On Mon, Aug 24, 2020 at 9:25 PM Lars via fpc-pascal
<fpc-pascal at lists.freepascal.org> wrote:

> Is there a such thing as a perfect hashlist which never has a collision,

No, there are infinite possible items you can add to a haslist, but
only a finite number of available hashes.
It's the pigeon hole principle:
https://en.wikipedia.org/wiki/Pigeonhole_principle

-- 
Bart