Warning: mysqli::__construct(): (HY000/1203): User howardkn already has more than 'max_user_connections' active connections in D:\Inetpub\vhosts\howardknight.net\al.howardknight.net\includes\artfuncs.php on line 21
Failed to connect to MySQL: (1203) User howardkn already has more than 'max_user_connections' active connections
Warning: mysqli::query(): Couldn't fetch mysqli in D:\Inetpub\vhosts\howardknight.net\al.howardknight.net\index.php on line 66
Article <v2sudq$2trh1$1@raubtier-asyl.eternal-september.org>
Deutsch   English   Français   Italiano  
<v2sudq$2trh1$1@raubtier-asyl.eternal-september.org>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!raubtier-asyl.eternal-september.org!.POSTED!not-for-mail
From: Bonita Montero <Bonita.Montero@gmail.com>
Newsgroups: comp.lang.c
Subject: Re: Good hash for pointers
Date: Sat, 25 May 2024 17:00:11 +0200
Organization: A noiseless patient Spider
Lines: 13
Message-ID: <v2sudq$2trh1$1@raubtier-asyl.eternal-september.org>
References: <v2n88p$1nlcc$1@dont-email.me>
 <v2qm8m$2el55$1@raubtier-asyl.eternal-september.org>
 <v2qnue$2evlu$1@dont-email.me> <v2r9br$2hva2$1@dont-email.me>
 <86fru6gsqr.fsf@linuxsc.com>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Sat, 25 May 2024 17:00:10 +0200 (CEST)
Injection-Info: raubtier-asyl.eternal-september.org; posting-host="8f6453ced1f3abd55dad14e52b73bf73";
	logging-data="3075617"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+wZ5mBYRwP1kwr6NSJYe4XqZp1KkBgToM="
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:ldRhcfl3Jf3CMIA/I0pjF3i5VKQ=
Content-Language: de-DE
In-Reply-To: <86fru6gsqr.fsf@linuxsc.com>
Bytes: 1694

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.