<?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: Object Caching in Java with EHCache</title>
	<atom:link href="http://karlagius.com/2009/10/07/object-caching-in-java-with-ehcache/feed/" rel="self" type="application/rss+xml" />
	<link>http://karlagius.com/2009/10/07/object-caching-in-java-with-ehcache/</link>
	<description>It&#039;s not rocket science</description>
	<lastBuildDate>Sat, 05 Jun 2010 12:11:00 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
	<item>
		<title>By: Karl</title>
		<link>http://karlagius.com/2009/10/07/object-caching-in-java-with-ehcache/comment-page-1/#comment-1055</link>
		<dc:creator>Karl</dc:creator>
		<pubDate>Thu, 27 May 2010 18:34:59 +0000</pubDate>
		<guid isPermaLink="false">http://karlagius.com/?p=344#comment-1055</guid>
		<description>Hi Emerson, and thanks for the comment :)

Even if we&#039;re not using a self-populating cache, we&#039;re still fully reusing code - CachingSequenceGenerator uses a provided sequence generator to draw its figures. While the example is hard coded to use the fibonacci generator, you could easily wire it up using Spring or any other DI container to take whatever generator you like.

I&#039;m not entirely sure I like a CachingFibonacciServicesImpl in terms of design - that class would have two concerns, not one, as opposed to the CachingSequenceGenerator which only worries about caching and lets the inner generator take care of the rest.</description>
		<content:encoded><![CDATA[<p>Hi Emerson, and thanks for the comment <img src='http://karlagius.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
<p>Even if we&#8217;re not using a self-populating cache, we&#8217;re still fully reusing code &#8211; CachingSequenceGenerator uses a provided sequence generator to draw its figures. While the example is hard coded to use the fibonacci generator, you could easily wire it up using Spring or any other DI container to take whatever generator you like.</p>
<p>I&#8217;m not entirely sure I like a CachingFibonacciServicesImpl in terms of design &#8211; that class would have two concerns, not one, as opposed to the CachingSequenceGenerator which only worries about caching and lets the inner generator take care of the rest.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Emerson Farrugia</title>
		<link>http://karlagius.com/2009/10/07/object-caching-in-java-with-ehcache/comment-page-1/#comment-1054</link>
		<dc:creator>Emerson Farrugia</dc:creator>
		<pubDate>Thu, 27 May 2010 15:54:40 +0000</pubDate>
		<guid isPermaLink="false">http://karlagius.com/?p=344#comment-1054</guid>
		<description>Tip. Code to interfaces, e.g. FibonacciServices. Have FibonacciServicesImpl  do the number crunching work. Have CachingFibonacciServicesImpl ask a self-populating EhCache for the cached sum. The CacheEntryFactory for the self-populating cache gets the sum from .... FibonacciServicesImpl. Full code reuse, and you get build-time or run-time control of whether or not to use caching, e.g. yes in production, no in unit testing, yes in integration testing.</description>
		<content:encoded><![CDATA[<p>Tip. Code to interfaces, e.g. FibonacciServices. Have FibonacciServicesImpl  do the number crunching work. Have CachingFibonacciServicesImpl ask a self-populating EhCache for the cached sum. The CacheEntryFactory for the self-populating cache gets the sum from &#8230;. FibonacciServicesImpl. Full code reuse, and you get build-time or run-time control of whether or not to use caching, e.g. yes in production, no in unit testing, yes in integration testing.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
