Optimizing Java using D

[bearophile via Digitalmars-d]

Walter Bright:

> If you could submit a bugzilla issue and include the faster 
> version, that would be great!

My "faster" version is also doing lot of memory swaps (so it's 
not faster in all cases), and it's not generic enough for the 
current ranges, and it doesn't switch to a safe O(n ln n) sort 
like a HeapSort when the ordering of the input data is bad, like 
a safe introsort of a standard library has to do.

So while I sometimes use it, I don't think it will be an 
improvement in the general case.

Bye,
bearophile