<html>
<head>
<meta content="text/html; charset=ISO-8859-1"
http-equiv="Content-Type">
</head>
<body bgcolor="#FFFFFF" text="#000000">
On 11-07-05 12:47 PM, Alex Kluge wrote:
<blockquote
cite="mid:1309884458.83579.YahooMailClassic@web112019.mail.gq1.yahoo.com"
type="cite">
<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>
<br>
Alex<br>
</td>
</tr>
</tbody>
</table>
</blockquote>
Alex,<br>
<br>
I've seen references to clock algorithm in research literature. If
you could adapt it to BCHM that would be great!<br>
<br>
Thanks,<br>
Vladimir<br>
</body>
</html>