On Wed, Jun 27, 2012 at 4:57 PM, Leif <leif.poor...@gmail.com> wrote: > Min, like intersection, has a noncomputable "identity" value -- infinity. > And max and min are used in many more algorithms than intersection, so maybe > this will start some discussion.
It seems to me the reducers framework is clearly documented to either need a computable identity or to have an initial value. Given that, it seems reasonable that for such functions that don't have a computable identity you would need: (r/reduce func (first coll) (rest coll)) [perhaps that's why there was no response in this thread?] -- Sean A Corfield -- (904) 302-SEAN An Architect's View -- http://corfield.org/ World Singles, LLC. -- http://worldsingles.com/ "Perfection is the enemy of the good." -- Gustave Flaubert, French realist novelist (1821-1880) -- 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
