Yes I mean reachable from a root.
snipIf it was able to determine whether objects were reachable without
performing a GC, it wouldn't need to do most of the work involved in
performing a GC!/snip
Interesting. I thought that the graph calculation was comparatively less
expensive than compacting
Interesting. I thought that the graph calculation was comparatively
less expensive than compacting the memory.
Yes, they are. BUT they are done in the cylce of the GC. They are not
tracked when the GC is not running. Otherwise all the ref counting would add
up to a lot of work. And introduce
-Original Message-
From: Moderated discussion of advanced .NET topics.
[mailto:[EMAIL PROTECTED] On Behalf Of Pinto, Ed
Sent: Freitag, 8. August 2003 03:09
To: [EMAIL PROTECTED]
Yes I mean reachable from a root.
snipIf it was able to determine whether objects were
reachable
You can not know. The GC does not know either, until it runs. Rooting
information is not tracked during program execution.
What do you try to achieve?
Thomas Tomiczek
THONA Software Consulting Ltd.
(Microsoft MVP C#/.NET)
-Original Message-
From: Moderated discussion of advanced
