Vladimir Panteleev:
This problem isn't something that can be easily fixed. Any stray reference
to any node in the list will prevent nodes following it from ever being
deallocated.
Whoa, a very long and detailed answer :-) Thank you.
Do you know why in LDC this program seems to work in
On Sun, 04 Oct 2009 09:07:59 +0300, bearophile bearophileh...@lycos.com
wrote:
Vladimir Panteleev:
This problem isn't something that can be easily fixed. Any stray
reference
to any node in the list will prevent nodes following it from ever being
deallocated.
Whoa, a very long and
On Thu, 01 Oct 2009 14:23:48 +0300, bearophile bearophileh...@lycos.com
wrote:
Time ago Jon Harrop has found a memory leak in a F# program running on
Mono, he has reduced the program to a minimal test case. I have
translated that code to D2 and Python2:
Sorry for the late reply. I wanted
Time ago Jon Harrop has found a memory leak in a F# program running on Mono, he
has reduced the program to a minimal test case. I have translated that code to
D2 and Python2:
-
struct Node {
int data;
Node* next;
this(int data, Node* next) {
this.data =
bearophile, el 1 de octubre a las 07:23 me escribiste:
Can the D GC be improved to avoid such problem, maybe like the CPython
GC? And is such improvement worth it (= useful in practical programs)?
I've tested it with LDC (using classes instead of structs, because D1
doesn't support struct
bearophile, el 1 de octubre a las 12:39 me escribiste:
Leandro Lucarella:
I've tested it with LDC (using classes instead of structs, because D1
doesn't support struct constructors) and it works with a perfectly stable
memory usage.
That's a different situation, the compiler is
