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.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,deb99d30f6cbcdbe
X-Google-Attributes: gid103376,public
From: dewar@cs.nyu.edu (Robert Dewar)
Subject: Re: Hashing Algorithms
Date: 1996/03/25
Message-ID: <dewar.827792937@schonberg>#1/1
X-Deja-AN: 144217913
references: <internews46B4920C5E@argonet.co.uk>
organization: Courant Institute of Mathematical Sciences
newsgroups: comp.lang.ada
Date: 1996-03-25T00:00:00+00:00
List-Id: <comp.lang.ada>

David Wallace said

"Ia working currently with a Design Issue which requiresbthe use of a hashing
algorithm for a string to an integer.

I have seen a couple of algorithms, however due to their nature would not be
allowed to incorporate them in to the software.

Could anybody point out the source of some hashing algorithms, which are
quick and do not use unchecked conversion within them. If not, I will just have
to reinvent the wheel and write one myself."

Try looking in the GNAT sources, look at the general hash table routines
in the Gnat hierarchy, and the hash routine used by the Namet compiler
unit. Isn't it nice to have sources available?