[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Chicken-users] Set data structure
From: |
Alex Shinn |
Subject: |
Re: [Chicken-users] Set data structure |
Date: |
Wed, 02 Dec 2009 14:16:18 +0900 |
User-agent: |
Gnus/5.13 (Gnus v5.13) Emacs/23.1 (gnu/linux) |
Lam Luu <address@hidden> writes:
> Well, that's is set in list, which is horribly slow (O(n) IS very
> slow, for most intends and purposes). I guess my question something
> like, is there any implementation of set in chicken that is at least
> O(log n), aka using binary search tree of some sort?
For integer sets there's the iset egg, which is highly
optimized. For other data types you can just use a
hash-table.
--
Alex