https://issues.dlang.org/show_bug.cgi?id=13410
--- Comment #38 from [email protected] --- The original D program ( http://forum.dlang.org/thread/[email protected] ) was about 30 times slower than the equivalent C++ code. Now the D code is only 5 times slower than the C++ code. So the situation is much better now. But the two programs are not exactly equivalent: the C++ code uses a tree-based map while the D code uses the built-in hash-based associative array. --
