Re: [PHP4BETA] Zend hash functions enchantments [PATCH]

On Tue, 11 Apr 2000 01:20:42 +1000, Alan <alan@sanguis.com.au> wrote: >On Mon, 10 Apr 2000 09:12:37 -0500, Andrei Zmievski <andrei@ispi.net> wrote: >> >> On Thu, 06 Apr 2000, Jerry Lundström wrote: >>> Are you sure about this? >>> If it is so then then hash algo seams a little bit weak because that should >>> not happen. You shouldn't get two diffrent strings with the same hash value. >> >> No, you are not correct. There are plenty of good hash functions that >> produce collisions. >> > >Just to add to what Andrei has said Jerry, hash functions do not aim to produce unique values >for the keys, they are a compromise between speed/complexity/memory usage. Check out a text from >your local library on data structures and algorithms. I recommend you compare lists, hashes and >trees. > Okey okey, I know its "weak" because of speed issues and there is no need to talk about this anymore... my project was canceled (big bummer). Thanks for all the info and response anyway! -- Jerry.Lundström:<jerry.lundstrom@citat.se>:system.developer/programmer icq.18682823:mobile+46.739.876053:phone+46.31.7107244:fax+46.31.7107201 citat.solutions:Kronhusgatan.9:SE-411.05.Gothenburg:Sweden www.citat.se/solutions