[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Efficiency and flexibility of hash-tables
From: |
Roland Orre |
Subject: |
Re: Efficiency and flexibility of hash-tables |
Date: |
12 Feb 2003 22:58:40 +0100 |
On Wed, 2003-02-12 at 21:47, Paul Jarc wrote:
> > 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.)
That was smart ! OK, you can not utilize the order of the tree in any
way for extraction traversing, but that is not important in this case.
Strange, I get "Floating point exception" when hashing with a zero key.
I would expect another error from an integer operation.
Best regards
Roland
- Re: Resizing hash tables in Guile, (continued)
- Re: Resizing hash tables in Guile, Roland Orre, 2003/02/12
- Re: Resizing hash tables in Guile, Mikael Djurfeldt, 2003/02/13
- Re: Resizing hash tables in Guile, Harvey J. Stein, 2003/02/13
- Re: Resizing hash tables in Guile, Joris van der Hoeven, 2003/02/13
- Re: Resizing hash tables in Guile, Harvey J. Stein, 2003/02/13
- Re: Resizing hash tables in Guile, Paul Jarc, 2003/02/13
- Re: Resizing hash tables in Guile, Joris van der Hoeven, 2003/02/13
- Re: Resizing hash tables in Guile, Rob Browning, 2003/02/12
- Re: Efficiency and flexibility of hash-tables, Roland Orre, 2003/02/10
- Re: Efficiency and flexibility of hash-tables, Paul Jarc, 2003/02/12
- Re: Efficiency and flexibility of hash-tables,
Roland Orre <=