Hello Tassilo and all again, Thank you for your kind words to me and useful consideration.
However, you have to reverse the list > of functions, which destroys the theoretical benefit. > Exactly! > But still my reverse-the-collection-and-then-reduce-it approach is still > much faster, although it has to iterate the collection twice. It seems to make things faster using a '(transient [])'. Thank you. > I'm not exactly sure why, but I'd guess the allocation overhead for 2 > million partial functions is rather expensive. > Allocation of partial functions is expensive as you say. May it be that 'conj'ing an element at the last of a collection still takes much cost than 'cons'ing an element at the head of it and reversing? I'll keep thinking and trying. Regards, Yoshinori Kohyama -- 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
