[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Chicken-users] Re: Better algorithm for growing hash tables
From: |
felix winkelmann |
Subject: |
Re: [Chicken-users] Re: Better algorithm for growing hash tables |
Date: |
Wed, 7 Dec 2005 20:53:47 +0100 |
On 12/6/05, Eric Hanchrow <address@hidden> wrote:
> I'm using version 212 (which I got from darcs), so I expect all the
> patches that have been previously mentioned have already been applied.
>
> I'm happy to make the code available if anyone's interested (it's
> small).
>
You can create a hash-table with string=? as the comparing procedure,
which is likely to be faster (just turn the number into a string before
using it as a hash-key).
When the hash-table is full, what is the value of
(##sys#size (##sys#slot <hash-table> 1))
?
In any way, I'd love to see the code.
cheers,
felix