<?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: Easy LRU cache with Java</title>
	<atom:link href="http://www.thewebsemantic.com/2009/05/05/easy-lru-with-java/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.thewebsemantic.com/2009/05/05/easy-lru-with-java/</link>
	<description>data for humans and computers and the tools that make it available</description>
	<lastBuildDate>Fri, 11 Jun 2010 16:45:02 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.1</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: karol d.p.</title>
		<link>http://www.thewebsemantic.com/2009/05/05/easy-lru-with-java/comment-page-1/#comment-1015</link>
		<dc:creator>karol d.p.</dc:creator>
		<pubDate>Thu, 27 Aug 2009 20:41:54 +0000</pubDate>
		<guid isPermaLink="false">http://www.thewebsemantic.com/?p=146#comment-1015</guid>
		<description>Ok, sorry, i just java.util.LinkedHashMap.LinkedHashMap(int, float, boolean) , third param</description>
		<content:encoded><![CDATA[<p>Ok, sorry, i just java.util.LinkedHashMap.LinkedHashMap(int, float, boolean) , third param</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: karol d.p.</title>
		<link>http://www.thewebsemantic.com/2009/05/05/easy-lru-with-java/comment-page-1/#comment-1014</link>
		<dc:creator>karol d.p.</dc:creator>
		<pubDate>Thu, 27 Aug 2009 20:39:20 +0000</pubDate>
		<guid isPermaLink="false">http://www.thewebsemantic.com/?p=146#comment-1014</guid>
		<description>Hi. When using LinkedHashMap with removeEldestEntry: isn&#039;t it actually &quot;Least Recently _Added_&quot; policy?

I believe, that LRU would require moving an entry to the front, in &quot;get(....)&quot; method.

And, AFAIK, to move an entry to the front, it is required to remove the item and then re-add it.</description>
		<content:encoded><![CDATA[<p>Hi. When using LinkedHashMap with removeEldestEntry: isn&#8217;t it actually &#8220;Least Recently _Added_&#8221; policy?</p>
<p>I believe, that LRU would require moving an entry to the front, in &#8220;get(&#8230;.)&#8221; method.</p>
<p>And, AFAIK, to move an entry to the front, it is required to remove the item and then re-add it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark</title>
		<link>http://www.thewebsemantic.com/2009/05/05/easy-lru-with-java/comment-page-1/#comment-1013</link>
		<dc:creator>Mark</dc:creator>
		<pubDate>Wed, 26 Aug 2009 20:40:57 +0000</pubDate>
		<guid isPermaLink="false">http://www.thewebsemantic.com/?p=146#comment-1013</guid>
		<description>Or just use the LRUMap class from Jakarta Commons Collections.

http://commons.apache.org/collections/apidocs/org/apache/commons/collections/map/LRUMap.html</description>
		<content:encoded><![CDATA[<p>Or just use the LRUMap class from Jakarta Commons Collections.</p>
<p><a href="http://commons.apache.org/collections/apidocs/org/apache/commons/collections/map/LRUMap.html" rel="nofollow">http://commons.apache.org/collections/apidocs/org/apache/commons/collections/map/LRUMap.html</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tino</title>
		<link>http://www.thewebsemantic.com/2009/05/05/easy-lru-with-java/comment-page-1/#comment-1010</link>
		<dc:creator>Tino</dc:creator>
		<pubDate>Tue, 30 Jun 2009 10:06:48 +0000</pubDate>
		<guid isPermaLink="false">http://www.thewebsemantic.com/?p=146#comment-1010</guid>
		<description>You need not create your own class. You can also specifiy the LRU-settings when creating instances of a LinkedHashMap.

Please see the example for LRU-caching on http://www.java-blog.com/creating-simple-cache-java-linkedhashmap-anonymous-class</description>
		<content:encoded><![CDATA[<p>You need not create your own class. You can also specifiy the LRU-settings when creating instances of a LinkedHashMap.</p>
<p>Please see the example for LRU-caching on <a href="http://www.java-blog.com/creating-simple-cache-java-linkedhashmap-anonymous-class" rel="nofollow">http://www.java-blog.com/creating-simple-cache-java-linkedhashmap-anonymous-class</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>
