Thanks for the link; that helped me read the pmap code properly. So it's not a single thread but n that get initially started, and, if the consumer keeps up, pmap will start a thread when a result value is taken, this staying ahead with max cpu usage. If I understand this correctly, it's the (drop n rets) that takes care of getting the first n threads to get started (by being accessed in order to drop them), and then the second arg will keep accessing n positions ahead by doing a (rest) in the recursive call to (step).
On Apr 30, 12:49 pm, Miki <miki.teb...@gmail.com> wrote: > I think you'll findhttp://blip.tv/file/4645227relevant to the subject. I > shows the inner working of pmap. -- 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
