Path: ...!3.eu.feeder.erje.net!feeder.erje.net!news2.arglkargh.de!news.in-chemnitz.de!news.swapon.de!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: Tim Rentsch Newsgroups: comp.lang.c Subject: Re: Good hash for pointers Date: Sat, 25 May 2024 10:40:22 -0700 Organization: A noiseless patient Spider Lines: 19 Message-ID: <8634q5hjsp.fsf@linuxsc.com> References: <86fru6gsqr.fsf@linuxsc.com> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Injection-Date: Sat, 25 May 2024 19:40:23 +0200 (CEST) Injection-Info: dont-email.me; posting-host="8137c08e2aeaf8da9fb9d9b9c4e0a9a5"; logging-data="3133658"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+keVSd9t0M5+scs9Ez942/Tva+lLQL5pA=" User-Agent: Gnus/5.11 (Gnus v5.11) Emacs/22.4 (gnu/linux) Cancel-Lock: sha1:H/2+dqp71BIXrfMl4CgdFkLTx4g= sha1:7gxQMU9uIJ0Ga1OyjCKmxhnQH64= Bytes: 1953 Bonita Montero writes: > Am 25.05.2024 um 11:12 schrieb Tim Rentsch: > >> Your hash function is expensive to compute, moreso even >> than the "FNV" function shown earlier. In a case like >> this one where the compares are cheap, it's better to >> have a dumb-but-fast hash function that might need a >> few more looks to find an open slot, because the cost >> of looking is so cheap compared to computing the hash >> function. > > A (size_t)pointer * LARGE_PRIME can be sufficient, > ignoring the overflow. Plenty fast but the output quality is poor. I tested this scheme against four other hash functions, and in four out of five workloads it was always dead last, by a noticeable margin.