On 06/09/2017 11:32 AM, Steven Schveighoffer wrote: > In answer to the subject, no D is not slow. However, it's quite possible > that std.algorithm.bringToFront is slower than std::rotate, or > SortedRange.upperBound is slower than std::upper_bound, or both.
That was exactly my conclusion. I found this C++ article which may point at a similar implementation issue in Phobos:
https://stackoverflow.com/questions/21160875/why-is-stdrotate-so-fast Ali
