Path: utzoo!utgpu!news-server.csri.toronto.edu!rutgers!ub!acsu.buffalo.edu
From: cloos@acsu.buffalo.edu (James H. Cloos)
Newsgroups: comp.sys.handhelds
Subject: Re: String hashing on the HP-48
Message-ID: <46390@eerie.acsu.Buffalo.EDU>
Date: 15 Nov 90 03:55:22 GMT
References: <11654@life.ai.mit.edu> <5699@uqcspe.cs.uq.oz.au>
Sender: news@acsu.Buffalo.EDU
Organization: State University of New York @ Buffalo
Lines: 14
Nntp-Posting-Host: lictor.acsu.buffalo.edu

In article <5699@uqcspe.cs.uq.oz.au> grue@batserver.cs.uq.oz.au writes:
>What is wrong with using the built in function BYTES as a hashing function?
>It calculates some kind of CRC on the thing that is passed to it and it
>is rather fast.

The algorithm BYTES uses (though no the actual code!) was posted by me
a while back.  The algorithm is the same one used by Kermit.  See the
file kcrc.48 in wuarchive.wustl.edu.  It may exist other places, too.

-JimC
--
James H. Cloos, Jr.		Phone:  +1 716 673-1250
cloos@ACSU.Buffalo.EDU		Snail:  PersonalZipCode:  14048-0772, USA
cloos@ub.UUCP			Quote:  <>