From: "Frederico Jerónimo" <DarkRealms AT netcabo DOT pt>
Newsgroups: comp.os.msdos.djgpp
Subject: Hash function
Date: Thu, 1 Feb 2001 20:00:05 -0000
Lines: 20
Message-ID: <95cfee$m9h$1@venus.telepac.pt>
NNTP-Posting-Host: 213.22.24.168
X-Trace: venus.telepac.pt 981057806 22833 213.22.24.168 (1 Feb 2001 20:03:26 GMT)
X-Complaints-To: abuse AT mail DOT telepac DOT pt
NNTP-Posting-Date: 1 Feb 2001 20:03:26 GMT
X-Priority: 3
X-MSMail-Priority: Normal
X-Newsreader: Microsoft Outlook Express 5.00.2615.200
X-MIMEOLE: Produced By Microsoft MimeOLE V5.00.2615.200
To: djgpp AT delorie DOT com
DJ-Gateway: from newsgroup comp.os.msdos.djgpp
Reply-To: djgpp AT delorie DOT com

Hi all,

    I have a hash function that given a 20 bit entry (A19-A0) , returns a 11
bit number composed of the most significant bit (A19), bit A13 and the
remaining least significant bits (bit A0-A8).

    Ex : Given 0x8ae29 the function would return 0x629

    I know this is not a very efficient hash function so I was wondering if
anyone has any ideas for a better one. Thanks in advance,

----------------------------------------------------------------------------
-------------------------------------------
Frederico Jerónimo
DarkRealms AT netcabo DOT pt

Dark Realms :  http://mega.ist.utl.pt/~fjds/
Programming, graphics, medieval & fantasy info, texts & quotations, music...