|Subject:||Re: [Chicken-users] Set data structure|
|Date:||Tue, 01 Dec 2009 23:03:01 -0600|
|User-agent:||Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv:126.96.36.199pre) Gecko/20091014 Fedora/3.0-2.8.b4.fc11 Lightning/1.0pre Thunderbird/3.0b4|
-----BEGIN PGP SIGNED MESSAGE-----|
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?
Thank you for your link though, Kon,
On 12/01/2009 08:57 PM, Kon Lovett wrote:
> On Dec 1, 2009, at 6:47 PM, Lam Luu wrote:
> Hello everyone,
> Currently, I need to have a data structure that implement set
> (unordered list, in other words). As of know, it seems that there
> is no egg or anything like that implement this, but I just want to
> make sure.
> Do you know of any egg or unit implementing set?
> which is part of Chicken.
> Thank you very much, Lam Luu
Chicken-users mailing list
> Best Wishes, Kon
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.9 (GNU/Linux)
-----END PGP SIGNATURE-----
|[Prev in Thread]||Current Thread||[Next in Thread]|