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=-0.3 required=5.0 tests=BAYES_00,FREEMAIL_FROM,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,eec376a334ad59ed
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2002-04-10 15:05:00 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!canoe.uoregon.edu!arclight.uoregon.edu!enews.sgi.com!harbinger.cc.monash.edu.au!msunews!not-for-mail
From: "Chad R. Meiners" <crmeiners@hotmail.com>
Newsgroups: comp.lang.ada
Subject: Re: hashing
Date: Wed, 10 Apr 2002 17:56:01 -0400
Organization: Michigan State University
Message-ID: <a92chd$1mbk$1@msunews.cl.msu.edu>
References: <1b2t8.507$na.19833@news8-gui.server.ntli.net>
Reply-To: "Chad R. Meiners" <crmeiners@hotmail.com>
NNTP-Posting-Host: arctic.cse.msu.edu
X-Priority: 3
X-MSMail-Priority: Normal
X-Newsreader: Microsoft Outlook Express 6.00.2600.0000
X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000
Xref: archiver1.google.com comp.lang.ada:22331
Date: 2002-04-10T17:56:01-04:00
List-Id: <comp.lang.ada>

Look in "The Art of Computer Programming" Volume 3 Sorting and Searching by
Donald E. Knuth.  Chapter 6 section 4 is about hashing.

-CRM

"chris.danx" <chris.danx@ntlworld.com> wrote in message
news:1b2t8.507$na.19833@news8-gui.server.ntli.net...
> Hi,
>
> Does anyone have a good hash function for strings (length is arbitary,
> number of buckets is determined when package is instantiated and
collisions
> are handled with chaining)?  I'm new to writing hash tables and functions
> (used them in libs, but this has to be all my own work!), and have chosen
> this technique to implement in an assignment -- had enough linked lists,
and
> want to expand my horizons.
>
> I'm searching for a function just now, so this isn't laziness just wanted
to
> utilise another resource (your brains) in case nothing turns up.  After
the
> assignment submission in a few weeks, I'll tidy up the sources for all the
> useful adts I've written this term and GMGPL them (lists (singly, doubly),
> hash tables, and whatever else comes up) if ppl express an interest (all
> adts are generic so far).
>
>
>
> Thanks,
> Chris
>
> p.s. does anyone have any uses for circular lists?  Tom Swans Tp5.5 book
> mentions them, what are they used for?  Just curious...
>
>
> p.p.s. should performance/complexity information be included?  I seem to
> recall a conversation on this a while back, but can't remember if ppl
> thought it was a good idea.
>
>