[Top][All Lists]

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

Re: Efficiency and flexibility of hash-tables

From: Paul Jarc
Subject: Re: Efficiency and flexibility of hash-tables
Date: Wed, 12 Feb 2003 15:47:59 -0500
User-agent: Gnus/5.090015 (Oort Gnus v0.15) Emacs/21.2 (i686-pc-linux-gnu)

Roland Orre <address@hidden> wrote:
> The disadvantage with the balanced tree solution though is that it's
> not enough with a hash function (and equal?), it also needs a
> comparision (<) function.

(< (hash key1 0) (hash key2 0))
It's easy enough to modify hash.c to support this, by skipping the
modulo operation.  (It'd be a good idea anyway, since currently (in
1.6.3) guile crashes.)


reply via email to

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