Eung-ju Park wrote: > > To have a LRU 'hit' effect, it removes the object from the list > > and put it at the top. > > What if the list is really huge? I mean, to perform the remove it
> It is not a Cache if it is really huge. ;-) Just kidding. Well I think something greater than 100 elements is enough to get a real speedup when using an indexed technique. IMO, speed is probably the top most important feature for a cache. Maybe it is off topic or quiet late, but what is your opinion about Jcache ? http://jcp.org/jsr/detail/107.jsp > Yes. If you want that kind of ReplacementPolicy. Just implement it. and use > like bellow. well currently I dont really need it :D (that was just a suggestion), but I'll try to propose something clean as soon as I've finish my current work. > final Cache cache = new DefaultCache( new TimeMapLRUCachePolicy(), > MemoryCacheStore( 1000000000 ) ); > > and test it. > and send to this list. no prob. staytuned :) -- mailto:[EMAIL PROTECTED] - http://sourceforge.net/projects/jabaserver -- To unsubscribe, e-mail: <mailto:[EMAIL PROTECTED]> For additional commands, e-mail: <mailto:[EMAIL PROTECTED]>
