--- Comment #19 from 2012-05-22 18:00:40 PDT ---
(In reply to comment #17)

Thank you for implementing the Red-Black Tree.

> On my system, the D version with dcollections, which uses the same RBT
> implementation as std.algorithm, takes about 380 milliseconds (-release -O
> -inline), while the equivalent C++ version takes 250 ms.

There is a large difference between your D timings and mine.

> BTW, MAKE SURE you compile with -release for testing, because without this, 
> the
> runtime calls Object.invariant for every method call.

I have used -release too.

I will wait for other people to time the D and C++ versions. If they confirm
such small timing difference (like 380 ms Vs of 250 ms), we can close this bug

Configure issuemail:
------- You are receiving this mail because: -------

Reply via email to