On Jul 21, 2010, at 12:44 PM, Michał Marczyk wrote: > The biggest problem with the code is that it reconstructs the entire > `ordered-ips` vector minus the last entry picked at each iteration. It > would be simpler and *much* more performant to do > > (shuffle ordered-ips) > > Also note that Clojure 1.2 provides an `rand-nth` function for doing > > (let [i (count xs)] (get xs (rand-int i)))
I believe shuffle is only in clojure.core as of 1.2. Before that, you'd find it in clojure.contrib.seq. -- 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 Note that posts from new members are moderated - please be patient with your first post. 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
