On 5/30/11, Vladimir Panteleev <[email protected]> wrote: > On Mon, 30 May 2011 04:18:14 +0300, Jeremy Wright <[email protected]> > wrote: > >> I implemented bucket sort in D to demonstrate how easy it is to use >> std.parallelism. I welcome any feedback. > > One thing: I would suggest to avoid using ~= in a tight loop, as it is > rather slow. Using std.array.appender for the first loop and > std.array.join for the second one should be much faster. > > -- > Best regards, > Vladimir mailto:[email protected] >
I wonder why we even have this operator in the language if we're supposed to avoid it all the time.
