Re: [Chicken-users] Set data structure

[Alex Shinn]

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