<br><div class="gmail_quote">On Tue, Jul 5, 2011 at 7:47 PM, Alex Kluge <span dir="ltr"><<a href="mailto:java_kluge@yahoo.com">java_kluge@yahoo.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
<table border="0" cellpadding="0" cellspacing="0"><tbody><tr><td style="font:inherit" valign="top">Hi,<br><br> I have a completely in-line limit on the cache entries built on a clock cache that is an approximation to an LRU cache, and is extremely fast (O(1)). It is not a strick LRU, but chooses a not recently used item for removal. I'll provide some more details soon.<br>
<br> I'm not sure how far along you are, as some of this is in the future tense, and some in the past. But I'll dig up this code - it's been a while since I worked on the cache. :)<br></td></tr></tbody></table>
</blockquote></div><br>This sounds great Alex. We're not strictly LRU either because the policy is enforced at the map segment level, so we don't always evict the oldest element in the map.<br><br>Maybe you also have a good cache/eviction policy test? ;-)<br>
<br>Cheers<br>Dan<br><br>