It doesn't even do LFU well. The second least frequently used item can get deleted. It's the same LRU problem. The *very* least recently used item doesn't get deleted, so it is strictly lest recently used, but I'm not sure anyone wants that, especially in LFU. Might as well leave the name as is and change the code.
We need a good LFU implementation. This will be a significant project. Aaron > -----Original Message----- > From: James Strachan [mailto:[EMAIL PROTECTED]] > Sent: Friday, February 15, 2002 8:20 AM > To: Jakarta Commons Developers List > Subject: Re: [collections][PATCH] LRUMap - license, docs update > > ----- Original Message ----- > From: "Michael Smith" <[EMAIL PROTECTED]> > > > Maybe renaming it to FastLRUMap that approximates LRU but > > > isn't totally > > > accurate in all circumstances might help? > > > > To me, that makes it even more confusing. > > OK how about calling it LFUMap - "least frequently used" which seems a > more > accurate description of the algorithm than "least recently used". > > James > > > > _________________________________________________________ > > Do You Yahoo!? > > Get your free @yahoo.com address at http://mail.yahoo.com > > > > > -- > To unsubscribe, e-mail: <mailto:commons-dev- > [EMAIL PROTECTED]> > For additional commands, e-mail: <mailto:commons-dev- > [EMAIL PROTECTED]> -- To unsubscribe, e-mail: <mailto:[EMAIL PROTECTED]> For additional commands, e-mail: <mailto:[EMAIL PROTECTED]>
