Possibly it could also be a MRU (Most Recently Used) cache.
At 2005-07-03 23:39, you wrote:
>I'd say you were looking for an ordinary priority queue, where the
>priority=the timestamp. Try the Heap class.
>
>Sincerely,
>Silas Snider
>
>On 7/3/05, Wendy Smoak <java@wendysmoak.com> wrote:
> > I'm looking through the Collections API, but not finding exactly what I
> > want... hoping someone who's more familiar with it can point me
> in the right
> > direction.
> >
> > What I'm trying to do is more or less what you see on catalog sites where
> > they'll list the most recent items you've looked at, newest on
> top. So it's
> > ordered (List), but has no duplicates (Set), and I need to have
> a max size.
> >
> > ListOrderedSet is almost there, except that it retains the 'old'
> position if
> > you add the same item again. (And has no max length.)
> >
> > So... before I either write it myself or extend ListOrderedSet to
> make it do
> > what I want, does anyone have another suggestion? And what would
> _you_ call
> > it?
> >
> > Thanks,
> > Wendy Smoak
---------------------------------------------------------------------
To unsubscribe, e-mail: commons-user-unsubscribe@jakarta.apache.org
For additional commands, e-mail: commons-user-help@jakarta.apache.org
|