Re: Developer machine spec for Linux kernel w/ darcs

(sorry if you get this message twice)

David Roundy <droundy <at> abridgegame.org> writes:
> No, the patch contents don't end up getting copied all over the place.
> Basically, they're stored as essentially pointers, so when you commute they
> don't need to be modified.  And in fact darcs also has its own special
> string-handling library which handles things like splitting strings into
> substrings without copying any data.  The catch is that the original string
> has to be held in memory, of course, but usually that's not a
> problem.

OK, it is better than I thought.

I'm not familiar with Haskell or darcs internals. I just cannot find
an explanation for the huge amount of memory used - for a 300MB source
tree, the memory usage is more than 600MB. I don't know how much of
this amount is uncollected garbage. It would be normal for something
like 450MB due to the linked lists etc. but it is actually more than
double.

Catalin