[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: functional hash operations

From: Paul Jarc
Subject: Re: functional hash operations
Date: Thu, 02 Jan 2003 14:09:59 -0500
User-agent: Gnus/5.090008 (Oort Gnus v0.08) Emacs/21.2 (i686-pc-linux-gnu)

Marius Vollmer <address@hidden> wrote:
> Would it be workable to implement functional hash tables from scratch,
> without basing them on the builtin implementation?  There are the
> functions 'hash', 'hashv', and 'hashq' to help with computing hash
> values for Scheme objects.

I think this is what I'll do.  Given the number of associations in the
hash, how might I compute a good table size?  Finding a nearby prime
seems not too easy.  Are there other classes of numbers that also work
well?  Say, (2^n)-1 or (2^n)+1?


reply via email to

[Prev in Thread] Current Thread [Next in Thread]