Short article on std.parallism

[Lars T. Kyllingstad]

On Sun, 29 May 2011 18:18:14 -0700, Jeremy Wright wrote:

> I implemented bucket sort in D to demonstrate how easy it is to use
> std.parallelism.  I welcome any feedback.
> 
> http://www.codestrokes.com/archives/116

Nice article. :)

A tip to make the code even more terse:  You can replace taskPool.parallel
() with parallel().  The latter just forwards to the former.  (See the 
last item of the std.parallelism docs.)

-Lars