Re: Looking for high-quality hashing function for dynamic linker

mw@ipx2.rz.uni-mannheim.de (Marc Wachowitz)
Wed, 2 Aug 1995 21:33:52 GMT

          From comp.compilers
Related articles
Looking for high-quality hashing function for dynamic linker eb@kaleida.com (1995-07-28)
Re: Looking for high-quality hashing function for dynamic linker mw@ipx2.rz.uni-mannheim.de (1995-08-02)
Re: Looking for high-quality hashing function for dynamic linker stefan.monnier@epfl.ch (Stefan Monnier) (1995-08-03)
Re: Looking for high-quality hashing function for dynamic linker haahr@netcom.com (1995-08-03)
Re: Looking for high-quality hashing function for dynamic linker chase@centerline.com (1995-08-03)
| List of all articles for this month |
Newsgroups: comp.compilers,comp.theory,comp.lang.misc,comp.lang.dylan
From: mw@ipx2.rz.uni-mannheim.de (Marc Wachowitz)
Followup-To: comp.compilers
Keywords: theory
Organization: Compilers Central
References: 95-08-021
Date: Wed, 2 Aug 1995 21:33:52 GMT

Eric Benson (eb@kaleida.com) wrote:
[...]
> Is it feasible to compute a signature consisting of a few (say, less than
> ten) 32 bit words and use this for comparison instead of the entire set of
> names?


The MD5 algorithm should do what you want; it computes a 128-bit signature.
Look at ftp://rsa.com/pub/rfc1321.txt for a description and C source code.


                                Marc Wachowitz <mw@ipx2.rz.uni-mannheim.de>
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.