tag:blogger.com,1999:blog-8952753915088677199.post230673319280040025..comments2008-06-13T09:43:24.393-04:00montsamuhttp://www.blogger.com/profile/07591244606673064670montsamu@gmail.comBlogger2125tag:blogger.com,1999:blog-8952753915088677199.post-53924721202571517032008-06-13T09:43:00.000-04:002008-06-13T09:43:00.000-04:00Luke, that is more beautiful code; is there any performance difference?Matthttp://www.blogger.com/profile/17935063827932240235noreply@blogger.comtag:blogger.com,1999:blog-8952753915088677199.post-20439167393933169702007-02-26T12:53:00.000-05:002007-02-26T12:53:00.000-05:00Maybe I'm a sucker for obfuscation but I like my parallel map better than Joe's:<BR/><BR/>%% Map function F over list L in parallel.<BR/>parmap(F, L) -><BR/> Parent = self(),<BR/> [receive {Pid, Result} -> Result end<BR/> || Pid <- [spawn(fun() -> Parent ! {self(), F(X)} end) || X <- L]].<BR/><BR/>would that the text box understood PRE tags..Luke Gorriehttp://www.blogger.com/profile/09614916402667226914noreply@blogger.com