Is there a Java collection which removes items as more items are added? (a simple cache) [duplicate]

Answer 1

Apache Commons – CircularFifoQueue

CircularFifoQueue is a first-in first-out queue with a fixed size that replaces its oldest element if full.

I guess this is the behavior what you are looking for. Its from the Apache commons collections (link)