GC performances
Lutger
lutger.blijdestijn at gmail.com
Mon Nov 26 08:50:40 PST 2007
bearophile wrote:
> Craig Black:
>
>> Here's an array-based C++ implementation from the shootout. It performs the
>> best but was disqualified because it allocates everything in one big chunk
>> and then uses placement new to allocate each node.
>
> Allocating huge chunks is slow on Win, look at my better version here:
> http://www.digitalmars.com/webnews/newsgroups.php?art_group=digitalmars.D&article_id=62373
>
> Bye,
> bearophile
The code I posted uses an approach similar to the C++ version. There are
some mistakes in there, after fixing those it runs about 6 times as fast
as the code you posted. (dmd 1.022, windows xp, 20 iterations), and
could be optimized further. But it's not the same benchmark.
More information about the Digitalmars-d
mailing list