From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,795de96bd314bc93
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2001-05-31 00:07:36 PST
Path: 
 archiver1.google.com!newsfeed.google.com!newsfeed.stanford.edu!headwall.stanford.edu!news-out.nibble.net!news-in.nibble.net!newsfeed01.sul.t-online.de!newsfeed00.sul.t-online.de!t-online.de!news-lei1.dfn.de!news-nue1.dfn.de!news-han1.dfn.de!news.fh-hannover.de!news.cid.net!news.enyo.de!news1.enyo.de!not-for-mail
From: Florian Weimer <fw@deneb.enyo.de>
Newsgroups: comp.lang.ada
Subject: Re: function hash
Date: 31 May 2001 09:22:09 +0200
Organization: Enyo's not your organization
Message-ID: <87hey20yqm.fsf@deneb.enyo.de>
References: <3b117b26_3@news.arrakis.es> <3B11F48A.F018909F@acm.org>
 <87u2225zsn.fsf@deneb.enyo.de> <3B159410.5532C587@acm.org>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Xref: archiver1.google.com comp.lang.ada:7914
Date: 2001-05-31T09:22:09+02:00
List-Id: <comp.lang.ada>

Jeffrey Carter <jrcarter@acm.org> writes:

> Florian Weimer wrote:
> > 
> > A hash function returning only 256 different values?  Are there any
> > applications for it?
> 
> Given the original poster's requirements of handling 500-1000 elements,
> that's only 2-4 per bin, so it seemed suitable.

In particular with long strings, this will result in a measurable
performance degradation in comparison to a real hash function because
of the necessity to perform additional key comparisons.