That one is elegant, but uses more than the minimum number of additions, one of the conditions I mentioned in the original post. (In real instances of this pattern in my code, the addition contains other function that are very costly to perform, which is part of the reason for this post.)
On Dec 27, 10:58 pm, Fogus <mefo...@gmail.com> wrote: > How about this? > > (defn left-total [coll] > (map (fn [[l r]] [l (reduce + r)]) > (for [i (range (count coll))] > [(first (drop i coll)) (take i coll)]))) > > -m -- 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
