here is the final version of the implementation. http://gist.github.com/313558
again, any thought would be great. Aviad. On 22 February 2010 22:11, Aviad Reich <avi....@gmail.com> wrote: > I don't mean to signal the end of this thread, but I just wanted to thank > you all for you replies. > I will update the draft (and add Colin and Mikel's infinite seq code as > well) possible in a day or two (no at home till then), and post the new code > before posting to Rosetta. > > Cheers, > Aviad > > > > On 22 February 2010 14:47, Michael Kohl <citizen...@gmail.com> wrote: > >> On Mon, Feb 22, 2010 at 11:43 AM, Johnny Kwan <johnny.c.k...@gmail.com> >> wrote: >> > Whichever is faster depends on the size of the argument list >> >> I see, thanks for clarifying. I'd then change my version to this since >> I still like map with an anonymous function more than the >> for-comprehension in this case. >> >> defn h-mean [coll] >> (/ (count coll) (reduce + (map #(/ 1 %) coll)))) >> >> Michael >> >> -- >> 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<clojure%2bunsubscr...@googlegroups.com> >> For more options, visit this group at >> http://groups.google.com/group/clojure?hl=en >> > > -- 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
