On Jun 2, 2014, at 4:52 PM, Jozef Wagner <jozef.wag...@gmail.com> wrote:
> Reducers [1] provide eager variants of some core seq functions (map, filter, > etc.). Note that they do not cache the result, so they recompute it every > time you use their result. > > [1] http://clojure.org/reducers Thanks Josef. I haven't yet really looked into reducers, but it seems on first glance like it may be overkill for just dealing with this issue -- using fork/join and getting unneeded parallelism for routine sequence processing, just to ensure that one doesn't have laziness-related bugs. The recomputation also sounds potentially problematic. But I do want to look into reducers for other purposes, so thanks for the pointer! -Lee -- 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 --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
