<?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"
	>
<channel>
	<title>Comments on: LazyList based on the Google Collections Library</title>
	<atom:link href="http://maas-frensch.com/peter/2007/10/01/lazylist-based-on-the-google-collections-library/feed/" rel="self" type="application/rss+xml" />
	<link>http://maas-frensch.com/peter/2007/10/01/lazylist-based-on-the-google-collections-library/</link>
	<description>Peter Maas's Weblog</description>
	<pubDate>Fri, 29 Aug 2008 00:14:36 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5</generator>
		<item>
		<title>By: erikvanoosten</title>
		<link>http://maas-frensch.com/peter/2007/10/01/lazylist-based-on-the-google-collections-library/#comment-6221</link>
		<dc:creator>erikvanoosten</dc:creator>
		<pubDate>Tue, 02 Oct 2007 09:00:36 +0000</pubDate>
		<guid isPermaLink="false">http://maas-frensch.com/peter/2007/10/01/lazylist-based-on-the-google-collections-library/#comment-6221</guid>
		<description>Otherwise: nice post (sorry, forgot to say that in the other comment).</description>
		<content:encoded><![CDATA[<p>Otherwise: nice post (sorry, forgot to say that in the other comment).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: erikvanoosten</title>
		<link>http://maas-frensch.com/peter/2007/10/01/lazylist-based-on-the-google-collections-library/#comment-6220</link>
		<dc:creator>erikvanoosten</dc:creator>
		<pubDate>Tue, 02 Oct 2007 08:59:00 +0000</pubDate>
		<guid isPermaLink="false">http://maas-frensch.com/peter/2007/10/01/lazylist-based-on-the-google-collections-library/#comment-6220</guid>
		<description>My point was: when you are growing the list, you may want to use the potentially more efficient addAll. In particular when you're adding to an ArrayList, the array can be resized in advance. Growing arrays is often a big performance hit in Java programs.

You only need to device some smart immutable collection that returns the right amount of nulls.</description>
		<content:encoded><![CDATA[<p>My point was: when you are growing the list, you may want to use the potentially more efficient addAll. In particular when you&#8217;re adding to an ArrayList, the array can be resized in advance. Growing arrays is often a big performance hit in Java programs.</p>
<p>You only need to device some smart immutable collection that returns the right amount of nulls.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: erikvanoosten</title>
		<link>http://maas-frensch.com/peter/2007/10/01/lazylist-based-on-the-google-collections-library/#comment-6218</link>
		<dc:creator>erikvanoosten</dc:creator>
		<pubDate>Tue, 02 Oct 2007 08:56:20 +0000</pubDate>
		<guid isPermaLink="false">http://maas-frensch.com/peter/2007/10/01/lazylist-based-on-the-google-collections-library/#comment-6218</guid>
		<description>Right, my message was truncated!</description>
		<content:encoded><![CDATA[<p>Right, my message was truncated!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: erikvanoosten</title>
		<link>http://maas-frensch.com/peter/2007/10/01/lazylist-based-on-the-google-collections-library/#comment-6217</link>
		<dc:creator>erikvanoosten</dc:creator>
		<pubDate>Tue, 02 Oct 2007 08:51:32 +0000</pubDate>
		<guid isPermaLink="false">http://maas-frensch.com/peter/2007/10/01/lazylist-based-on-the-google-collections-library/#comment-6217</guid>
		<description>Regarding

// we have to grow the list
            for (int i = size; i </description>
		<content:encoded><![CDATA[<p>Regarding</p>
<p>// we have to grow the list<br />
            for (int i = size; i</p>
]]></content:encoded>
	</item>
</channel>
</rss>
