-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 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, Lam 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? > >> See > http://srfi.schemers.org/srfi-1/srfi-1.html#SetOperationsOnLists > which is part of Chicken. > > > Thank you very much, Lam Luu >> >> _______________________________________________ Chicken-users mailing list [email protected] http://lists.nongnu.org/mailman/listinfo/chicken-users > Best Wishes, Kon -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.9 (GNU/Linux) iEYEARECAAYFAksV9QQACgkQwnXdyzbwLCX4jwCfalb1l6IWAdqaFSf/O/Bkzf11 RVcAmgP97cKOa7p+CkpwTmQOhz2NNj2D =5zNr -----END PGP SIGNATURE-----
_______________________________________________ Chicken-users mailing list [email protected] http://lists.nongnu.org/mailman/listinfo/chicken-users
