On Tue, Apr 15, 2008 at 5:00 PM, Ivan Raikov <[EMAIL PROTECTED]> wrote: > Unit data-structures: > > Lists (alist-ref, alist-update!, ..., join, shuffle, tail?) > Queues (list->queue, queue-...) > Sorting (merge, sort, sorted?) > Strings (conc, ->string, string-...) > Combinators (compose, constantly, etc.) > Binary searching (binary-search)
Sounds good. I have a couple assoc-tree functions that I could contribute to that one. Although, "data structures" could eventually sound like a catch-all too, if we add enough stuff to it. :-) _______________________________________________ Chicken-users mailing list Chicken-users@nongnu.org http://lists.nongnu.org/mailman/listinfo/chicken-users
