<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	
	>
<channel>
	<title>
	Comments on: [.NET Internals 05] Garbage collection: marking, collection and heaps compaction	</title>
	<atom:link href="https://www.codejourney.net/net-internals-05-garbage-collection-marking-collection-and-heaps-compaction/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.codejourney.net/net-internals-05-garbage-collection-marking-collection-and-heaps-compaction/</link>
	<description>Become a better .NET full stack web developer</description>
	<lastBuildDate>Sat, 17 Nov 2018 12:12:51 +0000</lastBuildDate>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.9</generator>
	<item>
		<title>
		By: Dawid Sibiński		</title>
		<link>https://www.codejourney.net/net-internals-05-garbage-collection-marking-collection-and-heaps-compaction/#comment-148</link>

		<dc:creator><![CDATA[Dawid Sibiński]]></dc:creator>
		<pubDate>Fri, 07 Sep 2018 20:49:16 +0000</pubDate>
		<guid isPermaLink="false">http://www.dsibinski.pl/?p=2712#comment-148</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://www.codejourney.net/net-internals-05-garbage-collection-marking-collection-and-heaps-compaction/#comment-146&quot;&gt;Matteo Contrini&lt;/a&gt;.

Hey Matteo,
I guess you&#039;re getting this &quot;tree&quot; too literally here. In fact, it&#039;s more like a graph. Don&#039;t treat it as a proper binary tree or something like that. It&#039;s just a &quot;network of references&quot;, while each reference allocated on the stack is a separate GC root.]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://www.codejourney.net/net-internals-05-garbage-collection-marking-collection-and-heaps-compaction/#comment-146">Matteo Contrini</a>.</p>
<p>Hey Matteo,<br />
I guess you&#8217;re getting this &#8220;tree&#8221; too literally here. In fact, it&#8217;s more like a graph. Don&#8217;t treat it as a proper binary tree or something like that. It&#8217;s just a &#8220;network of references&#8221;, while each reference allocated on the stack is a separate GC root.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Matteo Contrini		</title>
		<link>https://www.codejourney.net/net-internals-05-garbage-collection-marking-collection-and-heaps-compaction/#comment-146</link>

		<dc:creator><![CDATA[Matteo Contrini]]></dc:creator>
		<pubDate>Fri, 07 Sep 2018 12:41:29 +0000</pubDate>
		<guid isPermaLink="false">http://www.dsibinski.pl/?p=2712#comment-146</guid>

					<description><![CDATA[How can object references be stored as a tree? An object can be referenced by many other objects, but a tree node cannot have more than one parent]]></description>
			<content:encoded><![CDATA[<p>How can object references be stored as a tree? An object can be referenced by many other objects, but a tree node cannot have more than one parent</p>
]]></content:encoded>
		
			</item>
	</channel>
</rss>
