I've written up a fast, iterative version of a "unique-selections" function, consistent with the approach taken in the other combinatorics functions.
http://paste.lisp.org/display/74710 I haven't benchmarked it, but I would expect this version to be the fastest of the alternatives mentioned here. Let me know whether this is what you were looking for, and if so, I can add it to the library. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en -~----------~----~----~----~------~----~------~--~---
