[m-dev.] For review: hash table implementation

[Fergus Henderson]

On 01-Feb-2001, David Overton <dmo at cs.mu.OZ.AU> wrote:
> 
> Another approach here would be to use a type class `hashable' and define
> an instance for each type you want to hash.  Have you considered this?

Even if that approach is used, the actual hash table code should
parameterized on a hash function, not just on a type, so that the user
can easily use a hash function that is different from the default;
this can be useful if the user has information about the likely
distribution of data, for example.

-- 
Fergus Henderson <fjh at cs.mu.oz.au>  |  "I have always known that the pursuit
                                    |  of excellence is a lethal habit"
WWW: <http://www.cs.mu.oz.au/~fjh>  |     -- the last words of T. S. Garp.
--------------------------------------------------------------------------
mercury-developers mailing list
Post messages to:       mercury-developers at cs.mu.oz.au
Administrative Queries: owner-mercury-developers at cs.mu.oz.au
Subscriptions:          mercury-developers-request at cs.mu.oz.au
--------------------------------------------------------------------------