Compile-time memory footprint of std.algorithm

[Marco Leise via Digitalmars-d]

Am Wed, 23 Apr 2014 21:23:17 +0400
schrieb Dmitry Olshansky <dmitry.olsh at gmail.com>:

> 23-Apr-2014 20:56, Daniel Murphy пишет:
> > "Dmitry Olshansky"  wrote in message news:lj7mrr$1p5s$1 at digitalmars.com...
> >> At a times I really don't know why can't we just drop in a Boehm GC
> >> (the stock one, not homebrew stuff) and be done with it. Speed? There
> >> is no point in speed if it leaks that much.
> >
> > Or you know, switch to D and use druntime's GC.
> 
> Good point. Can't wait to see D-only codebase.

Hmm. DMD doesn't use a known and tried, imprecise GC because
it is a lot slower. How is DMD written in D using the druntime
GC going to help that ? I wondered about this ever since there
was talk about DDMD. I'm totally expecting compile times to
multiply by 1.2 or so.

-- 
Marco