On Sun, Nov 15, 2009 at 12:10 AM, Terry Reedy <tjre...@udel.edu> wrote:
> Paul Rubin wrote: > > Mark Chu-Carroll has a new post about Go: >> >> >> http://scienceblogs.com/goodmath/2009/11/the_go_i_forgot_concurrency_an.php >> > > In a couple of minutes, I wrote his toy prime filter example in Python, > mostly from the text rather than the code, which I can barely stand to read. > It ran the first time without error. > > Yes, but the cool thing about the Go version is that it does each generator in a different thread, so in theory it could run twice as fast on a multi-core machine. Y
-- http://mail.python.org/mailman/listinfo/python-list
